Pages that link to "Item:Q1848383"

The following pages link to Improving complexity of structured convex optimization problems using self-concordant barriers (Q1848383):

Displaying 8 items.

• Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
• ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems (Q1016355) (← links)
• On the complexity of the primal self-concordant barrier method. (Q1412708) (← links)
• Augmented self-concordant barriers and nonlinear optimization problems with finite complexity (Q1424292) (← links)
• A sufficient condition for self-concordance, with application to some classes of structured convex programming problems (Q1922691) (← links)
• Self-concordant functions for optimization on smooth manifolds (Q2460143) (← links)
• Some results of convex programming complexity (Q2858594) (← links)
• Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function (Q3051677) (← links)