Pages that link to "Item:Q2366605"
From MaRDI portal
The following pages link to Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605):
Displaying 12 items.
- Regularization techniques in interior point methods (Q432801) (← links)
- A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- Long-step interior-point algorithms for a class of variational inequalities with monotone operators (Q1264995) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- Primal-dual methods for linear programming (Q1924065) (← links)
- On the convergence of a predictor-corrector variant algorithm (Q2355008) (← links)
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup> (Q2709447) (← links)
- Solving quadratically constrained convex optimization problems with an interior-point method (Q3093053) (← links)
