Methods for convex and general quadratic programming
From MaRDI portal
Publication:2356335
DOI10.1007/s12532-014-0075-xzbMath1317.90225OpenAlexW2117869333MaRDI QIDQ2356335
Philip E. Gill, Elizabeth Wong
Publication date: 29 July 2015
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-014-0075-x
KKT systemsactive-set methodsSchur-complement methodconvex and nonconvex quadratic programminglarge-scale quadratic programmingvariable-reduction method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Primal and dual active-set methods for convex quadratic programming, An active set algorithm for nonlinear optimization with polyhedral constraints, PAL-Hom method for QP and an application to LP, Nonparametric density estimation with nonuniform B-spline bases, An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix, A quadratic simplex algorithm for primal optimization over zero-one polytopes, A study of structure-exploiting SQP algorithms for an optimal control problem with coupled hyperbolic and ordinary differential equation constraints, QPLIB: a library of quadratic programming instances, A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization, QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs, CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
- QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming
- Checking local optimality in constrained quadratic programming is NP- hard
- Une caractérisation complete des minima locaux en programmation quadratique
- A computational method for the indefinite quadratic programming problem
- Quadratic programming with one negative eigenvalue is NP-hard
- A practical anti-cycling procedure for linearly constrained optimization
- Maintaining LU factors of a general sparse matrix
- An iterative working-set method for large-scale nonconvex quadratic programming
- The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- On classes of copositive matrices
- Sequential Quadratic Programming Methods
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
- A weighted gram-schmidt method for convex quadratic programming
- An Algorithm for Large-Scale Quadratic Programming
- Inertia-Controlling Methods for General Quadratic Programming
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- On the quadratic programming algorithm of Goldfarb and Idnani
- On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
- Some NP-complete problems in quadratic and nonlinear programming
- On the Identification of Local Minimizers in Inertia-Controlling Methods for Quadratic Programming
- A Block-$LU$ Update for Large-Scale Linear Programming
- Matrix augmentation and partitioning in the updating of the basis inverse
- Numerically stable methods for quadratic programming
- Numerical Optimization
- On pricing and backward transformation in linear programming
- A combined unifrontal/multifrontal method for unsymmetric sparse matrices
- Necessary and sufficient conditions for quadratic minimality
- Sparse Matrix Methods in Optimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
- An online active set strategy to overcome the limitations of explicit MPC
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
- Algorithm 832
- A General Quadratic Programming Algorithm
- Optimality conditions for quadratic programming
