Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
type: Item
instance of: scholarly article
title: Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
zbMATH Open document ID: 1264.90162
author: Hayato Waki
author: Maho Nakata
author: Masakazu Muramatsu
published in: Computational Optimization and Applications
publication date: 2013-02-18T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 6137008
zbMATH Keywords: polynomial optimization
zbMATH Keywords: semidefinite programming
zbMATH Keywords: numerical stability
describes a project that uses: Sostools
describes a project that uses: SeDuMi
describes a project that uses: Matlab
describes a project that uses: Symbolic Math Toolbox
describes a project that uses: gmp
describes a project that uses: SDPA
describes a project that uses: SparsePOP
describes a project that uses: GloptiPoly
MaRDI profile type: Publication
full work available at URL: s10589-011-9437-8
OpenAlex ID: W2060533249
cites work: A geometric analysis of Renegar's condition number, and its interplay with conic curvature
cites work: Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
cites work: Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
cites work: Positivity, sums of squares and the multi-dimensional moment problem
cites work: Global optimization with polynomials and the problem of moments
cites work: A Sum of Squares Approximation of Nonnegative Polynomials
cites work: SOS approximations of nonnegative polynomials via simple high degree perturbations
cites work: Q3601990
cites work: Semidefinite programming relaxations for semialgebraic problems
cites work: Linear programming, complexity theory and elementary functional analysis
cites work: Optimization of Polynomials on Compact Semialgebraic Sets
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
cites work: Facial reduction algorithms for conic optimization problems
DOI: 10.1007/S10589-011-9437-8
Recommended article: Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
Recommended article: An Interior-Point Method for Semidefinite Programming
Recommended article: Q5422884
Recommended article: A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
Recommended article: A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization
Recommended article: Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
Recommended article: Interior-point algorithms for semidefinite programming based on a nonlinear formulation
Recommended article: Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming
Recommended article: On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence
Recommended article: Q4324980
description: scientific article; zbMATH DE number 6137008