Pages that link to "Item:Q1814795"
From MaRDI portal
The following pages link to On finite termination of an iterative method for linear complementarity problems (Q1814795):
Displaying 25 items.
- Finite termination of a Newton-type algorithm for a class of affine variational inequality problems (Q613275) (← links)
- Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem (Q670858) (← links)
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix (Q715065) (← links)
- Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem (Q1021504) (← links)
- A continuation method for (strongly) monotone variational inequalities (Q1290602) (← links)
- Solving box constrained variational inequalities by using the natural residual with D-gap function globalization (Q1306473) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- A new approach to continuation methods for complementarity problems with uniform \(P\)-functions (Q1376327) (← links)
- On the minimum norm solution of linear programs (Q1411463) (← links)
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function (Q1411490) (← links)
- New projection-type methods for monotone LCP with finite termination (Q1614999) (← links)
- 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) (← links)
- A generalized Newton method for a class of discrete-time linear complementarity systems (Q2184087) (← links)
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope (Q2288199) (← links)
- Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation (Q2385542) (← links)
- On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities (Q2463794) (← links)
- A note on finite termination of iterative algorithms in mathematical programming (Q2517801) (← links)
- Inexact semismooth Newton methods for large-scale complementarity problems (Q4657815) (← links)
- Global convergence and finite termination of a class of smooth penalty function algorithms (Q4924100) (← links)
- Finiteness of Criss-Cross Method in Complementarity Problem (Q5114998) (← links)
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming (Q5124003) (← links)
- An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation (Q5232118) (← links)
- (Q5389778) (← links)
- (Q5462173) (← links)
- A nonsmooth Newton method for solving the generalized complementarity problem (Q6181145) (← links)
