On the numerical feasibility of continuation methods for nonlinear programming problems

DOI10.1080/02331938408842968MaRDI QIDQ3216444zbMATH OpenOpenAlexFDO

Authors 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

continuation techniqueslocally convergent nonlinear programming algorithmsparametric nonlinear programmingradius of convergence

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1240859
• Feasible point methods and their global convergence
• On imbedding and parametric optimization—A concept of a globally convergent algorithm for nonlinear optimization problems
• Numerical Continuation and Singularity Detection Methods for Parametric Nonlinear Programming
• scientific article; zbMATH DE number 3898606

Cited in

(7)

• Strong stability of stationary solutions and Karush-Kuhn-Tucker points in nonlinear optimization
• Parametric network utility maximization problem
• On imbedding and parametric optimization—A concept of a globally convergent algorithm for nonlinear optimization problems
• On the Solution of Nonlinear Programming Problems Via Continuation Using Special LU Factorization
• scientific article; zbMATH DE number 1159807 (Why is no real title available?)
• Numerical Continuation and Singularity Detection Methods for Parametric Nonlinear Programming
• Implicit functions and sensitivity of stationary points

This page was built for publication: On the numerical feasibility of continuation methods for nonlinear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216444)