Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
type: Item
instance of: scholarly article
title: Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
zbMATH Open document ID: 1262.90196
author: Makoto Yamashita
author: Masakazu Kojima
published in: Mathematical Programming. Series A. Series B
publication date: 2013-05-06T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 14P10
zbMATH DE Number: 6160892
zbMATH Keywords: semialgebraic subset of \(\mathbb{R}^m\)
zbMATH Keywords: Lasserres hierarchy SDP relaxation
zbMATH Keywords: sparsity for various optimization
zbMATH Keywords: polynomial optimization problems
zbMATH Keywords: compute error bounds
zbMATH Keywords: conceptual min-max problem
zbMATH Keywords: positive semidefinite matrix
zbMATH Keywords: existing SDP relaxations
zbMATH Keywords: ellipsoidal set
describes a project that uses: SFSDP
describes a project that uses: CSDP
describes a project that uses: SeDuMi
describes a project that uses: SDPT3
describes a project that uses: SparseCoLO
describes a project that uses: minpack
describes a project that uses: SDPA
describes a project that uses: SparsePOP
describes a project that uses: tn
MaRDI profile type: Publication
full work available at URL: s10107-012-0515-1
OpenAlex ID: W2158834326
cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
cites work: Q4288578
cites work: CSDP 2.3 user's guide
cites work: Linear Matrix Inequalities in System and Control Theory
cites work: Q4321748
cites work: Semidefinite programming relaxation for nonconvex quadratic programs
cites work: Theory of semidefinite programming for sensor network localization
cites work: Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
cites work: Positive definite completions of partial Hermitian matrices
cites work: Incidence matrices and interval graphs
cites work: Q5791470
cites work: Rounding of Polytopes in the Real Number Model of Computation
cites work: Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
cites work: Algorithm 920
cites work: Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
cites work: Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
cites work: A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
cites work: On the Minimum Volume Covering Ellipsoid of Ellipsoids
cites work: Sparsity in sums of squares of polynomials
cites work: An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
cites work: A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
cites work: Minimum-volume enclosing ellipsoids and core sets
cites work: Global optimization with polynomials and the problem of moments
cites work: Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
cites work: Testing Unconstrained Optimization Software
cites work: Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
cites work: Newton-Type Minimization via the Lanczos Method
cites work: On maximization of quadratic form over intersection of ellipsoids with common center
cites work: Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
cites work: Q4285035
cites work: Extension of primal-dual interior point algorithms to symmetric cones
cites work: Q3802887
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: Computation of Minimum-Volume Covering Ellipsoids
cites work: Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
cites work: Solving semidefinite-quadratic-linear programs using SDPT3
cites work: Determinant Maximization with Linear Matrix Inequality Constraints
DOI: 10.1007/S10107-012-0515-1
description: scientific article; zbMATH DE number 6160892