Pages that link to "Item:Q4702342"
From MaRDI portal
The following pages link to Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm (Q4702342):
Displaying 30 items.
- Centers of sets with symmetry or cyclicity properties (Q456947) (← links)
- A condition-based algorithm for solving polyhedral feasibility problems (Q457560) (← links)
- Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization (Q463718) (← links)
- Some preconditioners for systems of linear inequalities (Q476281) (← links)
- Inradius and circumradius of various convex cones arising in applications (Q618877) (← links)
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- Probabilistic analysis of condition numbers for linear programming (Q700762) (← links)
- Conic systems and sublinear mappings: equivalent approaches. (Q703260) (← links)
- Lipschitz and Hölder continuity results for some functions of cones (Q740823) (← links)
- On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems (Q853555) (← links)
- A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
- On properties of different notions of centers for convex cones (Q977073) (← links)
- A geometric analysis of Renegar's condition number, and its interplay with conic curvature (Q1013969) (← links)
- On strata of degenerate polyhedral cones. I: Condition and distance to strata (Q1027575) (← links)
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems (Q1777217) (← links)
- Solidity indices for convex cones (Q1928255) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573) (← links)
- Generating and measuring instances of hard semidefinite programs (Q1960189) (← links)
- The condition number of a function relative to a set (Q2039239) (← links)
- Probabilistic analysis of the Grassmann condition number (Q2340501) (← links)
- On two-stage convex chance constrained problems (Q2466772) (← links)
- Computing the radius of pointedness of a convex cone (Q2467159) (← links)
- Normality and modulability indices. I: Convex cones in normed spaces (Q2473889) (← links)
- On the block-structured distance to non-surjectivity of sublinear mappings (Q2487844) (← links)
- Extreme points of well-posed polytopes (Q3446581) (← links)
- (Q4583053) (← links)
- (Q5110197) (← links)
- The Condition Number of Riemannian Approximation Problems (Q5857299) (← links)
- Sampling rates for \(\ell^1\)-synthesis (Q6142336) (← links)
