Advertisement

An Infeasible Interior-Point Algorithm for Stochastic Second-Order Cone Optimization

  • Baha AlzalgEmail author
  • Khaled Badarneh
  • Ayat Ababneh
Article
  • 107 Downloads

Abstract

Alzalg (J Optim Theory Appl 163(1):148–164, 2014) derived a homogeneous self-dual algorithm for stochastic second-order cone programs with finite event space. In this paper, we derive an infeasible interior-point algorithm for the same stochastic optimization problem by utilizing the work of Rangarajan (SIAM J Optim 16(4), 1211–1229, 2006) for deterministic symmetric cone programs. We show that the infeasible interior-point algorithm developed in this paper has complexity less than that of the homogeneous self-dual algorithm mentioned above. We implement the proposed algorithm to show that they are efficient.

Keywords

Second-order cone programming Stochastic programming Infeasible interior-point algorithms Euclidean Jordan algebra 

Mathematics Subject Classification

90C25 90C06 90C15 90C30 90C51 90C60 

Notes

Acknowledgements

A part of the first author’s work was performed while he was visiting The Center for Applied and Computational Mathematics at Rochester Institute of Technology, NY, USA. The work of the first author was supported in part by Deanship of Scientific Research at The University of Jordan. The authors thank the two expert anonymous referees for their valuable suggestions, whose constructive comments have greatly enhanced the paper.

References

  1. 1.
    Alzalg, B.: Stochastic second-order cone programming: application models. Appl. Math. Model. 36, 5122–5134 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. Ser. B 95, 3–51 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Alzalg, B., Ariyawansa, K.A.: Logarithmic barrier decomposition-based interior-point methods for stochastic symmetric programming. J. Math. Anal. Appl. 409, 973–995 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Alzalg, B.: Decomposition-based interior point methods for stochastic quadratic second-order cone programming. Appl. Math. Comput. 249, 1–18 (2014)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Alzalg, B.: Volumetric barrier decomposition algorithms for stochastic quadratic second-order cone programming. Appl. Math. Comput. 256, 494–508 (2015)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Alzalg, B.: Homogeneous self-dual algorithms for stochastic second-order cone programming. J. Optim. Theory Appl. 163(1), 148–164 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Nesterov, Y.E.: Infeasible start interior point primal-dual methods in nonlinear programming. Working paper, Center for Operations Research and Econometrics, 1348 Louvain-la-Neuve, Belgium (1994)Google Scholar
  8. 8.
    Rangarajan, B.K.: Polynomial convergence of infeasible-interior-point methods over symmetric cones. SIAM J. Optim. 16(4), 1211–1229 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Potra, F., Sheng, R.: A superlinearly convergent primal-dual infeasible interior point algorithm for semidefinite programming. SIAM J. Optim. 8(4), 1007–1028 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Xiaoni, C., Sanyang, L.: An infeasible-interior-point predictor-corrector algorithm for the second-order cone program. Acta Math. Sci. 28(3), 551–559 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Castro, J.: An interior-point approach for primal block-angular problems. Comput. Optim. Appl. 36, 195–219 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Castro, J., Cuesta, J.: Quadratic regularization in an interior-point method for primal block-angular problems. Math. Program. 130, 415–445 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Monteiro, R.D.: Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. 7, 663–678 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Zhang, Y.: On extending primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8, 356–386 (1998)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Schmieta, S.H., Alizadeh, F.: Extension of primal-dual interior point methods to symmetric cones. Math. Program. Ser. A 96, 409–438 (2003)CrossRefzbMATHGoogle Scholar
  16. 16.
    Helmberg, C., Rendl, F., Vanderbei, R., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342–361 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Kojima, M., Shindoh, S., Hara, S.: Interior-point methods for the monotone semidefinite linear complementary problem in symmetric matrices. SIAM J. Optim. 7, 86–125 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Nesterov, Y.E., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8, 324–364 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Potra, F., Sheng, R.: On homogeneous interior-point algorithms for semidefinite programming. Optim. Methods Softw. 9, 161–184 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Alzalg, B., Maggiono, F., Vitali, S.: Homogeneous self-dual methods for symmetric cones under uncertainty. Far East J. Math. Sci. 99(11), 1603–1778 (2016)zbMATHGoogle Scholar
  21. 21.
    De Klerk, E., Roos, C., Terlaky, T.: Infeasible-start semidefinite programming algorithms via self-dual embeddings. Fields Inst. Commun. 18, 215–236 (1998)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of MathematicsThe University of JordanAmmanJordan
  2. 2.School of Mathematical SciencesRochester Institute of TechnologyRochesterUSA
  3. 3.Department of MathematicsThe Ohio State UniversityColumbusUSA

Personalised recommendations