Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
From MaRDI portal
Publication:1935573
DOI10.1007/s10589-011-9437-8zbMath1264.90162OpenAlexW2060533249MaRDI QIDQ1935573
Masakazu Muramatsu, Maho Nakata, Hayato Waki
Publication date: 18 February 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-011-9437-8
Related Items (24)
CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization ⋮ Facial reduction algorithms for conic optimization problems ⋮ How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization ⋮ A facial reduction algorithm for finding sparse SOS representations ⋮ A paradox in bosonic energy computations via semidefinite programming relaxations ⋮ Numerical algebraic geometry and semidefinite programming ⋮ Validating numerical semidefinite programming solvers for polynomial invariants ⋮ Perturbation analysis of singular semidefinite programs and its applications to control problems ⋮ Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone ⋮ Douglas-Rachford splitting and ADMM for pathological convex optimization ⋮ Strong duality in lasserre's hierarchy for polynomial optimization ⋮ Latest Developments in the SDPA Family for Solving Large-Scale SDPs ⋮ Complexity, exactness, and rationality in polynomial optimization ⋮ Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs ⋮ Perturbed sums-of-squares theorem for polynomial optimization and its applications ⋮ Complexity, exactness, and rationality in polynomial optimization ⋮ Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization ⋮ In SDP Relaxations, Inaccurate Solvers Do Robust Optimization ⋮ A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs ⋮ Bounds on heat transport for convection driven by internal heating ⋮ Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs ⋮ Solving SDP completely with an interior point oracle ⋮ Error Bounds and Singularity Degree in Semidefinite Programming ⋮ Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
Uses Software
Cites Work
- Unnamed Item
- Facial reduction algorithms for conic optimization problems
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- A geometric analysis of Renegar's condition number, and its interplay with conic curvature
- Semidefinite programming relaxations for semialgebraic problems
- Linear programming, complexity theory and elementary functional analysis
- Global Optimization with Polynomials and the Problem of Moments
- Positivity, sums of squares and the multi-dimensional moment problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- Optimization of Polynomials on Compact Semialgebraic Sets
- A Sum of Squares Approximation of Nonnegative Polynomials
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
This page was built for publication: Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
