Pages that link to "Item:Q1334952"
From MaRDI portal
The following pages link to Global convergence in infeasible-interior-point algorithms (Q1334952):
Displaying 15 items.
- A non-interior implicit smoothing approach to complementarity problems for frictionless contacts (Q646346) (← links)
- 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)
- Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications (Q1736388) (← 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)
- Weakening convergence conditions of a potential reduction method for tensor complementarity problems (Q2086932) (← links)
- Tensor complementarity problems. II: Solution methods (Q2275317) (← links)
- A potential reduction method for tensor complementarity problems (Q2313741) (← links)
- Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones (Q3112509) (← links)
