Abstract
We establish a generalized alternative theorem for nonquadratic nonconvex system by unifying S-lemma and convex Farkas lemma. As an application, we reveal hidden convexity of a new family of nonconvex optimization problems that combine generalized trust region subproblem with convex optimization.
Similar content being viewed by others
References
Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization: analysis, algorithms, and engineering applications, MSP/SIAM Ser. Optim. 2, SIAM, Philadelphia, (2001)
Calabi, E.: Linear systems of real quadratic forms II. Proc. Am. Math. Soc. 84(3), 331–334 (1982)
Conn, A.R., Gould, N.I.M., Toint, Ph.L.: Trust-Region Methods. SIAM, Philadelphia (2000)
Crouzeix, J.P., Martínez-Legaz, J.E., Seeger, A.: An alternative theorem for quadratic forms and extensions. Linear Algebr. Appl. 215, 121–134 (1995)
Dines, L.L.: On the mapping of quadratic forms. Bull. Am. Math. Soc. 47, 494–498 (1941)
Dinh, N., Jeyakumar, V.: Farkas’ lemma: three decades of generalizations for mathematical optimization. TOP 22, 1–22 (2014)
Derinkuyu, K., Pınar, M.C.: On the S-procedure and some variants. Math. Meth. Oper. Res. 64, 55–77 (2006)
Fan, K., Glicksberg, I., Hoffman, A.J.: Systems of inequalities involving convex functions. Proc. Am. Math. Soc. 8(3), 617–622 (1957)
Fang, S.C., Gao, D., Lin, G.X., Sheu, R.L., Xing, W.: Double well potential function and its optimization in the n-dimensional real space - Part I. J. Ind. Manag. Optim. 13(3), 1291–1305 (2017)
Flores-Bazán, F., Cárcamo, G., Caro, S.: Extensions of the Standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma. Appl. Math. Optim. 81, 383–408 (2020)
Flores-Bazán, F., Echegaray, W., Flores-Bazán, F., Ocaña, E.: Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap. J. Glob. Optim. 69, 823–845 (2017)
Flores-Bazán, F., Opazo, F.: Characterizing the convexity of joint-range for a pair of inhomogeneous quadratic functions and strong duality. Minimax Theory Appl. 1(2), 257–290 (2016)
Flores-Bazán, F., Opazo, F.: Characterizing convexity of images for quadratic-linear mappings with applications in nonconvex quadratic optimization. SIAM J. Optim. 31(3), 1774–1796 (2021)
Farkas, J.: Über die theorie der einfachen ungleichungen. J. für die Reine und Angewandte Mathematik 124, 1–27 (1902)
Finsler, P.: Über das Vorkommen definiter und semidefiniter Formen in Scharen quadratischer Formen. Comment. Math. Helv. 9, 188–192 (1937)
Gould, N.I.M., Robinson, D.P., Thorne, H.S.: On solving trust-region and other regularised subproblems in optimization. Math. Program. Comput. 2, 21–57 (2010)
Hu, S.L., Huang, Z.H.: Theorems of the alternative for inequality systems of real polynomials. J. Optim. Theory Appl. 154(1), 1–16 (2012)
Hu, S., Li, G., Qi, L.Q.: A tensor analogy of Yuan’s theorem of the alternative and polynomial optimization with sign structure. J. Optim. Theory Appl. 168(2), 446–474 (2016)
Jeyakumar, V.: Farkas lemma: generalizations. Encycl. Optim. 2, 87–91 (2000)
Jeyakumar, V., Lee, G.M., Li, G.Y.: Alternative theorems for quadratic inequality systems and global quadratic optimization. SIAM J. Optim. 20(2), 983–1001 (2009)
Jeyakumar, V., Oettli, W., Natividad, M.: A solvability theorem for a class of quasiconvex mappings with applications to optimization. J. Math. Anal. Appl. 179, 537–546 (1993)
Jiang, R., Li, D., Wu, B.: SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices. Math. Program. 169(2), 531–563 (2018)
Jönsson, U.T.: A Lecture on the S-procedure, Lecture Notes, Division of Optimization and Systems Theory. Royal Institute of Technology, Stockholm, Sweden (2001)
Klerk, E.D., Roos, C., Terlaky, T.: Nonlinear optimization(CO 367). (2004)
Lur’e, A.I., Postnikov, V.N.: On the theory of stability of control systems. Prikl. Mat. i Mekh. 8, 3–13 (1944)
Luo, Z.Q., Sturm, J.F., Zhang, S.: Multivariate nonnegative quadratic mappings. SIAM J. Optim. 14, 1140–1162 (2004)
Martínez-Legaz, J.E., Seeger, A.: Yuan’s alternative theorem and the maximization of the minimum eigenvalue function. J. Optim. Theory Appl. 82(1), 159–167 (1994)
Moré, J.J.: Generalization of the trust region problem. Optim. Methods Softw. 2(3), 189–209 (1993)
Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton method and its global performance. Math. Program. 108, 177–205 (2006)
Nesterov, Y.: Introductory Lectures on Convex Optimizaiton: a Basic Course of Applied Optimization, vol. 87. Kluwer, Boston (2004)
Polyak, B.T.: Convexity of quadratic transformations and its use in control and optimization. J. Optim. Theory Appl. 99(3), 553–583 (1998)
Pólik, I., Terlaky, T.: A survey of the S-lemma. SIAM Rev. 49(3), 371–418 (2007)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton, N. J. (1970)
Stoer, J., Witzgall, C.: Convexity and Optimization in Finite Dimensions, vol. I. Springer-Berlag, Heidelberg (1970)
Song, M.M., Xia, Y., Liu, H.Y.: Local optimality conditions for a class of hidden convex optimization. (2021) arXiv:2109.03110
Sturm, J.F., Zhang, S.: On cones of nonnegative quadratic functions. Math. Oper. Res. 28, 246–267 (2003)
Wang, A.L., Kılınç-Karzan, F.: The generalized trust region subproblem: solution complexity and convex hull results. Math. Program. (2020). https://doi.org/10.1007/s10107-020-01560-8
Wang, S., Xia, Y.: Strong duality for generalized trust region subproblem: S-lemma with interval bounds. Optim. Lett. 9, 1063–1073 (2015)
Xia, Y.: A survey of hidden convex optimization. J. Oper. Res. Soc. China. 8, 1–28 (2020)
Xia, Y., Wang, S., Sheu, R.: S-lemma with equality and its applications. Math. Program. 156, 513–547 (2016)
Yakubovich, V.A.: S-procedure in nonlinear control theory. Vestnik Leningrad. Univ. 1, 62–71 (1971). (in Russian)
Yakubovich, V.A.: S-procedure in nonlinear control theory, Vestnik Leningrad. Univ. 4, 73-93 (1977) (English translation)
Yan, Z., Guo, J.: Some equivalent results with Yakubovich’s S-Lemma. SIAM J. Control Optim. 48, 4474–4480 (2010)
Yuan, Y.X.: On a subproblem of trust region algorithms for constrained optimization. Math. Program. 47, 53–63 (1990)
Acknowledgements
The authors are very grateful for the valuable comments from the associate editor and the two anonymous referees for their valuable comments, which have greatly improved the presentation of the paper. This research was supported by Beijing Natural Science Foundation Z180005, by National Natural Science Foundation of China under grants 11822103, 12101041, 12171021, by China Postdoctoral Science Foundation 2020M670490, 2020M680335, by the Fundamental Research Funds for the Central Universities FRF-TP-20-070A1.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Marco Antonio López-Cerdá
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Yang, M., Wang, S. & Xia, Y. Toward Nonquadratic S-Lemma: New Theory and Application in Nonconvex Optimization. J Optim Theory Appl 194, 353–363 (2022). https://doi.org/10.1007/s10957-022-02031-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-022-02031-0