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 457 articles , 1 standard article )
Showing results 1 to 20 of 457.
Sorted by year (- Behrends, Sönke; Hübner, Ruth; Schöbel, Anita: Norm bounds and underestimators for unconstrained polynomial integer minimization (2018)
- Bhim, Louis: Polynomial bounds for solutions to boundary value and obstacle problems with applications to financial derivative pricing. (Abstract of thesis) (2018)
- Campos, Juan S.; Parpas, Panos: A multigrid approach to SDP relaxations of sparse polynomial optimization problems (2018)
- Gillis, Nicolas; Sharma, Punit: A semi-analytical approach for the positive semidefinite Procrustes problem (2018)
- Kaiser, Eurika; Morzyński, Marek; Daviller, Guillaume; Kutz, J.Nathan; Brunton, Bingni W.; Brunton, Steven L.: Sparsity enabled cluster reduced-order models for control (2018)
- Mishra, Prabhat K.; Chatterjee, Debasish; Quevedo, Daniel E.: Sparse and constrained stochastic predictive control for networked systems (2018)
- Nayak, Rupaj Kumar; Biswal, Mahendra Prasad: A low complexity semidefinite relaxation for large-scale MIMO detection (2018)
- Rendl, Fanz; Sotirov, Renata: The MIN-cut and vertex separator problem (2018)
- Taeb, Armeen; Chandrasekaran, Venkat: Interpreting latent variables in factor models via convex optimization (2018)
- Abou Jaoude, Dany; Farhood, Mazen: Balanced truncation model reduction of nonstationary systems interconnected over arbitrary graphs (2017)
- Abou Jaoude, Dany; Farhood, Mazen: Distributed control of nonstationary LPV systems over arbitrary graphs (2017)
- Arima, Naohiko; Kim, Sunyoung; Kojima, Masakazu; Toh, Kim-Chuan: A robust Lagrangian-DNN method for a class of quadratic optimization problems (2017)
- Briat, Corentin: Dwell-time stability and stabilization conditions for linear positive impulsive and switched systems (2017)
- Cifuentes, Diego; Parrilo, Pablo A.: Sampling algebraic varieties for sum of squares programs (2017)
- Ding, Chao; Qi, Hou-Duo: Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation (2017)
- Ding, Chao; Qi, Hou-Duo: Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction (2017)
- Ducuara, Andrés F.; Susa, Cristian E.; Reina, John H.: Not-Post-Peierls compatibility under noisy channels (2017)
- Dumitrescu, Bogdan: Positive trigonometric polynomials and signal processing applications (2017)
- Fendl, Hannes; Neumaier, Arnold; Schichl, Hermann: Certificates of infeasibility via nonsmooth optimization (2017)
- Ge, Ming; Kerrigan, Eric C.: Noise covariance identification for nonlinear systems using expectation maximization and moving horizon estimation (2017)