Active set identification in nonlinear programming

SIAM Journal on Optimization

Volumn 17, Issue 2, 2006, Pages 577-605

  Oberlin, Christina ^a   Wright, Stephen J ^a  

^a University of Wisconsin   (United States)

Author keywords

Active constraint identification; Degeneracy; Nonlinear programming

Indexed keywords

ACTIVE CONSTRAINT IDENTIFICATION; DEGENERACY; LOCAL CONVERGENCE; NONLINEAR PROGRAMMING ALGORITHMS;

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING; SET THEORY;

NONLINEAR PROGRAMMING;

EID: 34249040506     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/050626776     Document Type: Article

References (25)

1. D. P. BERTSEKAS, Projected Newton methods for optimization problems with simple constraints, SIAM J. Control Optim., 20 (1982), pp. 221-246.
2. J. BURKE, On the identification of active constraints II: The nonconvex case, SIAM J. Numer. Anal., 27 (1990), pp. 1081-1102.
3. J. V. BURKE AND J. J. MORÉ, On the identification of active constraints, SIAM J. Numer. Anal., 25 (1988), pp. 1197-1211.
4. J. V. BURKE AND J. J. MORÉ, Exposing constraints, SIAM J. Optim., 4 (1994), pp. 573-595.
5. R. BYRD, N. I. M. GOULD, J. NOCEDAL, AND R. A. WALTZ, An algorithm for nonlinear optimization using linear programming and equality constrained subproblems, Math. Program., 100 (2004), pp. 27-48.
6. R. H. BYRD, N. I. M. GOULD, J. NOCEDAL, AND R. A. WALTZ, On the convergence of successive linear-quadratic programming algorithms, SIAM J. Optim., 16 (2005), pp. 471-489.
7. R. H. BYRD, M. E. HRIBAR, AND J. NOCEDAL, An interior point algorithm for large-scale nonlinear programming, SIAM J. Optim., 9 (1999), pp. 877-900.
8. A. R. CONN, N. I. M. GOULD, AND P. H. L. TOINT, Trust-Region Methods, MPS/SIAM Ser. Optim. 1, SIAM, Philadelphia, 2000.
9. A. S. EL-BAKRY, R. A. TAPIA, AND Y. ZHANG, A study of indicators for identifying zero variables in interior-point methods, SIAM Rev., 36 (1994), pp. 45-72.
10. F. FACCHINEI, A. FISCHER, AND C. KANZOW, On the accurate identification of active constraints, SIAM J. Optim., 9 (1998), pp. 14-32.
11. R. FLETCHER, Practical Methods of Optimization, 2nd ed., John Wiley and Sons, New York, 1987.
12. R. FLETCHER AND E. SAINZ DE LA MAZA, Nonlinear programming and nonsmooth optimization by successive linear programming, Math. Programming, 43 (1989), pp. 235-256.
13. N. I. M. GOULD, D. ORBAN, AND P. L. TOINT, CUTEr (and SifDec), a Constrained and Unconstrained Testing Environment, Revisited, Technical report TR/PA/01/04, CERFACS, Toulouse, France, 2001.
14. W. W. HAGER AND M. S. GOWDA, Stability in the presence of degeneracy and error estimation, Math. Program., 85 (1999), pp. 181-192.
15. W. HARE AND A. LEWIS, Identifying active constraints via partial smoothness and prox-regularity, J. Convex Anal., 11 (2004), pp. 251-266.
16. M. LESCRENIER, Convergence of trust region algorithms for optimization with bounds when strict complementarity does not hold, SIAM J. Numer. Anal., 28 (1991), pp. 476-495.
17. A. S. LEWIS, Active sets, nonsmoothness, and sensitivity, SIAM J. Optim., 13 (2002), pp. 702-725.
18. R. D. C. MONTEIRO AND S. J. WRIGHT, Local convergence of interior-point algorithms for degenerate monotone LCP, Comput. Optim. Appl., 3 (1994), pp. 131-155.
19. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
20. R. WALTZ, An Active-Set Trust-Region Algorithm for Nonlinear Optimization, Presentation at the 18th International Symposium on Mathematical Programming (ISMP), Copenhagen, Denmark, 2003.
21. S. J. WRIGHT, Identifiable surfaces in constrained optimization, SIAM J. Control Optim., 31 (1993), pp. 1063-1079.
22. S. J. WRIGHT, Modifying SQP for degenerate problems, SIAM J. Optim., 13 (2002), pp. 470-497.
23. S. J. WRIGHT, Constraint identification and algorithm stabilization for degenerate nonlinear programs, Math. Program., 95 (2003), pp. 137-160.
24. N. YAMASHITA, H. DAN, AND M. FUKUSHIMA, On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm, Math. Program., 99 (2004), pp. 377-397.
25. Y. YE, On the finite convergence of interior-point algorithms for linear programming, Math. Programming, 57 (1992), pp. 325-336.