COSMO: A conic operator splitting method for convex conic problems
Preprint
Abstract
This paper describes the Conic Operator Splitting Method (COSMO), an operator splitting algorithm for convex optimisation problems with quadratic objective function and conic constraints. At each step the algorithm alternates between solving a quasi-definite linear system with a constant coefficient matrix and a projection onto convex sets. The solver is able to exploit chordal sparsity in the problem data and to detect infeasible problems. The low per-iteration computational cost makes the method particularly efficient for large problems, e.g. semidefinite programs in portfolio optimisation, graph theory, and robust control. Our Julia implementation is open-source, extensible, integrated into the Julia optimisation ecosystem and performs well on a variety of large convex problem classes.Keywords
All Related Versions
This publication has 32 references indexed in Scilit:
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix conesMathematical Programming Computation, 2010
- Computing the nearest correlation matrix--a problem from financeIMA Journal of Numerical Analysis, 2002
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3Optimization Methods and Software, 1999
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM Journal on Optimization, 1995
- Parallel alternating direction multiplier decomposition of convex programsJournal of Optimization Theory and Applications, 1994
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operatorsMathematical Programming, 1992
- Monotone Operators and the Proximal Point AlgorithmSIAM Journal on Control and Optimization, 1976
- A dual algorithm for the solution of nonlinear variational problems via finite element approximationComputers & Mathematics with Applications, 1976
- Use of the augmented penalty function in mathematical programming problems, part 2Journal of Optimization Theory and Applications, 1971