Revisions of constraint approximations in the successive QP method for nonlinear programming problems

DOI10.1007/BF02592051zbMath0516.90065MaRDI QIDQ3664843

Kaoru Tone

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

successive quadratic programmingexact penalty functionsdescent directionsstart proceduremodified Han-Powell approximation

Mathematics Subject Classification ID

Related Items (14)

Experiments with successive quadratic programming algorithms ⋮ The Convex Feasible Set Algorithm for Real Time Optimization in Motion Planning ⋮ Use of exact penalty functions to determine efficient decisions ⋮ A successive quadratic programming algorithm with global and superlinear convergence properties ⋮ Recent developments in constrained optimization ⋮ New sequential quadratic programming algorithm with consistent subproblems ⋮ Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds ⋮ Real time trajectory optimization for nonlinear robotic systems: relaxation and convexification ⋮ A special newton-type optimization method ⋮ An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems ⋮ A robust SQP method based on a smoothing lower order penalty function† ⋮ Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs ⋮ A new technique for inconsistent QP problems in the SQP method ⋮ On a class fo hybrid methods for smooth constrained optimization

Cites Work

• A globally convergent method for nonlinear programming
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• Unnamed Item

This page was built for publication: Revisions of constraint approximations in the successive QP method for nonlinear programming problems