Two new weak constraint qualifications and applications

SIAM Journal on Optimization

Volumn 22, Issue 3, 2012, Pages 1109-1135

  Andreani, Roberto ^a   Haeser, Gabriel ^b   Schuverdt, María Laura ^c   Silva, Paulo J S ^d  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b FEDERAL UNIVERSITY OF SÃO PAULO   (Brazil)

^c UNIVERSIDAD NACIONAL DE LA PLATA   (Argentina)

^d UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Algorithmic convergence; Constraint qualifications; Error bound

Indexed keywords

ACTIVE CONSTRAINTS; ALGORITHMIC CONVERGENCE; AUGMENTED LAGRANGIANS; CONSTANT RANK; CONSTRAINT QUALIFICATION; CONVERGENCE RESULTS; ERROR BOUND; GLOBAL CONVERGENCE; INEXACT RESTORATION; INTERIOR POINT ALGORITHM; LINEAR DEPENDENCE; LOCAL STABILITY; NONLINEAR OPTIMIZATION METHODS; SEQUENTIAL QUADRATIC PROGRAMMING;

COMPUTER SCIENCE; SOFTWARE ENGINEERING;

ALGORITHMS;

EID: 84867303760     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/110843939     Document Type: Article

References (41)

1. J. Abadie, On the Kuhn-Tucker theorem, in Nonlinear Programming, John Wiley, New York, 1967, pp. 21-36.
2. R. Andreani, E. G. Birgin, J. M. Martínez, and M. L. Schuverdt, On augmented Lagrangian methods with general lower-level constraints, SIAM J. Optim., 18 (2007), pp. 1286-1309.
3. R. Andreani, E. G. Birgin, J. M. Martínez, and M. L. Schuverdt, Augmented Lagrangian methods under the constant positive linear dependence constraint qualification, Math. Program., 111 (2008), pp. 5-32.
4. R. Andreani, G. Haeser, and J. M. Martínez, On sequential optimality conditions for smooth constrained optimization, Optimization, 60 (2011), pp. 627-641.
5. R. Andreani, G. Haeser, M. L. Schuverdt, and P. J. S. Silva, A relaxed constant positive linear dependence constraint qualification and applications, Math. Program., to appear.
6. R. Andreani, J. M. Martínez, and M. L. Schuverdt, On the relation between constant positive linear dependence condition and quasinormality constraint qualification, J.Optim. Theory Appl., 125 (2005), pp. 473-483.
7. M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms, 3rd ed., John Wiley, Hoboken, NJ, 2006.
8. D. P. Bertsekas, Nonlinear Programming, 2nd ed., Athena Scientific, Belmont, MA, 1999.
9. D. P. Bertsekas, Convex Analysis and Optimization, Athena Scientific, Belmont, MA, 2003.
10. 2-penalty methods for nonlinear programming with strong global convergence properties, Math. Program., 108 (2006), pp. 1-26.
11. A. Fischer and A. Friedlander, A new line search inexact restoration approach for nonlinear programming, Comput. Optim. Appl., 46 (2010), pp. 333-346.
12. A. Forsgren, P. E. Gill, and M. H. Wright, Interior methods for nonlinear optimization, SIAM Rev., 44 (2002), pp. 525-597.
13. F. J. Gould and J. W. Tolle, A necessary and sufficient qualification for constrained optimization, SIAM J. Appl. Math., 20 (1971), pp. 164-172.
14. C. Grossmann, D. Klatte, and B. Kummer, Convergence of primal-dual solutions for the nonconvex log-barrier method without LICQ, Kybernetika, 20 (2004), pp. 571-584.
15. M. Guignard, Generalized Kuhn-Tucker conditions for mathematical programming problems in a Banach space, SIAM J. Control, 7 (1969), pp. 232-241.
16. G. Haeser, On the global convergence of interior-point nonlinear programming algorithms, Comput. Appl. Math., 29 (2010), pp. 125-138.
17. G. Haeser and M. L. Schuverdt, On approximate KKT condition and its extension to continuous variational inequalities, J. Optim. Theory Appl., 149 (2011), pp. 125-138.
18. T. Hoheisel and C. Kanzow, First- and second-order optimality conditions for mathematical programs with vanishing constraints, Appl. Math., 52 (2007), pp. 495-514.
19. T. Hoheisel, C. Kanzow, and A. Schwartz, Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints, Math. Program., to appear.
20. T. Hoheisel, C. Kanzow, and A. Schwartz, Mathematical programs with vanishing constraints: A new regularization approach with strong convergence properties, Optimization, 61 (2012), pp. 619-636.
21. A. F. Izmailov and M. V. Solodov, Mathematical programs with vanishing constraints: Optimality conditions, sensitivity and a relaxation method, J. Optim. Theory Appl., 142 (2009), pp. 501-532.
22. R. Janin, Directional derivative of the marginal function in nonlinear programming, in Math. Program. Stud. 21, North-Holland, Amsterdam, The Netherlands, 1984, pp. 110-126.
23. S. Lu, Implications of the constant rank constraint qualification, Math. Program., 126 (2009), pp. 365-392.
24. S. Lu, Relation between the constant rank and the relaxed constant rank constraint qualifications, Optimization, 61 (2012), pp. 555-566.
25. P. Malliavin, Géométrie différentielle intrinsèque, Hermann, Paris, 1972.
26. O. L. Mangasarian, Nonlinear Programming, Classics Appl. Math. 10, SIAM, Philadelphia, 1994.
27. O. L. Mangasarian and S. Fromovitz, The Fritz John necessary optimality conditions in the presence of equality and inequality constraints, J. Math. Anal. Appl., 17 (1967), pp. 37-47.
28. J. M. Martínez, Inexact restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming, J. Optim. Theory Appl., 111 (2001), pp. 39-58.
29. J. M. Martínez and E. A. Pilotta, Inexact restoration algorithms for constrained optimization, J. Optim. Theory Appl., 104 (2000), pp. 135-163.
30. J. M. Martínez and E. A. Pilotta, Inexact restoration methods for nonlinear programming: Advances and perspectives, in Optimization and Control with Applications, L. Q. Qi, K. L. Teo, and X. Q. Yang, eds., Springer, New York, 2005, pp. 271-292.
31. J. M. Martínez and B. F. Svaiter, A practical optimality condition without constraint qualifications for nonlinear programming, J. Optim. Theory Appl., 118 (2003), pp. 117-133.
32. L. Minchenko and S. Stakhovski, On relaxed constant rank regularity condition in mathematical programming, Optimization, 60 (2011), pp. 429-440.
33. L. Minchenko and S. Stakhovski, Parametric nonlinear programming problems under the relaxed constant rank condition, SIAM J. Optim., 21 (2011), pp. 314-332.
34. L. Minchenko and A. Tarakanov, On error bounds for quasinormal programs, J. Optim. Theory Appl., 148 (2011), pp. 571-579.
35. J. Nocedal and S. J. Wright, Numerical Optimization, 2nd ed., Springer, New York, 2006.
36. J.-S. Pang, Error bounds in mathematical programming, Math. Program., 79 (1997), pp. 299-332.
37. E. R. Panier and A. L. Tits, On combining feasibility, descent and superlinear convergence in inequality constrained optimization, Math. Program., 59 (1993), pp. 261-276.
38. L. Qi and Z. Wei, On the constant positive linear dependence condition and its application to SQP methods, SIAM J. Optim., 10 (2000), pp. 963-981.
39. J. R. Reay, Unique minimal representations with positive bases, Amer. Math. Monthly, 73 (1966), pp. 253-261.
40. R. T. Rockafellar, Lagrange multipliers and optimality, SIAM Rev., 35 (1993), pp. 183-238.
41. M. V. Solodov, Constraint qualifications, in Wiley Encyclopedia of Operations Research and Management Science, John Wiley, Hoboken, NJ, 2011.