A Finite Algorithm for Almost Linear Complementarity Problems

DOI10.1080/01630560701749714MaRDI QIDQ5438288zbMATH OpenOpenAlexFDO

Authors Zhengyu Wang, Masao Fukushima

Publication date 23 January 2008

Published in Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01630560701749714

zbMATH Keywords

interval analysis\(H\)-matrixactive set identificationalmost linear complementarity problem

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interval and finite arithmetic (65G30)

Recommendations

• A finite improvement algorithm for the linear complementarity problem
• Finite algorithms for the numerical solutions of a class of nonlinear complementarity problems
• A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps
• scientific article; zbMATH DE number 778140
• A polynomial-time algorithm for a class of linear complementarity problems
• A rapid algorithm for a class of linear complementarity problems
• An algorithm for the linear complementarity problem with upper and lower bounds
• PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
• Algorithms for linear programming with linear complementarity constraints
• scientific article; zbMATH DE number 773156

Cites work

• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A Test for Existence of Solutions to Nonlinear Systems
• A regularized projection method for complementarity problems with non-Lipschitzian functions
• A special newton-type optimization method
• Enclosing solutions of linear complementarity problems for H-matrices
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Finite element approximation of a model reaction-diffusion problem with a non-Lipschitz nonlinearity
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Interfaces to PATH 3.0: Design, implementation and usage
• Interval Methods for Systems of Equations
• Interval analysis: Theory and applications
• M-matrix characterizations. I: nonsingular M-matrices
• Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
• The semismooth algorithm for large scale complementarity problems

Cited in

(7)

• Finite algorithms for the numerical solutions of a class of nonlinear complementarity problems
• scientific article; zbMATH DE number 4062853 (Why is no real title available?)
• scientific article; zbMATH DE number 3353068 (Why is no real title available?)
• Components identification based method for box constrained variational inequality problems with almost linear functions
• A projection and contraction algorithm for the free boundary problem
• scientific article; zbMATH DE number 6402146 (Why is no real title available?)
• Quadratic convergence of monotone iterates for semilinear elliptic obstacle problems

Describes a project that uses

Uses Software

• PATH Solver

This page was built for publication: A Finite Algorithm for Almost Linear Complementarity Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5438288)