COSMO: a conic operator splitting method for convex conic problems
From MaRDI portal
Publication:2231337
DOI10.1007/s10957-021-01896-xzbMath1478.90087arXiv1901.10887OpenAlexW3198328526WikidataQ120716805 ScholiaQ120716805MaRDI QIDQ2231337
Mark Cannon, Michael Garstka, Paul J. Goulart
Publication date: 29 September 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.10887
Related Items
An active-set algorithm for norm constrained quadratic problems ⋮ A new global algorithm for max-cut problem with chordal sparsity ⋮ Wasserstein model reduction approach for parametrized flow problems in porous media ⋮ Bounds and convex heuristics for bi-objective optimal experiment design in water networks ⋮ Projection onto the exponential cone: a univariate root-finding problem ⋮ Efficient semidefinite programming with approximate ADMM
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- OSQP: An Operator Splitting Solver for Quadratic Programs
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Computing the nearest correlation matrix--a problem from finance
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Reduced clique graphs of chordal graphs
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
- A new polynomial-time algorithm for linear programming
- Positive definite completions of partial Hermitian matrices
- Positive semidefinite matrices with a given sparsity pattern
- Operations research games: A survey. (With comments and rejoinder)
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Support-vector networks
- Infeasibility detection in the alternating direction method of multipliers for convex optimization
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- Accuracy of approximate projection to the semidefinite cone
- Multiplier and gradient methods
- Use of the augmented penalty function in mathematical programming problems. II. Conjugate gradient-restoration algorithm
- Use of the augmented penalty function in mathematical programming problems. I
- On the method of multipliers for mathematical programming problems
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Julia: A Fresh Approach to Numerical Computing
- The university of Florida sparse matrix collection
- Decomposition in Conic Optimization with Partially Separable Structure
- Preprocessing sparse semidefinite programs via matrix completion
- LAPACK Users' Guide
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Computing the Minimum Fill-In is NP-Complete
- On the Implementation of a Primal-Dual Interior Point Method
- Monotone Operators and the Proximal Point Algorithm
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Numerical Optimization
- Linear Matrix Inequalities in System and Control Theory
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A repository of convex quadratic programming problems
- SDPLIB 1.2, a library of semidefinite programming test problems
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- An Interior-Point Method for Semidefinite Programming
- Decomposition Methods for Large Scale LP Decoding
- Convex Analysis
- JuMP: A Modeling Language for Mathematical Optimization
