On the numerical feasibility of continuation methods for nonlinear programming problems

DOI10.1080/02331938408842968zbMath0553.90083OpenAlexW2053793873MaRDI QIDQ3216444

Ralph Lehmann

Publication date: 1984

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938408842968

zbMATH Keywords

radius of convergencecontinuation techniquesparametric nonlinear programminglocally convergent nonlinear programming algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Parametric network utility maximization problem, Implicit functions and sensitivity of stationary points, Strong stability of stationary solutions and Karush-Kuhn-Tucker points in nonlinear optimization