Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- 28 September 2011
- journal article
- Published by Springer Science and Business Media LLC in Computational Optimization and Applications
- Vol. 53 (3), 823-844
- https://doi.org/10.1007/s10589-011-9437-8
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- GloptiPoly 3: moments, optimization and semidefinite programmingOptimization Methods and Software, 2009
- Variational calculation of second-order reduced density matrices by strong N-representability conditions and an accurate semidefinite programming solverThe Journal of Chemical Physics, 2008
- A geometric analysis of Renegar’s condition number, and its interplay with conic curvatureMathematical Programming, 2008
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problemsMathematical Programming, 2006
- Optimization of Univariate Functions on Bounded Intervals by Interpolation and Semidefinite ProgrammingSSRN Electronic Journal, 2006
- Optimization of Polynomials on Compact Semialgebraic SetsSIAM Journal on Optimization, 2005
- Semidefinite programming relaxations for semialgebraic problemsMathematical Programming, 2003
- Global Optimization with Polynomials and the Problem of MomentsSIAM Journal on Optimization, 2001
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid AlgorithmSIAM Journal on Optimization, 1999
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999