Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization

References

• Abadie J (1967) On the Kuhn-Tucker theorem. Abadie J, ed. Nonlinear Programming (North-Holland, Amsterdam), 19–36.Google Scholar
• Andreani R, Haeser G, Martínez JM (2011) On sequential optimality conditions for smooth constrained optimization. Optimization 60(5):627–641.Crossref, Google Scholar
• Andreani R, Martínez JM, Schuverdt ML (2005) On the relation between constant positive linear dependence condition and quasinormality constraint qualification. J. Optim. Theory Appl. 125(2):473–485.Crossref, Google Scholar
• 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
• Andreani R, Birgin EG, Martínez JM, Schuverdt ML (2007) On augmented lagrangian methods with general lower-level constraints. SIAM J. Optim. 18(4):1286.Crossref, Google Scholar
• Andreani R, Haeser G, Schuverdt ML, Silva PJS (2012) A relaxed constant positive linear dependence constraint qualification and applications. Math. Programming 135(1-2):255–273.Crossref, Google Scholar
• 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
• Andreani R, Haeser G, Schuverdt ML, Silva PJS (2012) Two new weak constraint qualifications and applications. SIAM J. Optim. 22(3):1109–1135.Crossref, Google Scholar
• Aubin JP, Frankowska H (1990) Set-Valued Analysis (Birkhaüser, Boston).Google Scholar
• Bertsekas DP (1999) Nonlinear Programming, 2nd ed. (Athena Scientific, Belmont, MA).Google Scholar
• Bertsekas DP, Ozdaglar A (2002) Pseudonormality and a lagrange multiplier theory for constrained optimization. J. Optim. Theory Appl. 114(2):287–343.Crossref, Google Scholar
• Birgin EG, Martínez JM (2014) Practical Augmented Lagrangian Algorithms for Constrained Optimization, Fundamental of Algorithms (SIAM Publications, Philadelphia).Crossref, Google Scholar
• Birgin EG, Bueno LF, Martínez JM (2015) Assessing the reliability of general purpose inexact restoration methods. J. Comput. Appl. Math. 282:1–1.Crossref, Google Scholar
• Bolte J, Daniilidis A, Lewis AS (2007) The Lojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4):1205–1223.Crossref, Google Scholar
• Borwein JM, Lewis AS (2006) Convex Analysis and Nonlinear Optimization: Theory and Examples, CMS Books in Mathematics (Springer, New York).Crossref, Google Scholar
• Bueno LF, Haeser G, Martínez JM (2014) A flexible inexact-restoration method for constrained optimization. J. Optim. Theory Appl. 165(1):188–208.Crossref, Google Scholar
• Cartis C, Gould NIM, Toint PL (2014) On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Programming A 144(1):93–106.Crossref, Google Scholar
• Cartis C, Gould NIM, Toint PL (2016) Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Programming A. 161(1–2):611–626.Crossref, Google Scholar
• Chen L, Goldfarb D (2006) Interior-point 2-penalty methods for nonlinear programming with strong global convergence properties. Math. Programming 108(1):1–26.Crossref, Google Scholar
• 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
• Gould FJ, Tolle JW (1971) A necessary and sufficient qualification for constrained optimization. SIAM J. Appl. Math. 20(2):164–172.Crossref, Google Scholar
• Guignard M (1969) Generalized Kuhn-Tucker conditions for mathematical programming problems in Banach space. SIAM J. Control 7(2):232–241.Crossref, Google Scholar
• Haeser G, Schuverdt ML (2011) On approximate KKT condition and its extension to continuous variational inequalities. J. Optim. Theory Appl. 149(3):528–539.Crossref, Google Scholar
• Hestenes MR (1975) Optimization Theory: The Finite Dimensional Case (John Wiley & Sons, New York).Google Scholar
• Janin R (1984) Direction derivative of the marginal function in nonlinear programming. Math. Programming Stud. 21:127–138.Google Scholar
• Łojasiewicz S (1984) Sur les trajectories du gradient d’une fonction analytique, in Seminari di Geometria 1982–1983, Università di Bologna, Istituto di Geometria, Dipartamento di Matematica 115–117.Google Scholar
• Mangasarian OL, Fromovitz S (1967) The Fritz-John necessary optimality conditions in presence of equality and inequality constraints. J. Math. Anal. Appl. 17(1):37–47.Crossref, Google Scholar
• Martínez JM (2001) Inexact restoration method with Lagrangian tangent decrease and new merit function for nonlinear programing. J. Optim. Theory Appl. 111(1):39–58.Crossref, Google Scholar
• Martínez JM (2012) Generalized order-value optimization. TOP 20(1):75–98.Crossref, Google Scholar
• Martínez JM, Pilotta EA (2000) Inexact restoration algorithm for constrained optimization. J. Optim. Theory Appl. 104(1):135–163.Crossref, Google Scholar
• Martínez JM, Svaiter BF (2003) A practical optimality condition without constraint qualifications for nonlinear programming. J. Optim. Theory Appl. 118(1):117–133.Crossref, Google Scholar
• Minchenko L, Stakhovski S (2011) On relaxed constant rank regularity condition in mathematical programming. Optimization 60(4):429–440.Crossref, Google Scholar
• Mordukhovich BS (1998) Variational Analysis and Generalized Differentiation, I. Basis Theory (Springer, Berlin).Google Scholar
• Nocedal J, Wright S (2006) Numerical Optimization, 2nd ed. (Springer, New York).Google Scholar
• Qi L, Wei Z (2000) On the constant positive linear dependence condition and its application to SQP methods. SIAM J. Optim. 10(4):963–981.Crossref, Google Scholar
• Rockafellar RT, Wets R (1998) Variational Analysis (Springer, Berlin).Crossref, Google Scholar
• Wächter A, Biegler LT (2006) On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Programming 106(1):25–57.Crossref, Google Scholar