Pages that link to "Item:Q1974569"
From MaRDI portal
The following pages link to Complexity analysis for certain convex programming problems (Q1974569):
Displaying 13 items.
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs (Q583119) (← links)
- Simpliciality of strongly convex problems (Q821589) (← links)
- On the complexity of optimization over the standard simplex (Q932197) (← links)
- Unified complexity analysis for Newton LP methods (Q1184332) (← links)
- On the complexity of equalizing inequalities (Q1430175) (← links)
- Complexity of convex optimization using geometry-based measures and a reference point (Q1434069) (← links)
- (Q3161327) (← links)
- Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model (Q3169071) (← links)
- (Q4283695) (← links)
- (Q4386194) (← links)
- Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function (Q4558290) (← links)
- On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System (Q5704144) (← links)
- On complexity of the translational-cut algorithm for convex minimax problems (Q5925720) (← links)