Inequality-Equality Constrained Optimization: An Analytical Robustness Comparison of a Feasibility Method Versus L1 Sequential Quadratic Programming

DOI10.1080/1055678021000049372MaRDI QIDQ4709752zbMATH OpenOpenAlexFDO

Authors Brian J. Driessen, Nader Sadegh

Publication date 4 February 2004

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

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

zbMATH Keywords

golbal convergenceinequality-equality constrained optimizationinfeasible subproblemnonlinear programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Recommendations

• A feasible SQP method for nonlinear programming
• Infeasibility Detection and SQP Methods for Nonlinear Optimization
• A feasible equality constrained SQP algorithm for nonlinear optimization
• A Robust Algorithm for Optimization with General Equality and Inequality Constraints
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization

Cites work

• A robust line search for learning control
• scientific article; zbMATH DE number 3528420 (Why is no real title available?)
• Learning control for a class of nonlinear differential-algebraic systems with application to constrained robots
• Learning Control of Robot Manipulators
• Nonlinear programming without a penalty function.

Cited in

(1)

• Feasibility control in nonlinear optimization

Describes a project that uses

Uses Software

• SNOPT

This page was built for publication: Inequality-Equality Constrained Optimization: An Analytical Robustness Comparison of a Feasibility Method Versus L1 Sequential Quadratic Programming

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