Pages that link to "Item:Q2858594"
From MaRDI portal
The following pages link to Some results of convex programming complexity (Q2858594):
Displaying 15 items.
- Simpliciality of strongly convex problems (Q821589) (← links)
- Interior-point methods for convex programming (Q1205507) (← links)
- Entropy and Young programs: Relations and self-concordance. (Q1412115) (← links)
- Augmented self-concordant barriers and nonlinear optimization problems with finite complexity (Q1424292) (← links)
- Complexity of convex optimization using geometry-based measures and a reference point (Q1434069) (← links)
- Lower bounds for maximal and convex layers problems (Q1825651) (← links)
- Improving complexity of structured convex optimization problems using self-concordant barriers (Q1848383) (← links)
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems (Q1922691) (← links)
- Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function (Q3051677) (← links)
- Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model (Q3169071) (← links)
- (Q4283695) (← links)
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming (Q4339371) (← links)
- On self-concordant convex–concave functions (Q4504785) (← 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)
