OSQP: An Operator Splitting Solver for Quadratic Programs
From MaRDI portal
Publication:78613
DOI10.48550/arXiv.1711.08013zbMath1452.90236arXiv1711.08013OpenAlexW2769646558WikidataQ120716989 ScholiaQ120716989MaRDI QIDQ78613
Alberto Bemporad, Paul Goulart, Bartolomeo Stellato, Goran Banjac, Stephen Boyd, Goran Banjac, Alberto Bemporad, Stephen P. Boyd, Bartolomeo Stellato, Paul J. Goulart
Publication date: 21 November 2017
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.08013
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Linear programming with nonparametric penalty programs and iterated thresholding, Penalized and constrained LAD estimation in fixed and high dimension, Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization, \texttt{acados} -- a modular open-source framework for fast embedded optimal control, Stabilising quasi-time-optimal nonlinear model predictive control with variable discretisation, An active-set algorithm for norm constrained quadratic problems, On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming, Proportional-integral projected gradient method for conic optimization, FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming, Laplacian-optimized diffusion for semi-supervised learning, Multi-period portfolio optimization using model predictive control with mean-variance and risk parity frameworks, Portfolio construction as linearly constrained separable optimization, IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming, Data‐enabled predictive control for quadcopters, Sparse convex optimization toolkit: a mixed-integer framework, Online Mixed-Integer Optimization in Milliseconds, Semi-explicit model predictive control of quasi linear parameter varying systems, An index search method based inner-outer iterative algorithm for solving nonnegative least squares problems, Radial duality. II: Applications and algorithms, Total positivity in multivariate extremes, Tutorial on Amortized Optimization, Continuous-time portfolio optimization for absolute return funds, Efficient min–max MPC: Achieving a large domain of attraction with short horizon, Numerical Approximation of Optimal Convex Shapes, Pooling adjacent violators under interval constraints, Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming, A new computationally simple approach for implementing neural networks with output hard constraints, Efficient differentiable quadratic programming layers: an ADMM approach, On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization, COSMO: a conic operator splitting method for convex conic problems, osqp, Infeasibility detection in the alternating direction method of multipliers for convex optimization, Solution refinement at regular points of conic problems, Douglas-Rachford splitting and ADMM for pathological convex optimization, Tax-aware portfolio construction via convex optimization, A proximal augmented method for semidefinite programming problems, Optimal representative sample weighting, Efficient semidefinite programming with approximate ADMM, Spatially varying coefficient models with sign preservation of the coefficient functions, QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs, An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods, Passive Nonlinear Dendritic Interactions as a Computational Resource in Spiking Neural Networks, A distributed Bregman forward-backward algorithm for a class of Nash equilibrium problems, Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem, NMPC in active subspaces: dimensionality reduction with recursive feasibility guarantees, Theoretical characteristics and numerical methods for a class of special piecewise quadratic optimization, On a primal-dual Newton proximal method for convex quadratic programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Conic optimization via operator splitting and homogeneous self-dual embedding
- CVXGEN: a code generator for embedded convex optimization
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- A new polynomial-time algorithm for linear programming
- Metric selection in fast dual forward-backward splitting
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Model predictive control: Theory and practice - a survey
- Parallel alternating direction multiplier decomposition of convex programs
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Preconditioning techniques for large linear systems: A survey
- Support-vector networks
- Infeasibility detection in the alternating direction method of multipliers for convex optimization
- Stochastic matrix-free equilibration
- Concerning nonnegative matrices and doubly stochastic matrices
- Mathematical Methods of Organizing and Planning Production
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- A Symmetry Preserving Algorithm for Matrix Scaling
- Predictive Control for Linear and Hybrid Systems
- Optimal Parameter Selection for the Alternating Direction Method of Multipliers (ADMM): Quadratic Problems
- Embedded Online Optimization for Model Predictive Control at Megahertz Rates
- The university of Florida sparse matrix collection
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- The Simplex Method for Quadratic Programming
- Direct Methods for Sparse Linear Systems
- Algorithm 849
- Efficient Numerical Methods for Nonlinear MPC and Moving Horizon Estimation
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- On the Implementation of a Primal-Dual Interior Point Method
- Linear Matrix Inequalities in System and Control Theory
- Variational Analysis
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- A repository of convex quadratic programming problems
- Tight Global Linear Convergence Rate Bounds for Operator Splitting Methods
- Parameter Selection and Preconditioning for a Graph Form Solver
- On Projection Algorithms for Solving Convex Feasibility Problems
- Symmetric Quasidefinite Matrices
- A Note on Performance Profiles for Benchmarking Software
- Mixed-integer nonlinear optimization
- Object-oriented software for quadratic programming
- Algorithm 837
- Robust Estimation of a Location Parameter
- JuMP: A Modeling Language for Mathematical Optimization
- Convex analysis and monotone operator theory in Hilbert spaces
- Robust Statistics
- Benchmarking optimization software with performance profiles.
