Feasibility refinement in sequential quadratic programming using parametric sensitivity analysis

DOI10.1080/10556788.2016.1200045MaRDI QIDQ4594831zbMATH OpenOpenAlexFDO

Authors Sören Geffken, Christof Büskens

Publication date 24 November 2017

Published in Optimization Methods \& Software (Search for Journal in Brave)

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

zbMATH Keywords

nonlinear optimizationparametric sensitivity analysissequential quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• A computationally efficient feasible sequential quadratic programming algorithm
• WORHP Zen: Parametric Sensitivity Analysis for the Nonlinear Programming Solver WORHP
• scientific article; zbMATH DE number 4066630
• Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs
• A sub-feasible correction step for non-linear programming methods with equality constraints

Cited in

(2)

• A sub-feasible correction step for non-linear programming methods with equality constraints
• Sequential hierarchical least-squares programming for prioritized non-linear optimal control

This page was built for publication: Feasibility refinement in sequential quadratic programming using parametric sensitivity analysis

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