Algorithm 920
From MaRDI portal
Publication:2989170
DOI10.1145/2331130.2331135zbMath1365.65163OpenAlexW2156678892WikidataQ113310374 ScholiaQ113310374MaRDI QIDQ2989170
Sunyoung Kim, Makoto Yamashita, Hayato Waki, Kojima, Masakazu
Publication date: 19 May 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2331130.2331135
semidefinite programming relaxationMatlab software packagesensor network localization problemssparsity exploitation
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Packaged methods for numerical algorithms (65Y15)
Related Items
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets, Fast implementation for semidefinite programs with positive matrix completion, Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems, Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier, Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization, Robust Euclidean embedding via EDM optimization, A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems, Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials, Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion, Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems, Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems, Euclidean Distance Matrices and Applications, A modified quasisecant method for global optimization
Uses Software
