Steering exact penalty methods for nonlinear programming

Optimization Methods and Software

Volumn 23, Issue 2, 2008, Pages 197-213

  Byrd, Richard H ^a   Nocedal, Jorge ^b   Waltz, Richard A ^b  

^a University of Colorado at Boulder   (United States)

^b Northwestern University   (United States)

Author keywords

Constrained optimization; Nonlinear optimization; Penalty methods

Indexed keywords

CONSTRAINED OPTIMIZATION; CONVERGENCE OF NUMERICAL METHODS; LINEAR PROGRAMMING; PARAMETER ESTIMATION; PROBLEM SOLVING;

NONLINEAR OPTIMIZATION; PENALTY METHODS; SEQUENTIAL QUADRATIC PROGRAMMING;

NONLINEAR PROGRAMMING;

EID: 40249113320     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780701394169     Document Type: Article

References (43)

1. Anitescu. M., 2000, On solving mathematical programs with complementarity constraints as nonlinear programs. Preprint ANL/MCS-P864-1200, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne. IL. USA.
2. Anitescu. M., 2005, Global convergence of an elastic mode approach for a class of mathematical programs with complementarity constraints. SIAM Journal on Optimization, 16(1), 120-145.
3. 2 penalty methods for nonlinear programming with strong global convergence properties. Mathematical Programming, 108(1), 1-36.
4. Gould. N.I.M., Orban, D. and Toint, PH., 2003, An interior-point L1-penalty method for nonlinear optimization. Technical Report RAL-TR-2003-022, Rutherford Appleton Laboratory Chilton, Oxfordshire, UK.
5. Hu, X.M. and Ralph, D., 2004, Convergence of a penalty method for mathematical programming with complementarity constraints. Journal of Optimization Theory and Applications, 123(2), 365-390.
6. Mongeau, M. and Sartenaer, A., 1995, Automatic decrease of the penalty parameter in exact penalty function methods. European Journal of Operational Research, 83(3), 686-699.
7. Scheel, H. and Scholtes, S., 2000, Mathematical programs with complementarity constraints: Stationarity, optimality and sensitivity. Mathematics of Operations Research, 25(1), 1-22.
8. Benson. H.Y., Sen, A., Shanno, D.F. and Vanderbei. R.J., 2003, Interior-point algorithms, penalty methods and equilibrium problems. Report ORFE-03-02, Department of Operations Research and Financial Engineering. Princeton University. Princeton. NJ, USA.
9. Leyffer, S., López-Calva. G. and Nocedal, J., 2006, Interior methods for mathematical programs with complementarity constraints. SIAM Journal on Optimization, 17(1), 52-77.
10. Byrd, R.H., Gould, N.I.M., Nocedal, J. and Waltz, R.A., 2004. An algorithm for nonlinear optimization using linear programming and equality constrained subproblems. Mathematical Programming, Series B. 100(1), 27-48.
11. Gill, P.E., Murray, W. and Saunders, M.A., 2002, SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM Journal on Optimization, 12, 979-1006.
12. Byrd, R.H., Gould, N.I.M., Nocedal, J. and Waltz, R.A., 2006, On the convergence of successive linear-quadratic programming algorithms. SIAM Journal on Optimization. 16(2). 471-489.
13. Zangwill, W.I., 1967, Non-linaer programming via penalty functions. Management Science, 13, 344-358.
14. Pietrzykowski, T., 1969, An exact potential method for constrained maxima. SIAM Journal on Numerical Analysis, 6(2), 299-304.
15. Conn, A.R., 1973, Constrained optimization via a nondifferentiable penalty function. SIAM Journal on Numerical Analysis, 10(4), 760-779.
16. Conn, A.R. and Pietrzykowski, T., 1977, A penalty function method converging directly to a constrained optimum. SIAM Journal on Numerical Analysis. 14(2), 348-375.
17. Hiriart-Urruty, J.-B. and Lemaréchal, C., 1993, Convex Analysis and Minimization Algorithms. Part I: Fundamentals (Heidelberg. Berlin. New York: Springer Verlag).
18. Fletcher, R., 1987, Practical Methods of Optimization (Chichester, England: John Wiley and Sons).
19. Han, S.P. and Mangasarian. O.L., 1979, Exact penalty functions in nonlinear programming. Mathematical Programming, 17(3), 251-269.
20. 1 penalty method for nonlinear constraints. In: P.T. Boggs, R.H. Byrd, and R.B. Schnabel (Eds) Numerical Optimization 1984, 26-40 (Philadelphia, USA: SIAM).
21. Fletcher, R. and Leyffer, S., 2002, Nonlinear programming without a penalty function. Mathematical Programming. 91, 239-269.
22. Byrd. R.H., Hribar, M.E. and Nocedal, J., 1999, An interior point algorithm for large scale nonlinear programming. SIAM Journal on Optimization. 9(4), 877-900.
23. Dennis, J.E., El-Alem, M. and Maciel, M.C., 1997, A global convergence theory for general trust-region based algorithms for equality constrained optimization. SIAM Journal on Optimization, 7(1), 177-207.
24. El-Alem, M., 1991, A global convergence theory for the Dennis-Celis-Tapia trust-region algorithm for constrained optimization. SIAM Journal on Numerical Analysis, 28(1), 266-290.
25. Lalee, M., Nocedal. J. and Plantenga, T.D., 1998, On the implementation of an algorithm for large-scale equality constrained optimization. SIAM Journal on Optimization, 8(3), 682-706.
26. Omojokun, E.O., 1989, Trust region algorithms for optimization with nonlinear equality and inequality constraints. PhD thesis, University of Colorado. Boulder, Colorado, USA.
27. Yuan, Y., 1995. On the convergence of a new trust region algorithm. Numerische Mathematik, 70(4), 515-539.
28. Chin, C.M. and Fletcher. R., 2003, On the global convergence of an SLP-filter algorithm that takes EQP steps. Mathematical Programming, Series A, 96(1), 161-177.
29. Fletcher, R. and Sainz de la Maza, E., 1989, Nonlinear programming and nonsmooth optimization by successive linear programming. Mathematical Programming, 43(3), 235-256.
30. Waltz, R.A., 2004, KNITRO 4.0 User's Manual. Technical report, Ziena Optimization. Inc., Evanston, IL, USA.
31. Fletcher, R., 1996, Presentation. SIAM Conference on Optimization, Victoria, Canada.
32. Gay, D.M., 1985, Electronic mail distribution of linear programming test problems. COAL Newsletter, 13(10), 10-12.
33. Byrd. R.H., 1987, Robust trust region methods for constrained optimization. Third SIAM Conference on Optimization, Houston, Texas.
34. Powell. M.J.D. and Yuan, Y. 1990, A trust region algorithm for equality constrained optimization. Mathematical Programming, 49(2), 189-213.
35. Celis. M.R., Dennis, J.E. and Tapia, R.A., 1985. A trust region strategy for nonlinear equality constrained optimization. In: P.T. Boggs, R.H. Byrd, and R.B. Schnabel (Eds) Numerical Optimization 1984 (Philadelphia, USA: SIAM).
36. Burke. J.V., 1992, A robust trust region method for constrained nonlinear programming problems. SIAM Journal on Optimization, 2(2), 324-347.
37. Wächter, A., 2002, An interior point algorithm for large-scale nonlinear optimization with applications in process engineering. PhD thesis. Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA.
38. Drud, A., 1985, CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems. Mathematical Programming, 31, 153-191.
39. Murtagh. B.A. and Saunders, M.A., 1983, MINOS 5.4 user's guide. Technical report, SOL 83-20R, Systems Optimization Laboratory, Stanford University (Revised 1995).
40. Wächter, A. and Biegler. L.T., 2006, On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Mathematical Programming. 106(1), 25-57.
41. Waltz, R.A., Morales, J.L., Nocedal, J. and Orban, D., 2006, An interior algorithm for nonlinear optimization that combines line search and trust region steps. Mathematical Programming, Series A, 107, 391-408.
42. El-Hallabi. M., 1999, A hybrid algorithm for nonlinear equality constrained optimization problems: global and local convergence theory. Technical Report TR4-99, Mathematics and Computer Science Department, Institut National des Postes et Télécommunications, Rabat. Morocco.
43. Nocedal. J. and Wright. S.J., 1999, Numerical Optimization. Springer Series in Operations Research (Springer).