Michael Garstka
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Michael Garstka has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Mark Cannon
Department of Engineering Science, University of Oxford, Oxford, U.K.
3 shared publications - Paul Goulart
Department of Engineering Science University of Oxford OX1 3PJ Oxford UK
3 shared publications Adhithya Senthil Kumar
Department of Engineering Science, University of Oxford, UK
1 shared publicationAlfonso A. Castrejón-Pita
Department of Engineering Science, University of Oxford, UK
1 shared publicationAnair Beverly
Department of Engineering Science, University of Oxford, UK
1 shared publicationAndrew C.J. Orr
Department of Engineering Science, University of Oxford, UK
1 shared publication
Latest Publications
- Open Access
- 13 February 2022
- Published by Elsevier in EBioMedicine
- Vol. 76, 103868
OxVent: Design and evaluation of a rapidly-manufactured Covid-19 ventilator
- 13 February 2022
- Published by Elsevier in EBioMedicine
- Vol. 76, 103868
Open AccessOxVent: Design and evaluation of a rapidly-manufactured Covid-19 ventilator
- Top Cited PapersOpen Access
- 29 August 2021
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 190 (3) , 779-810
COSMO: A Conic Operator Splitting Method for Convex Conic Problems
This paper describes the conic operator splitting method (COSMO) solver, an operator splitting algorithm and associated software package 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 portfolio optimisation, graph theory, and robust control. Moreover, the solver uses chordal decomposition techniques and a new clique merging algorithm to effectively exploit sparsity in large, structured semidefinite programs. Numerical comparisons with other state-of-the-art solvers for a variety of benchmark problems show the effectiveness of our approach. Our Julia implementation is open source, designed to be extended and customised by the user, and is integrated into the Julia optimisation ecosystem.
- 29 August 2021
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 190 (3) , 779-810
Top Cited PapersOpen AccessCOSMO: A Conic Operator Splitting Method for Convex Conic Problems
This paper describes the conic operator splitting method (COSMO) solver, an operator splitting algorithm and associated software package 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 portfolio optimisation, graph theory, and robust control. Moreover, the solver uses chordal decomposition techniques and a new clique merging algorithm to effectively exploit sparsity in large, structured semidefinite programs. Numerical comparisons with other state-of-the-art solvers for a variety of benchmark problems show the effectiveness of our approach. Our Julia implementation is open source, designed to be extended and customised by the user, and is integrated into the Julia optimisation ecosystem.
- Open Access
COSMO: A conic operator splitting method for convex conic problems
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 portfolio optimisation, graph theory, and robust control. Moreover, the solver uses chordal decomposition techniques and a new clique merging algorithm to effectively exploit sparsity in large, structured semidefinite programs. A number of benchmarks against other state-of-the-art solvers for a variety of problems show the effectiveness of our approach. Our Julia implementation is open-source, designed to be extended and customised by the user, and is integrated into the Julia optimisation ecosystem.
Open AccessCOSMO: A conic operator splitting method for convex conic problems
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 portfolio optimisation, graph theory, and robust control. Moreover, the solver uses chordal decomposition techniques and a new clique merging algorithm to effectively exploit sparsity in large, structured semidefinite programs. A number of benchmarks against other state-of-the-art solvers for a variety of problems show the effectiveness of our approach. Our Julia implementation is open-source, designed to be extended and customised by the user, and is integrated into the Julia optimisation ecosystem.
- Open Access
A clique graph based merging strategy for decomposable SDPs
Chordal decomposition techniques are used to reduce large structured positive semidefinite matrix constraints in semidefinite programs (SDPs). The resulting equivalent problem contains multiple smaller constraints on the nonzero blocks (or cliques) of the original problem matrices. This usually leads to a significant reduction in the overall solve time. A further reduction is possible by remerging cliques with significant overlap. The degree of overlap for which this is effective is dependent on the particular solution algorithm and hardware to be employed. We propose a novel clique merging approach that utilizes the clique graph to identify suitable merge candidates. We show its performance by comparing it with two existing methods on selected problems from a benchmark library. Our approach is implemented in the latest version of the conic ADMM-solver COSMO.
Open AccessA clique graph based merging strategy for decomposable SDPs
Chordal decomposition techniques are used to reduce large structured positive semidefinite matrix constraints in semidefinite programs (SDPs). The resulting equivalent problem contains multiple smaller constraints on the nonzero blocks (or cliques) of the original problem matrices. This usually leads to a significant reduction in the overall solve time. A further reduction is possible by remerging cliques with significant overlap. The degree of overlap for which this is effective is dependent on the particular solution algorithm and hardware to be employed. We propose a novel clique merging approach that utilizes the clique graph to identify suitable merge candidates. We show its performance by comparing it with two existing methods on selected problems from a benchmark library. Our approach is implemented in the latest version of the conic ADMM-solver COSMO.