Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
DOI10.1007/S10107-012-0515-1zbMATH Open1262.90196OpenAlexW2158834326MaRDI QIDQ1949261FDOQ1949261
Makoto Yamashita, Masakazu Kojima
Publication date: 6 May 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0515-1
positive semidefinite matrixpolynomial optimization problemsellipsoidal setcompute error boundsconceptual min-max problemexisting SDP relaxationsLasserres hierarchy SDP relaxationsemialgebraic subset of \(\mathbb{R}^m\)sparsity for various optimization
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22) Minimax problems in mathematical programming (90C47) Semialgebraic sets and related spaces (14P10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- CSDP 2.3 user's guide
- Testing Unconstrained Optimization Software
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Solving semidefinite-quadratic-linear programs using SDPT3
- Linear Matrix Inequalities in System and Control Theory
- Global optimization with polynomials and the problem of moments
- Rounding of Polytopes in the Real Number Model of Computation
- Computation of Minimum-Volume Covering Ellipsoids
- Incidence matrices and interval graphs
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Newton-Type Minimization via the Lanczos Method
- On the Minimum Volume Covering Ellipsoid of Ellipsoids
- Positive definite completions of partial Hermitian matrices
- Extension of primal-dual interior point algorithms to symmetric cones
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Algorithm 920
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
- Semidefinite programming relaxation for nonconvex quadratic programs
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- On maximization of quadratic form over intersection of ellipsoids with common center
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Sparsity in sums of squares of polynomials
- Theory of semidefinite programming for sensor network localization
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
- Determinant Maximization with Linear Matrix Inequality Constraints
- Minimum-volume enclosing ellipsoids and core sets
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
Cited In (2)
Uses Software
This page was built for publication: Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949261)
