Abstract
A VU-decomposition method for solving a second-order cone problem is presented in this paper. It is first transformed into a nonlinear programming problem. Then, the structure of the Clarke subdifferential corresponding to the penalty function and some results of its VU-decomposition are given. Under a certain condition, a twice continuously differentiable trajectory is computed to produce a second-order expansion of the objective function. A conceptual algorithm for solving this problem with a superlinear convergence rate is given.
Similar content being viewed by others
References
Alizadeh, F. and Schmieta, S. Symmetric cones, potential reduction methods. Handbook of Semidefinite Programming (eds. Wolkowicz, H., Saigal, R., and Vandenberghe, L.), Kluwer, Boston, 195–233 (2000)
Benson, H. Y. and Vanderbei, R. J. Solving problems with semidefinite and related constraints using interior point methods for nonlinear programming. Mathematical Programming 95, 279–302 (2003)
Fukushima, M., Luo, Z. Q., and Tseng, P. Smoothing functions for second-order-cone complementarity problems. SIAM Journal on Optimization 12, 436–460 (2001)
Kanzow, C., Ferenczi, I., and Fukushima, M. Semismooth Methods for Linear and Nonlinear Second-Order Cone Programs, Technical Report 2006-005, Department of Applied Mathematics and Physics, Kyoto University (2006)
Liu, Y. J., Zhang, L. W., and Wang, Y. H. Convergence properties of a smoothing method for linear second-order cone programming. Advances in Mathematics 36(4), 491–502 (2007)
Liu, Y. J. and Zhang, L. W. Convergence of augmented lagrangian method for nonlinear optimization problems over second-order cones. Journal of Optimization Theory and Applications 139, 557–575 (2008)
Bai, Y. Q. and Wang, G. Q. Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function. Acta Mathematica Sinica, English Series 23(11), 2027–2042 (2007)
Lemaréchal, C., Oustry, F., and Sagastizábal, C. The U-lagrangian of a convex function. Transactions of the American Mathematical Society 352(2), 711–729 (2000)
Mifflin, R. and Sagastizábal, C. VU-decomposition derivatives for convex max-functions. Illposed Variational Problems and Regularization Techniques in Lecture Notes in Economics and Mathematical Systems (eds. Tichatschke, R. and Théra, M.), Vol. 477, Springer-Verlag, Berlin/Heidelberg, 167–186 (1999)
Oustry, F. A second-order bundle method to minimize the maximum eigenvalue function. Mathematical Programming 89(1), 1–33 (2000)
Mifflin, R. and Sagastizábal, C. On VU-Theory for functions with primal-dual gradient strcture. SIAM Journal on Optimization 11, 547–571 (2000)
Mifflin, R. and Sagastizábal, C. Primal-dual gradient structured functions: second-order results; links to epi-derivatives and partly smooth functions. SIAM Journal on Optimization 13, 1174–1194 (2003)
Mifflin, R. and Sagastizábal, C. Functions with primal-dual gradient structure and U-Hessians. Nonlinear Optimization and Related Topics (eds. Di Pillo, G. and Giannessi, F.) 36, Kluwer Academic Publishers B.V., Dordrecht, 219–233 (2000)
Shan, Feng, Pang, Li-ping, Zhu, Li-mei, and Xia, Zun-quan. A UV-decomposed method for solving an MPEC problem. Appl. Math. Mech. -Engl. Ed. 29(4), 535–540 (2008) DOI 10.1007/s10483-008-0412-y
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by He-xiang LÜ
Project supported by the National Natural Science Foundation of China (No. 10771026) and the Foundation of Dalian University of Technology (Nos. MXDUT73008 and MXDUT98009)
Rights and permissions
About this article
Cite this article
Lu, Y., Pang, Lp. & Xia, Zq. A VU-decomposition method for a second-order cone programming problem. Appl. Math. Mech.-Engl. Ed. 31, 263–270 (2010). https://doi.org/10.1007/s10483-010-0214-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10483-010-0214-6