Decomposition in Conic Optimization with Partially Separable Structure

DOI10.1137/130926924zbMath1297.90111arXiv1306.0057OpenAlexW2014495508MaRDI QIDQ3192107

Yifan Sun, Lieven Vandenberghe, Martin S. Andersen

Publication date: 26 September 2014

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.0057

zbMATH Keywords

interior-point algorithmsdecompositionsemidefinite programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51)

Related Items

Decomposition Methods for Sparse Matrix Nearness Problems, Distributed consensus-based solver for semi-definite programming: an optimization viewpoint, Sum-of-squares chordal decomposition of polynomial matrix inequalities, Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes, COSMO: a conic operator splitting method for convex conic problems, A survey on conic relaxations of optimal power flow problem, Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion, Chordal decomposition in operator-splitting methods for sparse semidefinite programs, Bounds on heat transfer for Bénard–Marangoni convection at infinite Prandtl number, Bregman primal-dual first-order method and application to sparse semidefinite programming, Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing

Uses Software

• SeDuMi
• HSL_MA77