Nimrod Megiddo
Journal of Symbolic Computation
Paper
On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds
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.
Related
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Simeon Furrer, Dirk Dahlhaus
ISIT 2005
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010