Some results of convex programming complexity
From MaRDI portal
Recommendations
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
- Improving complexity of structured convex optimization problems using self-concordant barriers
- Interior-point methods for convex programming
- A Practical Interior-Point Method for Convex Programming
- scientific article; zbMATH DE number 1047680
Cited in
(16)- Interior-point methods for convex programming
- Entropy and Young programs: Relations and self-concordance.
- Augmented self-concordant barriers and nonlinear optimization problems with finite complexity
- Complexity of convex optimization using geometry-based measures and a reference point
- Lower bounds for maximal and convex layers problems
- Improving complexity of structured convex optimization problems using self-concordant barriers
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
- A polynomial-time interior-point algorithm based on a local self-concordant finite barrier function
- Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
- On the Complexity of a Practical Interior-Point Method
- scientific article; zbMATH DE number 519872 (Why is no real title available?)
- On self-concordant convex–concave functions
- OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS
- On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
- On complexity of the translational-cut algorithm for convex minimax problems
- Simpliciality of strongly convex problems
This page was built for publication: Some results of convex programming complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2858594)
