scientific article; zbMATH DE number 4197288
From MaRDI portal
Publication:5203586
Recommendations
- A sparse sequential quadratic programming algorithm
- Sparse quadratic programming in chemical process optimization
- QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming
- Sparse Matrix Methods in Optimization
- scientific article; zbMATH DE number 13594
Cited in
(14)- An iterative working-set method for large-scale nonconvex quadratic programming
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
- New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions
- Methods for convex and general quadratic programming
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
- QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming
- An augmented incomplete factorization approach for computing the Schur complement in stochastic optimization
- Constraint deletion strategy in the inertia-controlling quadratic programming method
- An Active-Set Method for Quadratic Programming Based On Sequential Hot-Starts
- An exterior point polynomial-time algorithm for convex quadratic programming
- Primal and dual active-set methods for convex quadratic programming
- An efficient direct solver for a class of mixed finite element problems
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming
- Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203586)
