Complexity of convex optimization using geometry-based measures and a reference point
From MaRDI portal
Recommendations
- Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization
- Some results of convex programming complexity
- Geometric optimization and \(D^ P\)-completeness
- Publication:4732310
- Complexity analysis for certain convex programming problems
- Convex optimization: algorithms and complexity
- scientific article
- A geometric method for a class of convex programs
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- On convex complexity measures
Cited in
(11)- Smoothed analysis of condition numbers and complexity implications for linear programming
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
- Preprocessing and regularization for degenerate semidefinite programs
- On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems
- New characterizations of Hoffman constants for systems of linear constraints
- A geometric analysis of Renegar's condition number, and its interplay with conic curvature
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- A primal-dual symmetric relaxation for homogeneous conic systems
- The condition number of a function relative to a set
- A data-independent distance to infeasibility for linear conic systems
- Largest dual ellipsoids inscribed in dual cones
This page was built for publication: Complexity of convex optimization using geometry-based measures and a reference point
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1434069)
