On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems

DOI10.1007/S10589-005-3911-0MaRDI QIDQ853555zbMATH OpenOpenAlexFDO

Authors Zhi Cai, Robert M. Freund

Publication date 17 November 2006

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/5540

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
• Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
• On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
• A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems
• Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm

Cites work

• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Complexity of convex optimization using geometry-based measures and a reference point
• Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
• Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
• Linear programming, complexity theory and elementary functional analysis
• On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
• On the behavior of the homogeneous self-dual model for conic convex optimization
• Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
• Some perturbation theory for linear programming
• Two properties of condition numbers for convex programs via implicitly defined barrier functions
• Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(3)

• On the behavior of the homogeneous self-dual model for conic convex optimization
• Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
• Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems

Describes a project that uses

Uses Software

• SeDuMi

This page was built for publication: On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853555)