Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
From MaRDI portal
Publication:868472
DOI10.1007/s10107-006-0035-yzbMath1278.90447OpenAlexW1996989380MaRDI QIDQ868472
Kim-Chuan Toh, Robert M. Freund, Fernando Ordóñez
Publication date: 5 March 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0035-y
interior-point methodcondition numbersemi-definite programmingdegeneracycomplementaritybehavioral measure
Related Items
Average-case complexity without the black swans, On verified numerical computations in convex programming, Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations, Strong duality and minimal representations for cone optimization, Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization, On the semidefinite representation of real functions applied to symmetric matrices, Generating and measuring instances of hard semidefinite programs, Application of facial reduction to H ∞ state feedback control problem, Preprocessing and Regularization for Degenerate Semidefinite Programs, On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
Uses Software
Cites Work
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems
- Superlinear convergence of interior-point algorithms for semidefinite programming
- Some perturbation theory for linear programming
- Complementarity and nondegeneracy in semidefinite programming
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Complexity of convex optimization using geometry-based measures and a reference point
- Interior-point methods
- Two properties of condition numbers for convex programs via implicitly defined barrier functions
- Linear programming, complexity theory and elementary functional analysis
- Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
- A Characterization of Stability in Linear Programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization
- Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2
- Computation of condition numbers for linear programming problems using Peña’s method
- On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
- Handbook of semidefinite programming. Theory, algorithms, and applications
