A practical and optimal first-order method for large-scale convex quadratic programming
From MaRDI portal
Cites work
- $\ell_1$ Trend Filtering
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A primal-dual regularized interior-point method for convex quadratic programs
- A repository of convex quadratic programming problems
- Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
- Accelerated stochastic algorithms for convex-concave saddle-point problems
- Adaptive restart for accelerated gradient schemes
- An accelerated linearized alternating direction method of multipliers
- An ADMM-based interior-point method for large-scale linear programming
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Fast alternating direction optimization methods
- Faster first-order primal-dual methods for linear programming using restarts and sharpness
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 1240224 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Julia: a fresh approach to numerical computing
- Large-scale unit commitment under uncertainty: an updated literature survey
- Linear coupling: an ultimate unification of gradient and mirror descent
- Linear-Quadratic Programming and Optimal Control
- LOQO:an interior point code for quadratic programming
- New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure
- On implementing a primal-dual interior-point method for conic quadratic optimization
- Operator splitting for a homogeneous embedding of the linear complementarity problem
- Optimal methods of smooth convex minimization
- Optimal primal-dual methods for a class of saddle point problems
- OSQP: an operator splitting solver for quadratic programs
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- QPLIB: a library of quadratic programming instances
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Restarting algorithms: sometimes there is free lunch
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity
- Sharpness, restart, and acceleration
- Some continuity properties of polyhedral multifunctions
- Some methods of speeding up the convergence of iteration methods
- Support-vector networks
This page was built for publication: A practical and optimal first-order method for large-scale convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6873488)
