Projects per year
Abstract
This paper considers the number of inner iterations required per outer iteration for the algorithm proposed by Conn et al. [9]. We show that asymptotically, under suitable reasonable assumptions, a single inner iteration suffices.
Original language | English |
---|---|
Pages (from-to) | 41-69 |
Number of pages | 29 |
Journal | Computational Optimization and Applications |
Volume | 7 |
Issue number | 1 |
Publication status | Published - 1 Jan 1997 |
Fingerprint
Dive into the research topics of 'On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds'. Together they form a unique fingerprint.-
-
LANCELOT: LANCELOT, a package for the solution of large-scale nonlinear optimization problems
TOINT, P., Sartenaer, A., Gould, N. I. M. & Conn, A.
1/09/87 → 1/09/00
Project: Research