The following pages link to (Q5202840):
Displaying 15 items.
- Improving the rate of convergence of interior point methods for linear programming (Q1181911) (← links)
- On the complexity of following the central path of linear programs by linear extrapolation. II (Q1181914) (← links)
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals (Q1205513) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- A simplified global convergence proof of the affine scaling algorithm (Q1312779) (← links)
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
- Limiting behavior of weighted central paths in linear programming (Q1338144) (← links)
- The asymptotic optimal partition and extensions of the nonsubstitution theorem (Q1765893) (← links)
- Examples of ill-behaved central paths in convex optimization (Q1777216) (← links)
- Analyticity of the central path at the boundary point in semidefinite programming (Q1848384) (← links)
- Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights (Q1977257) (← links)
- Superlinear convergence of the affine scaling algorithm (Q2365345) (← links)
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming (Q2368076) (← links)
- Asymptotic behavior of the central path for a special class of degenerate SDP problems (Q2487847) (← links)
- Two simple proofs for analyticity of the central path in linear programming. (Q5937499) (← links)
