A repository of convex quadratic programming problems
From MaRDI portal
Publication:4504798
DOI10.1080/10556789908805768zbMath0973.90520OpenAlexW2009629085MaRDI QIDQ4504798
Publication date: 5 December 2001
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789908805768
Convex programming (90C25) Quadratic programming (90C20) Packaged methods for numerical algorithms (65Y15)
Related Items (38)
A secant-based Nesterov method for convex functions ⋮ Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization ⋮ Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy ⋮ A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints ⋮ Trajectory-following methods for large-scale degenerate convex quadratic programming ⋮ A comparison of reduced and unreduced KKT systems arising from interior point methods ⋮ Benchmarking large-scale distributed convex quadratic programming algorithms ⋮ General-purpose preconditioning for regularized interior point methods ⋮ IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming ⋮ Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming ⋮ Spectral estimates for unreduced symmetric KKT systems arising from Interior Point methods ⋮ A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming ⋮ Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques ⋮ A class of primal affine scaling algorithms ⋮ Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming ⋮ An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints ⋮ Steplength selection in interior-point methods for quadratic programming ⋮ qpOASES: a parametric active-set algorithm for~quadratic programming ⋮ COSMO: a conic operator splitting method for convex conic problems ⋮ Block BFGS Methods ⋮ Threshold incomplete factorization constraint preconditioners for saddle-point matrices ⋮ A primal-dual regularized interior-point method for convex quadratic programs ⋮ OSQP: An Operator Splitting Solver for Quadratic Programs ⋮ A primal-dual interior-point algorithm for quadratic programming ⋮ A generalized projection-based scheme for solving convex constrained optimization problems ⋮ An interior point-proximal method of multipliers for convex quadratic programming ⋮ Solving quadratic programs to high precision using scaled iterative refinement ⋮ Block preconditioners for linear systems in interior point methods for convex constrained optimization ⋮ QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs ⋮ Sparsity in convex quadratic programming with interior point methods ⋮ Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem ⋮ An exterior point polynomial-time algorithm for convex quadratic programming ⋮ A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization ⋮ Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization ⋮ Advances in design and implementation of optimization software ⋮ An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint ⋮ CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization ⋮ On a primal-dual Newton proximal method for convex quadratic programs
Uses Software
Cites Work
This page was built for publication: A repository of convex quadratic programming problems
