Pages that link to "Item:Q1369364"

The following pages link to On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs (Q1369364):

Displaying 9 items.

• Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs (Q1103527) (← links)
• Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems (Q1265014) (← links)
• Superlinear convergence of interior-point algorithms for semidefinite programming (Q1273164) (← links)
• Steplengths in interior-point algorithms of quadratic programming (Q1306349) (← links)
• Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption (Q1970367) (← links)
• Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems (Q3465241) (← links)
• A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization (Q3640925) (← links)
• The BPMPD interior point solver for convex quadratic problems (Q4504788) (← links)
• LOQO:an interior point code for quadratic programming (Q4504789) (← links)