Pages that link to "Item:Q1434069"
From MaRDI portal
The following pages link to Complexity of convex optimization using geometry-based measures and a reference point (Q1434069):
Displaying 11 items.
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems (Q853555) (← links)
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems (Q868472) (← links)
- A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
- Largest dual ellipsoids inscribed in dual cones (Q959981) (← links)
- A geometric analysis of Renegar's condition number, and its interplay with conic curvature (Q1013969) (← links)
- New characterizations of Hoffman constants for systems of linear constraints (Q2020601) (← links)
- The condition number of a function relative to a set (Q2039239) (← links)
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 (Q2802544) (← links)
- A Data-Independent Distance to Infeasibility for Linear Conic Systems (Q4959838) (← links)
- Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
