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

DOI10.1080/1055678021000049372zbMATH Open1029.90067OpenAlexW1997794865MaRDI QIDQ4709752FDOQ4709752

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

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

zbMATH Keywords

nonlinear programminggolbal convergenceinequality-equality constrained optimizationinfeasible subproblem

Mathematics Subject Classification ID

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

Cites Work

• Nonlinear programming without a penalty function.
• Title not available (Why is that?)
• Learning Control of Robot Manipulators
• Learning control for a class of nonlinear differential-algebraic systems with application to constrained robots
• A robust line search for learning control

Cited In (1)

• Feasibility control in nonlinear optimization

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)