Pages that link to "Item:Q1334952"
From MaRDI portal
The following pages link to Global convergence in infeasible-interior-point algorithms (Q1334952):
Displayed 12 items.
- An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- Inexact interior-point method (Q1384053) (← links)
- Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity (Q1609646) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- Global convergence enhancement of classical linesearch interior point methods for MCPs (Q1861321) (← links)
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
- New infeasible interior-point algorithm based on monomial method (Q1919774) (← links)
- On the Newton interior-point method for nonlinear programming problems (Q1973482) (← links)
- An inexact interior point method for monotone NCP (Q4504782) (← links)
- An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps (Q4709746) (← links)
- A potential-reduction algorithm for linear complementarity problems (Q5697858) (← links)