Abstract
In this paper, we study a modified version of the conic trust region subproblem which arises within a class of nonlinear programming algorithms. First using a variant of S-Lemma, we give an SOCP/SDP formulation which gives its optimal objective value. Then using the parametrization approach of Dinkelbach and the known exact SOCP/SDP relaxation of the extended trust region subproblem, we find its optimal solution. Finally, some preliminary numerical results are given.
Similar content being viewed by others
Notes
Second order cone program/Semidefinite program.
Thanks to one of the reviewers who suggested this simplified version of proposition and a short proof.
References
Adachi, S., Iwata, S., Nakatsukasa, Y., Takeda, A.: Solving the trust region subproblem by a generalized eigenvalue problem. Mathematical Engineering Technical Report(METR 2015-14), Department of Mathematical Informatics Graduate School of Information Science and Technology The University of Tokyo
Ariyawansa, K.A.: Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms. Math. Program. 49, 23–48 (1990)
Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization: analysis, algorithms, and engineering applications. MPS-SIAM Series on Optimization, Philadelphia (2001)
Burer, S., Anstreicher, K.M.: Second-order-cone constraints for extended trust-region subproblems. SIAM J. Optim. 23(1), 432–451 (2013)
Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust region methods. MPS-SIAM Series on Optimization, Philadelphia (2000)
Davidon, W.C.: Conic approximations and collinear scalings for optimizers. SIAM J. Numer. Anal. 17, 268–281 (1980)
Di, S., Sun, W.Y.: A trust region method for conic model to solve unconstrained optimization. Optim. Methods Softw. 6, 237–263 (1996)
Dinkelbach, W.: On nonlinear fractional programming. Manage. Sci. 13, 492–498 (1967)
Fortin, C., Wolkowicz, H.: The trust region subproblem and semidefinite programming. Optim. Methods Softw. 19(1), 41–67 (2004)
Fallahi, S., Salahi, M.: Necessary and sufficient optimality conditions for the extended trust region subproblem. (2016)
Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.0 beta. http://cvxr.com/cvx (2013)
Han, Q., Sun, W., Han, J., Sampaio, R.J.B.: An adaptive conic trust-region method for unconstrained optimization. Optim. Methods Softw. 20(6), 665–677 (2005)
Lu, X., Ni, Q.: A quasi-Newton trust region method with a new conic model for the unconstrained optimization. Appl. Math. Comput. 204, 373–384 (2008)
Moré, J.J., Garbow, B.S., Hilstron, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17–41 (1981)
Nguyen, V.B., Sheu, R.L., Xia, Y.: An SDP approach for quadratic fractional problems with a two-sided quadratic constraint. Optim. Methods Softw. 31(4), 701–719 (2016)
Ni, Q.: Optimality conditions for trust-region subproblems involving a conic model. SIAM J. Optim. 15(3), 826–837 (2005)
Qu, S.J., Jiang, S.D., Zhu, Y.: A conic trust-region method and its convergence properties. Comput. Math. Appl. 57, 513–528 (2009)
Rendl, F., Wolkowicz, H.: A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Program. 77(1), 273–299 (1997)
Salahi, M., Fallahi, S.: Trust region subproblem with an additional linear inequality constraint. Optim. Lett. 10, 821–832 (2016)
Salahi, M., Taati, A., Wolkowicz, H.: Local nonglobal minima for solving large scale extended trust region subproblems. Comput. Optim. Appl. (2016). doi:10.1007/s10589-016-9867-4
Sturm, J.F., Zhang, S.: On cones of nonnegative quadratic functions. Math. Oper. Res. 28(2), 246–267 (2003)
Sun, W.Y., Yuan, Y.X.: A conic trust-region method for nonlinearly constrained optimization. Ann. Oper. Res. 103, 175–191 (2001)
Xia, Y.: On minimizing the ratio of quadratic functions over an ellipsoid. Optimization 64(5), 1097–1106 (2015)
Xia, Y., Wang, S., Sheu, R.L.: S-lemma with equality and its applications. Math. Program. 156(1), 513–547 (2016)
Zhang, A., Hayashi, Sh.: Celis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints. Numer. Algebra Control Optim. 1, 83–98 (2011)
Acknowledgments
The author would like to thank suggestions from the three reviewers which substantially improved the current version of the paper and Prof. Wolkowicz for his fruitful discussion on variants of trust region subproblem. The financial support of University of Guilan during author’s sabbatical leave 2015-16, hosted by Prof. Wolkowicz at the Department of Combinatorics and Optimization, University of Waterloo is appreciated.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Salahi, M. Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem. Optim Lett 11, 1691–1697 (2017). https://doi.org/10.1007/s11590-016-1080-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-016-1080-y