On Optimality Conditions for Nonlinear Conic Programming

References

• [1] Andreani R, Haeser G, Martínez JM (2011) On sequential optimality conditions for smooth constrained optimization. Optim. 60(5):627–641.Crossref, Google Scholar
• [2] Andreani R, Haeser G, Viana DS (2020) Optimality conditions and global convergence for nonlinear semidefinite programming. Math. Programming 180(1–2):203–235.Crossref, Google Scholar
• [3] Andreani R, Martínez JM, Svaiter BF (2010) A new sequential optimality condition for constrained optimization and algorithmic consequences. SIAM J. Optim. 20(6):3533–3554.Crossref, Google Scholar
• [4] Andreani R, Birgin EG, Martínez JM, Schuverdt ML (2008) Augmented Lagrangian methods under the constant positive linear dependence constraint qualification. Math. Programming 111(1–2):5–32.Crossref, Google Scholar
• [5] Andreani R, Haeser G, Mito LM, Ramírez H (2020) Weak notions of nondegeneracy in nonlinear semidefinite programming. Technical report. Accessed December 29, 2020, http://www.optimization-online.org/DB_HTML/2020/12/8182.html.Google Scholar
• [6] Andreani R, Haeser G, Ramos A, Silva PJS (2017) A second-order sequential optimality condition associated to the convergence of optimization algorithms. IMA J. Numerical Anal. 37(4):1902–1929.Crossref, Google Scholar
• [7] Andreani R, Haeser G, Schuverdt ML, Silva PJS (2012a) A relaxed constant positive linear dependence constraint qualification and applications. Math. Programming 135(1–2):255–273.Crossref, Google Scholar
• [8] Andreani R, Haeser G, Schuverdt ML, Silva PJS (2012b) Two new weak constraint qualifications and applications. SIAM J. Optim. 22(3):1109–1135.Crossref, Google Scholar
• [9] Andreani R, Haeser G, Secchin LD, Silva PJS (2019b) New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences. SIAM J. Optim. 29(4):3201–3230.Crossref, Google Scholar
• [10] Andreani R, Martínez JM, Ramos A, Silva PJS (2016) A cone-continuity constraint qualification and algorithmic consequences. SIAM J. Optim. 26(1):96–110.Crossref, Google Scholar
• [11] Andreani R, Martínez JM, Ramos A, Silva PJS (2018) Strict constraint qualifications and sequential optimality conditions for constrained optimization. Math. Oper. Res. 43(3):693–717.Link, Google Scholar
• [12] Andreani R, Fukuda EH, Haeser G, Santos DO, Secchin LD (2019) Optimality conditions for nonlinear second-order cone programming and symmetric cone programming. Technical report. Accessed October 17, 2019, http://www.optimization-online.org/DB_HTML/2019/10/7436.html.Google Scholar
• [13] Andreani R, Haeser G, Mito LM, Ramos A, Secchin LD (2020) On the best achieavable quality of limit points of augmented Lagrangian schemes. Numer. Algorithms. http://doi.org.br/10.1007/s11075-021-01212-8.Google Scholar
• [14] Anjos MF, Lassere JB (2012) Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research and Management Science (Springer, New York).Crossref, Google Scholar
• [15] Attouch H, Bolte J, Svaiter BF (2013) Convergence of descent methods for semi-algebraic and tame problems: Proximal algorithms, forward-backward splitting and regularized Gauss-Seidel methods. Math. Programming 137(1–2):91–129.Crossref, Google Scholar
• [16] Attouch H, Bolte J, Redont P, Soubeyran A (2010) Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka-Łojasiewicz inequality. Math. Oper. Res. 35(2):438–457.Link, Google Scholar
• [17] Baes M (2007) Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras. Linear Algebra Appl. 422(2):664–700.Crossref, Google Scholar
• [18] Bertsekas DP (1982) Constrained Optimization and Lagrange Multiplier Methods (Academic Press, New York).Google Scholar
• [19] Bertsekas DP (1999) Nonlinear Programming (Athenas Scientific, Belmont, MA).Google Scholar
• [20] Birgin E, Martínez JM (2014) Practical Augmented Lagrangian Methods for Constrained Optimization (SIAM Publications, Philadelphia).Crossref, Google Scholar
• [21] Birgin EG, Bueno LF, Martínez JM (2015) Assessing the reliability of general-purpose inexact restoration methods. J. Comput. Appl. Math. 282(C):1–16.Crossref, Google Scholar
• [22] Birgin EG, Haeser G, Ramos A (2018a) Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points. Comput. Optim. Appl. 69(1):51–75.Crossref, Google Scholar
• [23] Birgin EG, Krejić N, Martínez JM (2018b) On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors. Math. Comput. 87:1307–1326.Crossref, Google Scholar
• [24] Bolte J, Daniilidis A, Ley O, Mazet L (2010) Characterization of Łojasiewicz inequalities and applications: Subgradient flows, talweg, convexity. Trans. Amer. Math. Soc. 362(6):3319–3363.Crossref, Google Scholar
• [25] Bonnans JF, Shapiro A (2000) Pertubation Analysis of Optimization Problems (Springer-Verlag, Berlin).Crossref, Google Scholar
• [26] Börgens E, Kanzow C, Mehlitz P, Wachsmuth G (2020b) New constraint qualifications for optimization problems in Banach spaces based on asymptotic KKT conditions. SIAM J. Optim. 30(4):2956–2982.Crossref, Google Scholar
• [27] Bueno LF, Haeser G, Martínez JM (2015) A flexible inexact restoration method for constrained optimization. J. Optim. Theory Appl. 165(1):188–208.Crossref, Google Scholar
• [28] Bueno LF, Haeser G, Rojas FN (2019) Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications. SIAM J. Optim. 29(1):31–54.Crossref, Google Scholar
• [29] Bueno LF, Haeser G, Lara F, Rojas FN (2020) An augmented Lagrangian method for quasi-equilibrium problems. Comput. Optim. Appl. 76:737–766.Crossref, Google Scholar
• [30] Chen L, Goldfarb D (2006) Interior-point 2-penalty methods for nonlinear programming with strong global convergence properties. Math. Programming 108:1–36.Crossref, Google Scholar
• [31] Chill R, Mildner S (2018) The Kurdyka-Łojasiewicz-Simon inequality and stabilisation in nonsmooth infinite-dimensional gradient systems. Proc. Amer. Math. Soc. 146:4307–4314.Crossref, Google Scholar
• [32] Fares B, Apkarian P, Noll D (2001) An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory. Internat. J. Control 74(4):348–360.Crossref, Google Scholar
• [33] Fischer A, Friedlander A (2010) A new line search inexact restoration approach for nonlinear programming. Comput. Optim. Appl. 46(2):333–346.Crossref, Google Scholar
• [34] Fitzpatrick S, Phelps RR (1982) Differentiability of the metric projection in Hilbert space. Trans. Amer. Math. Soc. 270(2):483–501.Crossref, Google Scholar
• [35] Fukuda EH, Haeser G, Mito LM (2020) On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming. Technical report. Accessed August 4, 2020, http://www.optimization-online.org/DB_HTML/2020/08/7951.html.Google Scholar
• [36] Fukushima M, Luo ZQ, Tseng P (2006) Smoothing functions for second-order-cone complementarity problems. SIAM J. Optim. 12(2):436–460.Crossref, Google Scholar
• [37] Gill PE, Kungurtsev V, Robinson DP (2017) A stabilized SQP method: Global convergence. IMA J. Numerical Anal. 37(1):407–443.Crossref, Google Scholar
• [38] Gill PE, Kungurtsev V, Robinson DP (2020) A shifted primal-dual penalty-barrier method for nonlinear optimization. SIAM J. Optim. 30(2):1067–1093.Crossref, Google Scholar
• [39] Giorgi G, Jiménez B, Novo V (2016) Approximate Karush-Kuhn-Tucker condition in multiobjective optimization. J. Optim. Theory Appl. 171(1):70–89.Crossref, Google Scholar
• [40] Haeser G (2018) A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms. Comput. Optim. Appl. 70(2):615–639.Crossref, Google Scholar
• [41] Haeser G, Ramos A (2020) New constraint qualifications with second-order properties in nonlinear optimization. J. Optim. Theory Appl. 182(2):494–506.Crossref, Google Scholar
• [42] Haeser G, Hinder O, Ye Y (2021) On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods. Math. Programming 186:257–288.Crossref, Google Scholar
• [43] Haeser G, Liu H, Ye Y (2019) Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. Math. Programming 178(1):263–299.Crossref, Google Scholar
• [44] Hager WW, Gowda MS (1999) Stability in the presence of degeneracy and error estimation. Math. Programming 85(1):181–192.Crossref, Google Scholar
• [45] Hager WW, Mico-Umutesi D (2014) Error estimation in nonlinear optimization. J. Global Optim. 59(2–3):327–341.Crossref, Google Scholar
• [46] Hestenes MR (1969) Multiplier and gradient methods. J. Optim. Theory Appl. 4:303–320.Crossref, Google Scholar
• [47] Hiriart-Urruty JB, Lemaréchal C (2001) Fundamentals of Convex Analysis (Springer-Verlag, Berlin).Crossref, Google Scholar
• [48] Kanzow C, Steck D (2017) An example comparing the standard and safeguarded augmented Lagrangian methods. Oper. Res. Lett. 45(6):598–603.Crossref, Google Scholar
• [49] Kanzow C, Steck D, Wachsmuth D (2018) An augmented Lagrangian method for optimization problems in Banach spaces. SIAM J. Control Optim. 56(1):272–291.Crossref, Google Scholar
• [50] Kocvara M, Stingl M (2004) Solving nonconvex SDP problems of structural optimization with stability control. Optim. Methods Software 19(5):595–609.Crossref, Google Scholar
• [51] Krislock N, Wolkowicz H (2012) Euclidean distance matrices and applications. Anjos MF, Lasserre JB, eds. Handbook on Semidefinite, Conic and Polynomial Optimization. International Series in Operations Research and Management Science, vol. 166 (Springer, Boston), 879–914. 10.1007/978-1-4614-0769-0_30.Google Scholar
• [52] Kurdyka K (1998) On gradients of functions definable in o-minimal structures. Ann. Inst. Fourier (Grenoble) 48(3):769–783.Crossref, Google Scholar
• [53] Li G, Pong TK (2018) Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its appplications to linear convergence of first-order methods. Foundations Comput. Math. 18(5):1199–1232.Crossref, Google Scholar
• [54] Lobo MS, Vandenberghe L, Boyd S, Lebret H (1998) Applications of second-order cone programming. Linear Algebra Appl. 284(1–3):193–228.Crossref, Google Scholar
• [55] Łojasiewicz S (1984) Sur les trajectories du gradient d’une fonction analytique. in Seminari di Geometria 1982-1983, Universita di Bologna, Istituto di Geometria, Dipartamento di Matematica, 115–117.Google Scholar
• [56] Mangasarian OL, Fromovitz S (1967) The Fritz John necessary optimality conditions in the presence of equality and inequality constraints. J. Math. Anal. Appl. 17(1):37–47.Crossref, Google Scholar
• [57] Marcus M (1956) An eigenvalue inequality for the product of normal matrices. Amer. Math. Monthly 63(3):173–174.Google Scholar
• [58] Martínez JM, Pilotta EA (2000) Inexact restoration algorithms for constrained optimization. J. Optim. Theory Appl. 104:135–163.Crossref, Google Scholar
• [59] Martínez JM, Pilotta EA (2005) Inexact restoration methods for nonlinear programming: advances and perspectives. Qi L, Teo K, Yang X, eds. Optimization and Control with Applications (Springer, Boston), 271–292.Crossref, Google Scholar
• [60] Martínez JM, Svaiter BF (2003) A practical optimality condition without constraint qualifications for nonlinear programming. J. Optim. Theory Appl. 118:117–133.Crossref, Google Scholar
• [61] Nocedal J, Wright S (2006) Numerical Optimization, Springer Series in Operations Research (Springer-Verlag, New York).Google Scholar
• [62] O’Neill M, Wright SJ (2021) A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees. IMA J. Numerical Anal. 41(1):84–121.Crossref, Google Scholar
• [63] Pataki G (2007) On the closedness of the linear image of a closed convex cone. Math. Oper. Res. 32(2):395–412.Link, Google Scholar
• [64] Peng J, Roos C, Terlaky T (2002) Self-Regularity: A New Paradigm for Primal-Dual Interior Point Algorithms, Princeton Series in Applied Mathematics (Princeton University Press, Chichester, UK).Google Scholar
• [65] Powell MJD (1969) A method for nonlinear constraints in minimization problems. Fletcher R, ed. Optimization (Academic Press, New York), 283–298.Google Scholar
• [66] Qi HD, Yuan X (2013) Computing the nearest Euclidean distance matrix with low embedding dimensions. Math. Programming 147(1–2):351–389.Crossref, Google Scholar
• [67] Qi L, Wei Z (2000) On the constant positive linear dependence conditions and its application to SQP methods. SIAM J. Optim. 10(4):963–981.Crossref, Google Scholar
• [68] Ramos A (2019) Two new weak constraint qualifications for mathematical programs with equilibrium constraints and applications. J. Optim. Theory Appl. 183:566–591.Crossref, Google Scholar
• [69] Ramos A (2021) Mathematical programs with equilibrium constraints: A sequential optimality condition, new constraint qualifications and algorithmic consequences. Optim. Methods Software 36(1):45–81.Crossref, Google Scholar
• [70] Robinson SM (1976) Stability theory for systems of inequalities, part II: Differentiable nonlinear systems. SIAM J. Numerical Anal. 13(4):497–513.Crossref, Google Scholar
• [71] Robinson SM (1982) Generalized equations and their solutions, part II: Applications to nonlinear programming. Math. Programming Stud. 19:200–221.Crossref, Google Scholar
• [72] Rockafellar RT (1974) Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM J. Control Optim. 12(2):268–285.Crossref, Google Scholar
• [73] Rockafellar RT, Wets R (2009) Variational Analysis (Springer-Verlag, Berlin).Google Scholar
• [74] Schnabel RB (1982) Determining feasibility of a set of nonlinear inequality constraints. Math. Programming Stud. 16:137–148.Crossref, Google Scholar
• [75] Steck D (2018) Lagrange multiplier methods for constrained optimization and variational problems in Banach spaces. Unpublished PhD thesis, Institute of Mathematics, Universität Würzburg, Germany.Google Scholar
• [76] Tuyen NV, Xiao YB, Son TQ (2019) On AKKT optimality conditions for cone-constrained vector optimization problems. Preprint, submitted February 20. Accessed August 10, 2020, https://arxiv.org/abs/1902.07416.Google Scholar
• [77] Wolkowicz H, Saigal R, Vandenberghe L (2000) Handbook of Semidefinite Programming: Theory, Algorithms, an Applications, International Series in Operations Research and Management Science (Springer, New York).Crossref, Google Scholar
• [78] Yamashita H, Yabe H (2015) A survey of numerical methods for nonlinear semidefinite programming. J. Oper. Res. Soc. Japan 58(1):24–60.Crossref, Google Scholar