The following pages link to Algorithm 920 (Q2989170):
Displaying 14 items.
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion (Q717129) (← links)
- A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (Q1728251) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- Robust Euclidean embedding via EDM optimization (Q2220896) (← links)
- Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials (Q2230937) (← links)
- A modified quasisecant method for global optimization (Q2294744) (← links)
- Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems (Q2396463) (← links)
- Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems (Q2796798) (← links)
- Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems (Q2802536) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- Fast implementation for semidefinite programs with positive matrix completion (Q3458828) (← links)
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization (Q5189557) (← links)
