Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
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)
- Ellipsoidal bounds for uncertain linear equations and dynamical systems
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
- Minimum-volume ellipsoids. Theory and algorithms
- On Chebyshev center of the intersection of two ellipsoids
- On maximization of quadratic form over intersection of ellipsoids with common center
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
- CSDP 2.3 user's guide
- Computation of Minimum-Volume Covering Ellipsoids
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Determinant Maximization with Linear Matrix Inequality Constraints
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Extension of primal-dual interior point algorithms to symmetric cones
- Global optimization with polynomials and the problem of moments
- Incidence matrices and interval graphs
- Linear Matrix Inequalities in System and Control Theory
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
- Minimum-volume enclosing ellipsoids and core sets
- Newton-Type Minimization via the Lanczos Method
- On maximization of quadratic form over intersection of ellipsoids with common center
- On the Minimum Volume Covering Ellipsoid of Ellipsoids
- Positive definite completions of partial Hermitian matrices
- Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
- Rounding of Polytopes in the Real Number Model of Computation
- Semidefinite programming relaxation for nonconvex quadratic programs
- Solving semidefinite-quadratic-linear programs using SDPT3
- Sparsity in sums of squares of polynomials
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Testing Unconstrained Optimization Software
- Theory of semidefinite programming for sensor network localization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
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)
