SDPT3
This software is designed to solve conic programming problems whose constraint cone is a product of semideﬁnite cones, second-order cones, nonnegative orthants and Euclidean spaces; and whose objective function is the sum of linear functions and log-barrier terms associated with the constraint cones. This includes the special case of determinant maximization problems with linear matrix inequalities. It employs an infeasible primal-dual predictor-corrector path-following method, with either the HKM or the NT search direction. The basic code is written in Matlab, but key subroutines in C are incorporated via Mex ﬁles. Routines are provided to read in problems in either SDPA or SeDuMi format. Sparsity and block diagonal structure are exploited. We also exploit low-rank structures in the constraint matrices associated the semideﬁnite blocks if such structures are explicitly given. To help the users in using our software, we also include some examples to illustrate the coding of problem data for our SQLP solver. Various techniques to improve the efficiency and stability of the algorithm are incorporated. For example, step-lengths associated with semideﬁnite cones are calculated via the Lanczos method. Numerical experiments show that this general purpose code can solve more than 80% of a total of about 300 test problems to an accuracy of at least 10−6 in relative duality gap and infeasibilities.
Keywords for this software
References in zbMATH (referenced in 374 articles , 1 standard article )
Showing results 1 to 20 of 374.
Sorted by year (- Bugarin, Florian; Henrion, Didier; Lasserre, Jean Bernard: Minimizing the sum of many rational functions (2016)
- Chen, Caihua; Liu, Yong-Jin; Sun, Defeng; Toh, Kim-Chuan: A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems (2016)
- Friberg, Henrik A.: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (2016)
- Jin, Zheng-Fen; Wan, Zhongping; Jiao, Yuling; Lu, Xiliang: An alternating direction method with continuation for nonconvex low rank minimization (2016)
- Kim, Sunyoung; Kojima, Masakazu; Toh, Kim-Chuan: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (2016)
- Klep, Igor; Povh, Janez: Constrained trace-optimization of polynomials in freely noncommuting variables (2016)
- Ling, Aifan: An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results (2016)
- Liu, Ya-Feng; Diao, Rui; Ye, Feng; Liu, Hong-Wei: An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (2016)
- Li, Xianwei; Gao, Huijun; Gu, Keqin: Delay-independent stability analysis of linear time-delay systems based on frequency discretization (2016)
- Luz, Carlos J.: A characterization of the weighted Lovász number based on convex quadratic programming (2016)
- Ma, Jingying; Zheng, Yuanshi; Wang, Long: Topology selection for multi-agent systems with opposite leaders (2016)
- O’Donoghue, Brendan; Chu, Eric; Parikh, Neal; Boyd, Stephen: Conic optimization via operator splitting and homogeneous self-dual embedding (2016)
- Park, Sungwoo: A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence (2016)
- Pong, Ting Kei; Sun, Hao; Wang, Ningchuan; Wolkowicz, Henry: Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (2016)
- Simonetto, Andrea; Jamali-Rad, Hadi: Primal recovery from consensus-based dual decomposition for distributed convex optimization (2016)
- Van Parys, Bart P.G.; Goulart, Paul J.; Kuhn, Daniel: Generalized Gauss inequalities via semidefinite programming (2016)
- Wang, Chengjing: On how to solve large-scale log-determinant optimization problems (2016)
- Bachoc, Christine; Passuello, Alberto; Thiery, Alain: The density of sets avoiding distance 1 in Euclidean space (2015)
- Bugarin, Florian; Bartoli, Adrien; Henrion, Didier; Lasserre, Jean-Bernard; Orteu, Jean-José; Sentenac, Thierry: Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (2015)
- Chaudhury, K.N.; Khoo, Y.; Singer, A.: Global registration of multiple point clouds using semidefinite programming (2015)