Combining search directions using gradient flows

Mathematical Programming

Volumn 96, Issue 3, 2003, Pages 529-559

  Moguerza, Javier M ^a   Prieto, Francisco J ^b  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSIDAD CARLOS III DE MADRID   (Spain)

Author keywords

Interior point methods; Line searches; Negative curvature; Nonconvex optimization; Primal dual methods

Indexed keywords

INTERIOR-POINT METHOD; LINE SEARCHES; NEGATIVE CURVATURE; NONCONVEX OPTIMIZATION; PRIMAL-DUAL METHODS;

APPROXIMATION THEORY;

ALGORITHMS;

EID: 4444274963     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-002-0367-1     Document Type: Article

References (29)

1. Behrman,W.: An efficient gradient flow method for unconstrained optimization. Ph.D. Thesis, Stanford University, June 1998
2. Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods.Academic Press, NewYork, 1982
3. Bongartz, I., Conn, A.R., Gould, N.I.M., Toint, Ph.L.: CUTE: Constrained and Unconstrained Testing Environment. Trans. ACM Math. Software 21, 123-160 (1995)
4. Botsaris, C.A.: A curvilinear optimization method based upon iterative estimation of the eigensystem of the Hessian matrix. J. Math. Anal. Appl. 63, 396-411 (1978)
5. Bunch, J.R., Kaufman, L., Parlett, B.N.: Decomposition of a symmetric matrix. Numer.Math. 27, 95-109 (1976)
6. Byrd, R.H., Schnabel, R.B., Shultz, G.A.: Approximate solution of the trust region problem by minimization over two-dimensional subspaces. Math. Program. 40, 247-263 (1988)
7. Conn, A.R., Gould, N., Toint, Ph.L.:A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds. SIAM J. Numer. Anal. 28, 545-572 (1991)
8. Courant, R.: Variational methods for the solution of problems of equilibrium and vibrations. Bull. Amer. Math. Soc. 49, 1-23 (1943)
9. Del Gatto, A.: A subspace method based on a differential equation approach to solve unconstrained optimization problems. Ph.D. Thesis, Stanford University, June 2000
10. Dennis, J.E., Schnabel, R.B. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice Hall: Englewood Cliffs, 1983
11. El-Bakry, A.S., Tapia, R.A., Tsuchiya, T., Zhang,Y.: On the formulation and theory of the Newton interior- point method for nonlinear programming. J. Optim. Theory Appl. 89, 507-541 (1996) (Pubitemid 126324479)
12. Evtushenko,Y.E., Zhadan, V.G.: Stable barrier-projection and barrier-Newton methods in nonlinear programming. In: Optimization Methods and Software, Vol. 3, pp. 237-256, 1994
13. Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Society for Industrial And Applied Mathematics, Philadelphia, 1990 (Originally published by Research Analysis Corporation, McLean, Virginia)
14. Fletcher, R.: Practical Methods of Optimization. JohnWiley, Chichester, 1991
15. Forsgren, A., Murray, W.: Newton methods for large-scale linear equality-constrained minimization. SIAM J. Matrix Anal. Appl. 14, 560-587 (1993)
16. Gay, D.M., Overton, M.L., Wright, M.H.: A primal-dual interior method for nonconvex nonlinear programming. In: Y. Yuan (ed.), Advances in Nonlinear Programming, pp. 31-56. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998
17. Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H.: User's Guide for NPSOL (version 4.0): A FORTRAN Package for Nonlinear Programming. Technical Report SOL 86-2. Stanford University, 1986
18. Gill, P.E., Murray,W., Wright, M.H.: Practical Optimization. Academic Press, London/NewYork, 1981
19. Gould, N.I.M., Orban, D., Sartenaer, A., Toint, Ph.L.: Superlinear convergence of primal-dual interior point algorithms for nonlinear programming. SIAM J. Optim. 11(4), 974-1002 (2001)
20. Hock,W., Schittkowski, K.: Test Examples for Nonlinear Programming Codes. Springer Verlag. Berlin, 1981
21. Moguerza, J.M.: Interior point methods for nonconvex optimization. Ph.D. Thesis, Department of Statistics and Econometrics, Universidad Carlos III de Madrid. May, 2000 (in Spanish)
22. Moguerza, J.M., Prieto, F.J.:An augmented Lagrangian interior-point method using directions of negative curvature. Working Paper 00-36. Department of Statistics and Econometrics, Universidad Carlos III de Madrid, 2000
23. Moré, J.J., Sorensen, D.C.: On the use of directions of negative curvature in a modified Newton method. Math. Program. 16, 1-20 (1979)
24. Schropp, J.: Using dynamical systems to solve minimization problems. Appl. Numer.Math. 18, 321-335 (1995)
25. Vanderbei, R.J., Shanno, D.F.: An interior-point algorithm for nonconvex nonlinear programming. Comput. Optim. Appl. 13, 231-252 (1999) (Pubitemid 129574944)
26. Wright, M.H.: Interior methods for constrained optimization. In: A. Iserles (ed.), Acta Numerica 1992, Cambridge University Press, N.Y., pp. 341-402, 1992
27. Wright, M.H.: Ill-conditioning and computational error in primal-dual methods for nonlinear programming. SIAM J. Optim. 9, 84-111 (1998)
28. Yamashita, H.: A globally convergent primal-dual interior point method for constrained optimization. Optim. Meth. Software 10, 443-469 (1998)
29. Zang, I.: A new arc algorithm for unconstrained optimization. Math. Program. 15, 36-52 (1978)