Local Optimality Conditions for a Family of Hidden Convex Optimization

References

• Beck A, Pan D (2017) A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints. J. Global Optim. 69(2):309–342.Google Scholar
• Ben-Tal A, den Hertog D (2014) Hidden conic quadratic representation of some nonconvex quadratic optimization problems. Math. Programming 143:1–29.Google Scholar
• Bienstock D, Michalka A (2014) Polynomial solvability of variants of the trust-region subproblem. Chekuri C, ed. Proc. 25th Annual ACM-SIAM Sympos. on Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 380–390.Google Scholar
• Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, UK).Google Scholar
• Bubeck S (2015) Convex optimization: Algorithms and complexity. Foundations Trends Machine Learn. 8(3–4):231–357.Google Scholar
• Burer S, Anstreicher KM (2013) Second-order-cone constraints for extended trust-region subproblems. SIAM J. Optim. 23(1):432–451.Google Scholar
• Burer S, Yang B (2015) The trust region subproblem with non-intersecting linear constraints. Math. Programming 149:253–264.Google Scholar
• Cartis C, Gould NIM, Toint PL (2011) Adaptive cubic regularisation methods for unconstrained optimization. Part I: Motivation, convergence and numerical results. Math. Programming 127(2):245–295.Google Scholar
• Conn AR, Gould NIM, Toint PL (2000) Trust Region Methods (Society for Industrial and Applied Mathematics, Philadelphia).Google Scholar
• Dinkelbach W (1967) On nonlinear fractional programming. Management Sci. 13(7):492–498.Link, Google Scholar
• Fang SC, Gao DY, Lin GX, Sheu RL, Xing WX (2017) Double well potential function and its optimization in the N-dimensional real space—Part I. J. Industry Managment Optim. 13(3):1291–1305.Google Scholar
• Fletcher R (1987) Practical Methods of Optimization, 2nd ed. (John Wiley, New York).Google Scholar
• Gay DM (1981) Computing optimal locally constrained steps. SIAM J. Sci. Statist. Comput. 2(2):186–197.Google Scholar
• Golub GH, Loan CFV (1989) Matrix Computations, 2nd ed. (The Johns Hopkins University Press, Baltimore).Google Scholar
• Gould NIM, Robinson DP, Thorne HS (2010) On solving trust-region and other regularised subproblems in optimization. Math. Programming Comput. 2(1):21–57.Google Scholar
• Griewank A (1981) The modification of Newton’s method for unconstrained optimization by bounding cubic terms. Technical report DAMTP/NA12, Department of Applied Mathematics and Theoretical Physics, Cambridge University, Cambridge, UK.Google Scholar
• Hsia Y, Sheu RL (2013) Trust region subproblem with a fixed number of additional linear inequality constraints has polynomial complexity. Preprint, submitted December 5, https://arxiv.org/abs/1312.1398.Google Scholar
• Hsia Y, Sheu RL, Yuan YX (2017) Theory and application of p−regularized subproblems for p > 2. Optim. Methods Software 32(5):1059–1077.Google Scholar
• Jiang R, Li D, Wu B (2018) SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices. Math. Programming 169:531–563.Google Scholar
• Lucidi S, Palagi L, Roma M (1998) On some properties of quadratic programs with a convex quadratic constraint. SIAM J. Optim. 8(1):105–122.Google Scholar
• Martínez JM (1994) Local minimizers of quadratic functions on Euclidean balls and spheres. SIAM J. Optim. 4(1):159–176.Google Scholar
• Moré JJ, Sorensen DC (1983) Computing a trust region step. SIAM J. Sci. Statist. Comput. 4(3):553–572.Google Scholar
• Murty KG, Kabadi SN (1987) Some NP-complete problems in quadratic and nonlinear programming. Math. Programming 39(2):117–129.Google Scholar
• Nesterov Y (2018) Lectures on Convex Optimization. Springer Optimization and Its Applications (Springer, New York).Google Scholar
• Nesterov Y, Polyak BT (2006) Cubic regularization of Newton method and its global performance. Math. Programming 108(1):177–205.Google Scholar
• Pardalos PM, Schnitger G (1988) Checking local optimality in constrained quadratic programming is NP-hard. Oper. Res. Lett. 7(2):33–45.Google Scholar
• Schubert K (2003) A new look at robust estimation and identification. PhD thesis, University of California, Santa Barbara, CA.Google Scholar
• Sorensen DC (1982) Newton’s method with a model trust region modification. SIAM J. Numerical Anal. 19(2):409–426.Google Scholar
• Sturm JF, Zhang S (2003) On cones of nonnegative quadratic functions. Math. Oper. Res. 28(2):246–267.Link, Google Scholar
• Wang J, Xia Y (2020) Closing the gap between necessary and sufficient conditions for local nonglobal minimizer of trust region subproblem. SIAM J. Optim. 30(3):1980–1995.Google Scholar
• Wang J, Song M, Xia Y (2022) On local nonglobal minimum of trust-region subproblem and extension. J. Optim. Theory Appl. 195(2):707–722.Google Scholar
• Weiser M, Deuflhard P, Erdmann B (2007) Affine conjugate adaptive Newton methods for nonlinear elastomechanics. Optim. Methods Software 22(3):413–431.Google Scholar
• Xia Y (2020) A survey of hidden convex optimization. J. Oper. Res. Soc. China 8(2):1–28.Google Scholar
• Xia Y, Sheu RL, Fang SC, Xing W (2017) Double well potential function and its optimization in the N-dimensional real space: Part II. J. Industry Management Optim. 13(3):1307–1328.Google Scholar
• Yang M, Wang S, Xia Y (2022) Toward nonquadratic S-lemma: New theory and application in nonconvex optimization. J. Optim. Theory Appl. 194(1):353–363.Google Scholar
• Ye Y (1992) A new complexity result on minimization of a quadratic function with a sphere constraint. Recent Advances in Global Optimization (Princeton University Press, Princeton, NJ), 19–31.Google Scholar
• Yuan Y (2015) Recent advances in trust region algorithms. Math. Programming 151(1):249–281.Google Scholar
• Zeng L, Pong TK (2022) ρ-regularization subproblems: Strong duality and an eigensolver-based algorithm. Comput. Optim. Appl. 81:337–368.Google Scholar