Convergent infeasible interior-point trust-region methods for constrained minimization

SIAM Journal on Optimization

Volumn 13, Issue 2, 2003, Pages 432-469

  Tseng, Paul ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

First and second order stationary points; Interior point method; Log barrier function; Nonlinear program; Semidefinite programming; Trust region strategy

Indexed keywords

EID: 0038811730     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623499357945     Document Type: Review

References (45)

1. I. AKROTIRIANAKIS AND B. RUSTEM, A Globally Convergent Interior Point Algorithm for General Non-linear Programming Problems, Technical report 97/14, Department of Computing, Imperial College of Science, Technology and Medicine, London, United Kingdom, 1997.
2. F. ALIZADEH, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim., 5 (1995), pp. 13-51.
3. A. AUSLENDER, Penalty methods for computing points that satisfy second order necessary points, Math. Programming, 17 (1979), pp. 229-238.
4. S. J. BENSON, Y. YE, AND X. ZHANG, Solving large-scale sparse semidefinite programs for combinatorial optimization, SIAM J. Optim., 10 (2000), pp. 443-461.
5. D. P. BERTSEKAS, Nonlinear Programming, 2nd ed., Athena Scientific, Belmont, MA, 1999.
6. R. H. BYRD, J. C. GILBERT, AND J. NOCEDAL, A trust region method based on interior point techniques for nonlinear programming, Math. Program., 89 (2000), pp. 149-185.
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. R. H. BYRD, G. LIU, AND J. NOCEDAL, On the local behavior of an interior point method for nonlinear programming, in Numerical Analysis 1997, D. P. Griffiths and D. J. Higham, eds., Addison Wesley Longman, Reading, MA, 1998, pp. 37-56.
9. R. H. BYRD, J. NOCEDAL, AND R. A. WALTZ, Feasible interior methods using slacks for nonlinear optimization, Technical report, Optimization Technology Center, Northwestern University, Evanston, IL, 2000.
10. A. M. CERVANTES, A. WÄCHTER, R. TÜTÜNCÜ, AND L. T. BIEGLER, A reduced space interior point strategy for optimization of differential algebraic systems, Comput. Chem. Eng., 24 (2000), pp. 39-51.
11. T. F. COLEMAN AND Y. Li, An interior trust region approach for nonlinear minimization subject to bounds, SIAM J. Optim., 6 (1996), pp. 418-445.
12. A. R. CONN, N. I. M. GOULD, D. ORBAN, AND P. L. TOINT, A primal-dual trust-region algorithm for non-convex nonlinear programming, Math. Program., 87 (2000), pp. 215-249.
13. A. R. CONN, N. I. M. GOULD, AND P. L. TOINT, A primal-dual algorithm for minimizing a non-convex function subject to bound and linear equality constraints, in Nonlinear Optimization and Related Topics, G. Di Pillo and F. Giannessi, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000, pp. 15-49.
14. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, Trust-Region Methods, MPS/SIAM Ser. Optim. MPOI, SIAM, Philadelphia, 2000.
15. J. E. DENNIS, M. HEINKENSCHLOSS, AND L. N. VICENTE, Trust-region interior-point SQP algorithms for a class of nonlinear programming problems, SIAM J. Control Optim., 36 (1998), pp. 1750-1794.
16. G. Di PILLO AND L. GRIPPO, A continuously differentiable exact penalty function for nonlinear programming problems with inequality constraints, SIAM J. Control Optim., 23 (1985), pp. 72-84.
17. A. S. EL-BAKRY, R. A. TAPIA, T. TSUCHIYA, AND Y. ZHANG, On the formulation and theory of the Newton interior-point method for nonlinear programming, J. Optim. Theory Appl., 89 (1996), pp. 507-541.
18. F. FACCHINEI AND S. LUCIDI, Convergence to second order stationary points in inequality constrained optimization, Math. Oper. Res., 23 (1998), pp. 746-766.
19. A. V. FIACCO AND G. P. McCORMICK, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons, New York, 1968; republished as Classics Appl. Math. 4, SIAM, Philadelphia, 1990.
20. R. FLETCHER, Semi-definite matrix constraints in optimization, SIAM J. Control Optim., 23 (1985), pp. 493-513.
21. A. FORSGREN AND W. MURRAY, Newton methods for large-scale linear inequality-constrained minimization, SIAM J. Optim., 7 (1997). pp. 162-176.
22. A. FORSGREN AND P. E. GILL, Primal-dual interior methods for nonconvex nonlinear programming, SIAM J. Optim., 8 (1998), pp. 1132-1152.
23. D. M. GAY, M. L. OVERTON, AND M. H. WRIGHT, A primal-dual interior method for nonconvex nonlinear programming, in Advances in Nonlinear Programming, Appl. Optim. 14, Kluwer Academic Publishers, Dordrecht, The Netherlands. 1998, pp. 31-56.
24. T. GLAD AND E. POLAK, A multiplier method with automatic limitation of penalty growth, Math Programming, 17 (1979), pp. 140-155.
25. N. I. M. GOULD, D. ORBAN, A. SARTENAER, AND PH. L. TOINT, Superlinear convergence of primal-dual interior point algorithms for nonlinear programming, SIAM J. Optim., 11 (2001), pp. 974-1002.
26. N. I. M. GOULD AND PH. L. TOINT, A note on the second-order convergence of optimization algorithms using barrier functions, Math. Program., 85 (1999), pp. 433-438.
27. W. HOCK AND K. SCHITTKOWSKI, Test Examples for Nonlinear Programming Codes, Springer-Verlag, Berlin, Germany, 1981.
28. F. JARRE, A QQP-minimization method for semidefinite and smooth nonconvex programs, Technical report, Institut für Angewandte Mathematik und Statistik, Universität Würzburg, Würzburg, Germany, 1998.
29. L. S. LASDON. J. PLUMMER, AND G. YU, Primal-dual and primal interior point, algorithms for general nonlinear programs, ORSA J. Comput., 7 (1995), pp. 321-332.
30. R. D. C. MONTEIRO AND Y. WANG, Trust region affine scaling algorithms for linearly constrained convex and concave programs, Math. Programming, 80 (1998), pp. 283-313.
31. J. J. MORÉ AND D. C. SORENSEN, Computing a trust region step, SIAM J. Sci. Statist. Comput., 4 (1983), pp. 553-572.
32. H. MUKAI AND E. POLAK, A second-order method for the general nonlinear programming problem, J. Optim. Theory Appl., 26 (1978), pp. 515-532.
33. K. G. MURTY AND S. N. KABADI, Some NP-complete problems in quadratic and nonlinear programming, Math. Programming. 39 (1987), pp. 117-129.
34. Y. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
35. D. ORBAN, private communication, CERFACS, Toulouse, France, 2000.
36. P. TSENG, Merit functions for semi-definite complementarity problems, Math. Programming, 83 (1998), pp. 159-185.
37. T. URBAN. A. L. TITS, AND C. T. LAWRENCE, A primal-dual interior-point method for nonconvex optimization with multiple logarithmic barrier parameters and with strong convergence properties, Report, Electrical Engineering Department, University of Maryland, College Park, MD, 1998.
38. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
39. R. V. VANDERBEI AND D. F. SHANNO, An interior-point algorithm for nonconvex nonlinear programming, Comput. Optim. Appl., 13 (1999), pp. 231-252.
40. A. WÄCHTER AND L. T. BIEGLER, Failure of global convergence for a class of interior point methods for nonlinear programming, Math. Programming, 88 (2000), pp. 565-574.
41. S. J. WRIGHT, Primal-Dual Interior-Point Methods, SIAM, Philadelphia. 1997.
42. H. YAMASHITA, A globally convergent primal-dual interior point method for constrained optimization, Technical report. Mathematical Systems Institute Inc., Shinjuku-ku, Tokyo, Japan, 1995.
43. H. YAMASHITA AND H. YABE, Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization, Math. Programming, 75 (1996), pp. 377-397.
44. 2 barrier penalty function for nonlinear optimization, Technical report, Mathematical Systems Institute Inc., Shinjuku-ku, Tokyo, Japan, 1999.
45. H. YAMASHITA, H. YABE, AND T. TANABE, A globally and superlinearly convergent primaldual interior point trust region method for large scale constrained optimization, Technical report, Mathematical Systems Institute Inc., Shinjuku-ku, Tokyo, Japan, 1997 (revised 1998).