Partially reduced sqp methods for large-scale nonlinear optimization problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3938445 (Why is no real title available?)
- scientific article; zbMATH DE number 510357 (Why is no real title available?)
- scientific article; zbMATH DE number 589271 (Why is no real title available?)
- scientific article; zbMATH DE number 978506 (Why is no real title available?)
- scientific article; zbMATH DE number 789388 (Why is no real title available?)
- scientific article; zbMATH DE number 877091 (Why is no real title available?)
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
- Sequential Quadratic Programming Methods Based on Approximating a Projected Hessian Matrix
- Time-optimal extension and retraction of robots: Numerical analysis of the switching structure
Cited in
(7)- A reduced proximal-point homotopy method for large-scale non-convex BQP
- scientific article; zbMATH DE number 589250 (Why is no real title available?)
- Global convergence of inexact reduced sqp methods
- Review of formulations for structural and mechanical system optimization
- scientific article; zbMATH DE number 877091 (Why is no real title available?)
- A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems
- Solving discretized optimization problems by partially reduced SQP methods
This page was built for publication: Partially reduced sqp methods for large-scale nonlinear optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4378710)