swMATH4793MaRDI QIDQ16955FDOQ16955
Author name not available (Why is that?)
Official website: http://www.is.titech.ac.jp/~kojima/SFSDP/SFSDP.html
Cited In (36)
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- Explicit sensor network localization using semidefinite representations and facial reductions
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Comparing SOS and SDP relaxations of sensor network localization
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
- A continuation method for large-sized sensor network localization problems
- Selected open problems in discrete geometry and optimization
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Exploiting structured sparsity in large scale semidefinite programming problems
- Moments, positive polynomials and their applications
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- A DC programming approach for sensor network localization with uncertainties in anchor positions
- SparseCoLO
- SNLSDP
- QSM
- A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems
- Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems
- Universal Rigidity and Edge Sparsification for Sensor Network Localization
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- A modified quasisecant method for global optimization
- Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems
- Geometric buildup algorithms for sensor network localization
- Euclidean distance matrices and applications
- A hybrid method based on particle swarm optimization and nonmonotone spectral gradient method for unconstrained optimization problem
- Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
- Robust Euclidean embedding via EDM optimization
This page was built for software: SFSDP
