The following pages link to (Q4347847):
Displaying 15 items.
- Interior-point Lagrangian decomposition method for separable convex optimization (Q846931) (← links)
- On some efficient interior point methods for nonlinear convex programming (Q1174840) (← links)
- Interior-point methods for convex programming (Q1205507) (← links)
- Topics in semidefinite and interior-point methods (Q1386876) (← links)
- On self-concordant barrier functions for conic hulls and fractional programming (Q1814792) (← 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)
- Some results of convex programming complexity (Q2858594) (← links)
- (Q4295584) (← links)
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming (Q4339371) (← links)
- On self-concordant convex–concave functions (Q4504785) (← links)
- (Q4799867) (← links)
- (Q4883369) (← links)
- Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy (Q5067430) (← links)
- Hessian distances and their applications in the complexity analysis of interior-point methods (Q5299911) (← links)
