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.
Similar content being viewed by others
References
Alzalg, B.: Stochastic second-order cone programming: application models. Appl. Math. Model. 36, 5122–5134 (2012)
Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. Ser. B 95, 3–51 (2003)
Alzalg, B., Ariyawansa, K.A.: Logarithmic barrier decomposition-based interior-point methods for stochastic symmetric programming. J. Math. Anal. Appl. 409, 973–995 (2014)
Alzalg, B.: Decomposition-based interior point methods for stochastic quadratic second-order cone programming. Appl. Math. Comput. 249, 1–18 (2014)
Alzalg, B.: Volumetric barrier decomposition algorithms for stochastic quadratic second-order cone programming. Appl. Math. Comput. 256, 494–508 (2015)
Alzalg, B.: Homogeneous self-dual algorithms for stochastic second-order cone programming. J. Optim. Theory Appl. 163(1), 148–164 (2014)
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)
Rangarajan, B.K.: Polynomial convergence of infeasible-interior-point methods over symmetric cones. SIAM J. Optim. 16(4), 1211–1229 (2006)
Potra, F., Sheng, R.: A superlinearly convergent primal-dual infeasible interior point algorithm for semidefinite programming. SIAM J. Optim. 8(4), 1007–1028 (1998)
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)
Castro, J.: An interior-point approach for primal block-angular problems. Comput. Optim. Appl. 36, 195–219 (2007)
Castro, J., Cuesta, J.: Quadratic regularization in an interior-point method for primal block-angular problems. Math. Program. 130, 415–445 (2011)
Monteiro, R.D.: Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. 7, 663–678 (1997)
Zhang, Y.: On extending primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8, 356–386 (1998)
Schmieta, S.H., Alizadeh, F.: Extension of primal-dual interior point methods to symmetric cones. Math. Program. Ser. A 96, 409–438 (2003)
Helmberg, C., Rendl, F., Vanderbei, R., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342–361 (1996)
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)
Nesterov, Y.E., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8, 324–364 (1998)
Potra, F., Sheng, R.: On homogeneous interior-point algorithms for semidefinite programming. Optim. Methods Softw. 9, 161–184 (1998)
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)
De Klerk, E., Roos, C., Terlaky, T.: Infeasible-start semidefinite programming algorithms via self-dual embeddings. Fields Inst. Commun. 18, 215–236 (1998)
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.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Florian Potra.
Rights and permissions
About this article
Cite this article
Alzalg, B., Badarneh, K. & Ababneh, A. An Infeasible Interior-Point Algorithm for Stochastic Second-Order Cone Optimization. J Optim Theory Appl 181, 324–346 (2019). https://doi.org/10.1007/s10957-018-1445-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-018-1445-8
Keywords
- Second-order cone programming
- Stochastic programming
- Infeasible interior-point algorithms
- Euclidean Jordan algebra