On the realization of the wolfe conditions in reduced quasi-Newton methods for equality constrained optimization

SIAM Journal on Optimization

Volumn 7, Issue 3, 1997, Pages 780-813

  Gilbert, Jean Charles ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

Constrained optimization; Exact penalty function; Global convergence; Piecewise line search; Reduced quasi newton; Successive quadratic programming; Wolfe's conditions

Indexed keywords

EID: 0031285897     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623493259604     Document Type: Article

References (44)

1. P. ARMAND AND J. CH. GILBERT (1995), A Piecewise Line-Search Technique for Maintaining the Positive Definiteness of the Updated Matrices in the SQP method, Rapport de Recherche 2615, INRIA, BP 105, 78153 Le Chesnay, France. Http server: http://www.inria.fr/RRRT/RR-2615.html; ftp server: ftp://ftp.inria.fr/INRIA /publication/RR, file RR-2615.ps.gz (submitted to Comput. Optim. Appl.).
2. L. ARMIJO (1966), Minimization of functions having Lipschitz continuous first partial derivatives, Pacific J. Math., 16, pp. 1-3.
3. W. M. BOOTHBY (1986), An Introduction to Differentiable Manifolds and Riemannian Geometry, 2nd ed., Academic Press, Boston, MA.
4. R. H. BYRD AND J. NOCEDAL (1991), An analysis of reduced Hessian methods for constrained optimization, Math. Programming, 49, pp. 285-323.
5. R. H. BYRD, R. A. TAPIA, AND Y. ZHANG (1992), An SQP augmented Lagrangian BFGS algorithm for constrained optimization, SIAM J. Optim., 2, pp. 210-241.
6. T. F. COLEMAN AND A. R. CONN (1982), Nonlinear programming via an exact penalty function: Asymptotic analysis, Math. Programming, 24, pp. 123-136.
7. T. F. COLEMAN AND A. R. CONN (1984), On the local convergence of a quasi-Newton method for the nonlinear programming problem, SIAM J. Numer. Anal., 21, pp. 755-769.
8. T. F. COLEMAN AND P. A. FENYES (1992), Partitioned quasi-Newton methods for nonlinear constrained optimization, Math. Programming, 53, pp. 17-44.
9. L. CONLON (1993), Differentiable Manifolds - A First Course, Birkhäuser Boston, Cambridge, MA.
10. B. N. PSHENICHNYI AND YU. M. DANILIN (1978), Numerical Methods for Extremal Problems, MIR, Moscow.
11. J. E. DENNIS AND R. B. SCHNABEL (1983), Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ.
12. P. FENYES (1987), Partitioned Quasi-Newton Methods for Nonlinear Equality Constrained Optimization, Ph.D. thesis, Department of Computer Science, Cornell University, Ithaca, NY.
13. R. FLETCHER (1980), Practical Methods of Optimization. Volume 1 : Unconstrained Optimization, John Wiley & Sons, Chichester, UK.
14. D. GABAY (1982), Minimizing a differentiable function over a differential manifold, J. Optim. Theory Appl., 37, pp. 177-219.
15. D. GABAY (1982), Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization, Math. Programming Study, 16, pp. 18-44.
16. J. CH. GILBERT (1988), Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité, Modélisation Math. Anal. Numér., 22, pp. 251-288.
17. J. CH. GILBERT (1991), Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization, Math. Programming, 50, pp. 1-28.
18. J. CH. GILBERT (1993), Superlinear Convergence of a Reduced BFGS Method with Piecewise Line-Search and Update Criterion, Rapport de Recherche 2140, INRIA, BP 105, 78153 Le Chesnay, France. Http server: http://www.inria.fr/RRRT/RR-2140.html; ftp server: ftp: //ftp.inria.fr/INRIA/publication/RR, file RR-2140.ps.gz.
19. J. CH. GILBERT (1997), Piecewise line-search techniques for constrained minimization by quasi-Newton algorithms, in Advances in Nonlinear Programming, Proc. International Conference on Nonlinear Programming, Beijing, China, Kluwer Academic Publishers, Norwell, MA.
20. J. CH. GILBERT AND C. LEMARÉCHAL (1989), Some numerical experiments with variable-storage quasi-Newton algorithms, Math. Programming, 45, pp. 407-435.
21. P. E. GILL, W. MURRAY, AND M. H. WRIGHT (1981), Practical Optimization, Academic Press, New York.
22. S.-P. HAN (1976), Superlinearly convergent variable metric algorithms for general nonlinear programming problems, Math. Programming, 11, pp. 263-282.
23. S.-P. HAN AND O. L. MANGASARIAN (1979), Exact penalty functions in nonlinear programming, Math. Programming, 17, pp. 251-269.
24. J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL (1993), Convex Analysis and Minimization Algorithms, Springer-Verlag, Berlin, New York.
25. C. LEMARÉCHAL (1981), A view of line-searches, in Optimization and Optimal Control, A. Auslender, W. Oettli, and J. Stoer, eds., Lecture Notes in Control and Information Science 30, Springer-Verlag, Heidelberg, pp. 59-78.
26. D. C. LIU AND J. NOCEDAL (1989), On the limited memory BFGS method for large scale optimization, Math. Programming, 45, pp. 503-520.
27. D. Q. MAYNE AND E. POLAK (1982), A superlinearly convergent algorithm for constrained optimization problems, Math. Programming Study, 16, pp. 45-61.
28. J. J. MORÉ AND D. C. SORENSEN (1984), Newton's method, in Studies in Numerical Analysis, G. H. Golub, ed., The Mathematical Association of America, pp. 29-82.
29. J. J. MORÉ AND D. J. THUENTE (1992), Line Search Algorithms with Guaranteed Sufficient Decrease, Preprint MCS-P330-1092, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Ill.
30. W. MURRAY AND M. H. WRIGHT (1978), Projected Lagrangian Methods Based on the Trajectories of Penalty and Barrier Functions, Technical report SOL-78-23, Department of Operations Research, Stanford University, Stanford, CA.
31. J. NOCEDAL AND M. L. OVERTON (1985), Projected Hessian updating algorithms for nonlinearly constrained optimization, SIAM J. Numer, Anal., 22, pp. 821-850.
32. M. J. D. POWELL (1976), Some global convergence properties of a variable metric algorithm for minimization without exact line searches, Nonlinear Programming, SIAM-AMS Proceedings, R. W. Cottle and C. E. Lemke, eds., American Mathematical Society, Providence, RI.
33. M. J. D. POWELL (1978), Algorithms for nonlinear constraints that use Lagrangian functions, Math. Programming, 14, pp. 224-248.
34. M. J. D. POWELL (1978), A fast algorithm for nonlinearly constrained optimization calculations, in Numerical Analysis, G. A. Watson, ed., Springer, pp. 144-157.
35. M. J. D. POWELL (1985), The performance of two subroutines for constrained optimization on some difficult test problems, in Numerical Optimization 1984, P. T. Boggs, R. H. Byrd, and R. B. Schnabel, eds., SIAM, Philadelphia, PA.
36. R. T. ROCKAFELLAR (1970), Convex Analysis, Princeton University Press, Princeton, NJ.
37. L. SCHWARTZ (1992), Analyse II: Calcul Différentiel et Équations Différentielles. Hermann, Paris, France.
38. M. SPIVAK (1979), Differentiable Geometry, Volume I, 2nd ed., Publish or Perish, Inc., Houston, TX.
39. J. STOER (1984), Principles of sequential quadratic programming methods for solving nonlinear programs, in Proc. NATO ASI on Computational Mathematical Programming, Bad Windsheim, Germany.
40. R. A. TAPIA (1977), Diagonalized multiplier methods and quasi-Newton methods for constrained optimization, J. Optim. Theory Appl., 22, pp. 135-194.
41. R. A. TAPIA (1988), On secant updates for use in general constrained optimization, Math. Comput., 51, pp. 181-202.
42. R. B. WILSON (1963), A Simplicial Algorithm for Concave Programming, Ph.D. thesis, Graduate School of Business Administration, Harvard University, Boston, MA.
43. P. WOLFE (1969), Convergence conditions for ascent methods, SIAM Rev., 11, pp. 226-235.
44. P. WOLFE (1971), Convergence conditions for ascent methods II: Some corrections, SIAM Rev., 13, pp. 185-188.