Corpus ID: 119667425

COSMO: A conic operator splitting method for convex conic problems

@article{Garstka2019COSMOAC,
  title={COSMO: A conic operator splitting method for convex conic problems},
  author={Michael Garstka and M. Cannon and P. Goulart},
  journal={arXiv: Optimization and Control},
  year={2019}
}
  • Michael Garstka, M. Cannon, P. Goulart
  • Published 2019
  • Computer Science, Mathematics
  • arXiv: Optimization and Control
  • This paper describes the Conic Operator Splitting Method (COSMO) solver, 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 low per-iteration computational cost makes the method particularly efficient for large problems, e.g. semidefinite programs that arise in… CONTINUE READING
    9 Citations
    Optimal Approximation of Doubly Stochastic Matrices
    • 2
    • PDF
    Exploiting constant trace property in large-scale polynomial optimization
    • 2
    • PDF
    Decentralized Resource Allocation via Dual Consensus ADMM
    • 4
    • PDF
    Accuracy of approximate projection to the semidefinite cone
    • 1
    • PDF
    Sparse Gaussian Processes via Parametric Families of Compactly-supported Kernels
    • J. Barber
    • Computer Science, Mathematics
    • ArXiv
    • 2020
    • PDF
    Single harmonic based Model Predictive Control for tracking
    • 1

    References

    SHOWING 1-10 OF 69 REFERENCES
    OSQP: An Operator Splitting Solver for Quadratic Programs
    • 193
    • PDF
    Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
    • 299
    • PDF
    Decomposition in Conic Optimization with Partially Separable Structure
    • 44
    • PDF
    Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
    • F. Alizadeh
    • Mathematics, Computer Science
    • SIAM J. Optim.
    • 1995
    • 951
    • PDF
    Proximal Algorithms
    • 2,461
    • PDF
    Infeasibility Detection in the Alternating Direction Method of Multipliers for Convex Optimization
    • 32
    • PDF