Abstract To construct robust and efficient optimization methods it is advantageous to combine a globally convergent algorithm and a locally superlinearly convergent one. Many of the proposed hybrid methods can be regarded as realizations of a general principle. For this class of methods (examples included) a general convergence result is presented.
Hybrid methods in nonlinear programming
1986-01-01
6 pages
Article/Chapter (Book)
Electronic Resource
English
Unconstrained methods in nonlinear programming
TIBKAT | 1976
|Nonlinear Programming Methods for Worst-Case Pilot Input Determination
Springer Verlag | 2012
|General Adaptive Guidance Using Nonlinear Programming Constraint-Solving Methods
Online Contents | 1993
|