A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds (1997)
Cached
Download Links
- [www.ams.org]
- [www.ams.org]
- [ftp.numerical.rl.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | Math. of Computation |
| Citations: | 4 - 1 self |
BibTeX
@ARTICLE{Conn97aglobally,
author = {A. R. Conn and Nick Gould and Ph and L. Toint},
title = {A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds},
journal = {Math. of Computation},
year = {1997},
volume = {66},
pages = {261--288}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We consider the global and local convergence properties of a class of Lagrangian barrier methods for solving nonlinear programming problems. In such methods, simple bound constraints may be treated separately from more general constraints. The objective and general constraint functions are combined in a Lagrangian barrier function. A sequence of such functions are approximately minimized within the domain defined by the simple bounds. Global convergence of the sequence of generated iterates to a first-order stationary point for the original problem is established. Furthermore, possible numerical difficulties associated with barrier function methods are avoided as it is shown that a potentially troublesome penalty parameter is bounded away from zero. This paper is a companion to previous work of ours on augmented Lagrangian methods. 1.
