Pages that link to "Item:Q1922691"

The following pages link to A sufficient condition for self-concordance, with application to some classes of structured convex programming problems (Q1922691):

Displaying 14 items.

• Conic formulation for \(l_p\)-norm optimization (Q702372) (← links)
• An interior-point method for the single-facility location problem with mixed norms using a conic formulation (Q999133) (← links)
• Long-step interior-point algorithms for a class of variational inequalities with monotone operators (Q1264995) (← links)
• Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
• Optimal ellipsoidal approximations around the analytic center (Q1330921) (← links)
• Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
• A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
• A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications (Q1576348) (← links)
• A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming (Q1769066) (← links)
• Improving complexity of structured convex optimization problems using self-concordant barriers (Q1848383) (← links)
• Efficient algorithms for solving the \(p\)-Laplacian in polynomial time (Q2209522) (← links)
• Efficient formulations for pricing under attraction demand models (Q2248752) (← links)
• Market exchange models and geometric programming (Q2418159) (← links)
• Path-following barrier and penalty methods for linearly constrained problems (Q2709451) (← links)