Pages that link to "Item:Q3664843"
From MaRDI portal
The following pages link to Revisions of constraint approximations in the successive QP method for nonlinear programming problems (Q3664843):
Displaying 14 items.
- Experiments with successive quadratic programming algorithms (Q1090233) (← links)
- Recent developments in constrained optimization (Q1112728) (← links)
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems (Q1194855) (← links)
- A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
- On a class fo hybrid methods for smooth constrained optimization (Q1321193) (← links)
- New sequential quadratic programming algorithm with consistent subproblems (Q1368267) (← links)
- Real time trajectory optimization for nonlinear robotic systems: relaxation and convexification (Q1678576) (← links)
- Use of exact penalty functions to determine efficient decisions (Q2638947) (← links)
- The Convex Feasible Set Algorithm for Real Time Optimization in Motion Planning (Q3177159) (← links)
- A robust SQP method based on a smoothing lower order penalty function† (Q3622004) (← links)
- A successive quadratic programming algorithm with global and superlinear convergence properties (Q3731379) (← links)
- A special newton-type optimization method (Q4327920) (← links)
- Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds (Q5080505) (← links)
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs (Q5501232) (← links)
