How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
type: Item
instance of: scholarly article
title: How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
zbMATH Open document ID: 1257.90069
author: Hayato Waki
published in: Optimization Letters
publication date: 2012-12-28T00:00:00Z
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 6119206
zbMATH Keywords: weakly infeasible
zbMATH Keywords: semidefinite programming relaxation
describes a project that uses: Benchmarks for Optimization Software
describes a project that uses: SDPA
describes a project that uses: GloptiPoly
describes a project that uses: SeDuMi
MaRDI profile type: Publication
full work available at URL: s11590-011-0384-1
OpenAlex ID: W2054413257
cites work: Detecting Global Optimality and Extracting Solutions in GloptiPoly
cites work: Global optimization with polynomials and the problem of moments
cites work: A Sum of Squares Approximation of Nonnegative Polynomials
cites work: Q3601990
cites work: An independent benchmarking of SDP and SOCP solvers
cites work: New stopping criteria for detecting infeasibility in conic optimization
cites work: Q2716044
cites work: Q4285035
cites work: A mathematical view of interior-point methods in convex optimization
cites work: Q4496287
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: Q4496015
cites work: Q5482452
cites work: Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
DOI: 10.1007/S11590-011-0384-1
Recommended article: On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
Recommended article: Semidefinite programming relaxations for linear semi-infinite polynomial programming
Recommended article: Semidefinite Programming vs. LP Relaxations for Polynomial Programming
Recommended article: Semidefinite relaxations for semi-infinite polynomial programming
Recommended article: Solving polynomial least squares problems via semidefinite programming relaxations
Recommended article: Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
Recommended article: An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization
Recommended article: Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
Recommended article: Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
Recommended article: Tight relaxations for polynomial optimization and Lagrange multiplier expressions
description: scientific article; zbMATH DE number 6119206