Two-phase model algorithm with global convergence for nonlinear programming

Journal of Optimization Theory and Applications

Volumn 96, Issue 2, 1998, Pages 397-436

  Martinez J M ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

global convergence; GRG methods; Nonlinear programming; projected gradient methods; SGRA methods; SQP methods; trust regions

Indexed keywords

GRADIENT METHODS; NONLINEAR EQUATIONS; RESTORATION;

ALGORITHM METHODS; GENERALIZED REDUCED GRADIENT METHOD METHOD; GENERALIZED REDUCED GRADIENT METHODS; GLOBAL CONVER-GENCE; MODEL ALGORITHMS; PROJECTED GRADIENT METHODS; RESTORATION ALGORITHM; SEQUENTIAL GRADIENT RESTORATION ALGORITHM METHOD; SQP METHOD; TRUST REGION;

NONLINEAR PROGRAMMING;

EID: 0032362856     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022626332710     Document Type: Article

References (25)

1. ROSEN, J. B., The Gradient Projection Method for Nonlinear Programming, Part 1: Linear Constraints, SIAM Journal on Applied Mathematics, Vol. 8, pp. 181-217, 1960.
2. ROSEN, J. B., The Gradient Projection Method for Nonlinear Programming, Part 2: Nonlinear Constraints, SIAM Journal on Applied Mathematics, Vol. 9, pp. 514-532, 1961.
3. ABADIE, J., and CARPENTIER, J., Generalization of the Wolfe Reduced-Gradient Method to the Case of Nonlinear Constraints, Optimization, Edited by R. Fletcher, Academic Press, New York, New York, pp. 37-47, 1968.
4. LASDON, L. S., Reduced Gradient Methods, Nonlinear Optimization 1981, Edited by M. J. D. Powell, Academic Press, New York, New York, pp. 235-242, 1982.
5. MIELE, A., HUANG, H. Y., and HEIDEMAN, J. C., Sequential Gradient-Restoration Algorithm for the Minimization of Constrained Functions: Ordinary and Conjugate Gradient Version, Journal of Optimization Theory and Applications, Vol. 4, pp. 213-246, 1969.
6. MIELE, A., LEVY, A. V., and CRAGG, E. E., Modifications and Extensions of the Conjugate-Gradient Restoration Algorithm for Mathematical Programming Problems, Journal of Optimization Theory and Applications, Vol. 7, pp. 450-472, 1971.
7. MIELE, A., SIMS, E. M., and BASAPUR, V. K., Sequential Gradient-Restoration Algorithm for Mathematical Programming Problems with Inequality Constraints, Part 1: Theory, Aero-Astronautics Report No. 168, Rice University, 1983.
8. ROM, M., and AVRIEL, M., Properties of the Sequential Gradient-Restoration Algorithm (SGRA), Part 1: Introduction and Comparison with Related Methods, Journal of Optimization Theory and Applications, Vol. 62, pp. 77-98, 1989.
9. ROM, M., and AVRIEL, M., Properties of the Sequential Gradient-Restoration Algorithm (SGRA), Part 2: Convergence Analysis, Journal of Optimization Theory and Applications, Vol. 62, pp. 99-126, 1989.
10. BYRD, R., and OMOJOKUN, E., Robust Trust-Region Methods for Nonlinearly Constrained Optimization, 1st SIAM Conference on Optimization, Houston, Texas, 1987.
11. EL-ALEM, M. M., A Global Convergence Theory for the Celis-Dennis-Tapia Trust Region Algorithm for Constrained Optimization, SIAM Journal on Numerical Analysis, Vol. 28, pp. 266-290, 1991.
12. DENNIS, J. E., EL-ALEM, M. M., and MACIEL, M. C., A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization, SIAM Journal on Optimization, Vol. 7, pp. 177-207, 1997.
13. EL-ALEM, M. M., A Robust Trust Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization, SIAM Journal on Optimization, Vol. 5, pp. 348-378, 1995.
14. GOMES, F. M., MACIEL, M. C., and MARTÍNEZ, J. M., Nonlinear Programming Algorithms Using Trust Regions and Augmented Lagrangians with Nonmonotone Penalty Parameters, Technical Report, Institute of Mathematics, University of Campinas, Campinas, SP, Brazil, 1995.
15. OMOJOKUN, E., Trust-Region Strategies for Optimization with Nonlinear Equality and Inequality Constraints, PhD Thesis, Department of Computer Science, University of Colorado, Boulder, Colorado, 1989.
16. POWELL, M. J. D., and YUAN, Y., A Trust-Region Algorithm for Equality Constrained Optimization, Mathematical Programming, Vol. 49, pp. 190-211, 1991.
17. GILL, P. E., MURRAY, W., and WRIGHT, M. H., Practical Optimization, Academic Press, London, England, 1981.
18. MURTAGH, R. B., and SAUNDERS, M. A., Large-Scale Linearly Constrained Optimization, Mathematical Programming, Vol. 14, pp. 41-72, 1978.
19. MARTÍNEZ, J. M., and SANTOS, S. A., A Trust Region Strategy for Minimization on Arbitrary Domains, Mathematical Programming, Vol. 68, pp. 267-302, 1995.
20. DEMBO, R. S., EISENSTAT, S. C., and STEIHAUG, T., Inexact Newton Methods, SIAM Journal on Numerical Analysis, Vol. 19, pp. 400-408, 1982.
21. FRIEDLANDER, A., MARTÍNEZ, J. M., and SANTOS, S. A., A New Trust Region Algorithm for Bound-Constrained Minimization, Journal of Applied Mathematics and Optimization, Vol. 30, pp. 235-266, 1994.
22. DINIZ-EHRHARDT, M. A., GOMES-RUGGIERO, M. A., and SANTOS, S. A., Comparing the Numerical Performance of Two Trust-Region Algorithms for Large-Scale Bound-Constrained Minimization, 5th SIAM Conference on Optimization, Victoria, Canada, 1996.
23. CONN, A. R., GOULD, N. I. M., and TOINT, P. L., A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds, SIAM Journal on Numerical Analysis, Vol. 28, pp. 545-572, 1991.
24. CONWAY, J. H., and SLOANE, N. J. C., Sphere Packings, Lattices, and Groups, Springer Verlag, New York, New York, 1988.
25. BIELSCHOWSKY, R. H., Nonlinear Programming Algorithms with Dynamic Definition of Near-Feasibility: Theory and Implementations, Doctoral Dissertation, Institute of Mathematics, University of Campinas, Campinas, SP, Brazil, 1996.