Pages that link to "Item:Q687037"

The following pages link to A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037):

Displaying 8 items.

• A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
• On the big \({\mathcal M}\) in the affine scaling algorithm (Q1321664) (← links)
• Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
• A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems (Q1913863) (← links)
• Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
• An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
• An interior point method for general large-scale quadratic programming problems (Q1915920) (← links)
• Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)