Pages that link to "Item:Q2175368"
From MaRDI portal
The following pages link to A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem (Q2175368):
Displaying 4 items.
- Semismooth and smoothing Newton methods for nonlinear systems with complementarity constraints: adaptivity and inexact resolution (Q2087487) (← links)
- A new approach for solving nonlinear algebraic systems with complementarity conditions. Application to compositional multiphase equilibrium problems (Q2666330) (← links)
- Adaptive inexact smoothing Newton method for a nonconforming discretization of a variational inequality (Q2684163) (← links)
- An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation (Q5232118) (← links)