On finite termination of an iterative method for linear complementarity problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4147426 (Why is no real title available?)
- scientific article; zbMATH DE number 4082855 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A Newton-type method for positive-semidefinite linear complementarity problems
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- A Nonmonotone Line Search Technique for Newton’s Method
- A nonsmooth version of Newton's method
- A special newton-type optimization method
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Gauss-Newton methods for the complementarity problem
- Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
- Growth behavior of a class of merit functions for the nonlinear complementarity problem
- Newton's Method for B-Differentiable Equations
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- Nonmonotone stabilization methods for nonlinear equations
- Optimization and nonsmooth analysis
- Solving the Nonlinear Complementarity Problem by a Homotopy Method
- Strongly Regular Generalized Equations
Cited in
(30)- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- Newton's method for linear complementarity problems
- New projection-type methods for monotone LCP with finite termination
- A continuation method for (strongly) monotone variational inequalities
- Even more with the Lemke complementarity algorithm
- Error bounds in mathematical programming
- Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
- Standard embedding for linear complementarity problems
- Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation
- scientific article; zbMATH DE number 1559033 (Why is no real title available?)
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- A nonsmooth Newton method for solving the generalized complementarity problem
- Finite termination of a Newton-type algorithm for a class of affine variational inequality problems
- Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix
- An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
- A note on finite termination of iterative algorithms in mathematical programming
- Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- scientific article; zbMATH DE number 716152 (Why is no real title available?)
- Fixed point iterative algorithm for solving LCP
- scientific article; zbMATH DE number 2190115 (Why is no real title available?)
- A generalized Newton method for a class of discrete-time linear complementarity systems
- Finiteness of Criss-Cross Method in Complementarity Problem
- Inexact semismooth Newton methods for large-scale complementarity problems
- On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities
- 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
- A new approach to continuation methods for complementarity problems with uniform P-functions
- Global convergence and finite termination of a class of smooth penalty function algorithms
- On the minimum norm solution of linear programs
This page was built for publication: On finite termination of an iterative method for linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814795)
