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

DOI10.1080/1055678021000049372zbMath1029.90067OpenAlexW1997794865MaRDI QIDQ4709752

Brian J. Driessen, Nader Sadegh

Publication date: 4 February 2004

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

nonlinear programminggolbal convergenceinequality-equality constrained optimizationinfeasible subproblem

Mathematics Subject Classification ID

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

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• A robust line search for learning control
• 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.

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