SDPA
SDPA (SemiDefinite Programming Algorithm)” is one of the most efficient and stable software packages for solving SDPs based on the primal-dual interior-point method. It fully exploits the sparsity of given problems. There are some variants of the SDPA;
Keywords for this software
References in zbMATH (referenced in 161 articles )
Showing results 1 to 20 of 161.
Sorted by year (- Sun, Defeng; Toh, Kim-Chuan; Yuan, Yancheng; Zhao, Xin-Yuan: SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) (2020)
- Cafuta, Kristijan: Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools (2019)
- Kimizuka, Masaki; Kim, Sunyoung; Yamashita, Makoto: Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (2019)
- Komeiji, Hikaru; Kim, Sunyoung; Yamashita, Makoto: On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems (2019)
- Magron, Victor; Safey El Din, Mohab; Schweighofer, Markus: Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials (2019)
- Sun, Tianxiao; Quoc, Tran-Dinh: Generalized self-concordant functions: a recipe for Newton-type methods (2019)
- Waki, Hayato; Sebe, Noboru: Application of facial reduction to (H_\infty) state feedback control problem (2019)
- Zhao, Ruijie; Lai, Xiaoping; Hong, Xiaoying; Lin, Zhiping: A matrix-based IRLS algorithm for the least (l_p)-norm design of 2-D FIR filters (2019)
- Curchod, Florian J.; Johansson, Markus; Augusiak, Remigiusz; Hoban, Matty J.; Wittek, Peter; Acín, Antonio: A single entangled system is an unbounded source of nonlocal correlations and of certified random numbers (2018)
- Gally, Tristan; Pfetsch, Marc E.; Ulbrich, Stefan: A framework for solving mixed-integer semidefinite programs (2018)
- Roux, Pierre; Iguernlala, Mohamed; Conchon, Sylvain: A non-linear arithmetic procedure for control-command software verification (2018)
- Roux, Pierre; Voronin, Yuen-Lam; Sankaranarayanan, Sriram: Validating numerical semidefinite programming solvers for polynomial invariants (2018)
- Victor Magron, Mohab Safey El Din: RealCertify: a Maple package for certifying non-negativity (2018) arXiv
- Anderson, Peter D.; Kruczenski, Martin: Loop equations and bootstrap methods in the lattice (2017)
- Arima, Naohiko; Kim, Sunyoung; Kojima, Masakazu; Toh, Kim-Chuan: A robust Lagrangian-DNN method for a class of quadratic optimization problems (2017)
- Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie; Wiegele, Angelika: Using a conic bundle method to accelerate both phases of a quadratic convex reformulation (2017)
- Dostert, Maria; Guzmán, Cristóbal; de Oliveira Filho, Fernando Mário; Vallentin, Frank: New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry (2017)
- Lasserre, Jean B.: Computing Gaussian & exponential measures of semi-algebraic sets (2017)
- Magron, Victor; Constantinides, George; Donaldson, Alastair: Certified roundoff error bounds using semidefinite programming (2017)
- Sakaue, Shinsaku; Takeda, Akiko; Kim, Sunyoung; Ito, Naoki: Exact semidefinite programming relaxations with truncated moment matrix for binary polynomial optimization problems (2017)