On the gradient-projection method for solving the nonsymmetric linear complementarity problem
From MaRDI portal
Cites work
- Bimatrix Equilibrium Points and Mathematical Programming
- Complementary pivot theory of mathematical programming
- Computational complexity of complementary pivot methods
- scientific article; zbMATH DE number 3741145 (Why is no real title available?)
- scientific article; zbMATH DE number 3393631 (Why is no real title available?)
- Nonlinear Perturbation of Linear Programs
- On the Goldstein-Levitin-Polyak gradient projection method
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
Cited in
(20)- Monotonicity of metric projection onto positive cones of ordered Euclidean spaces
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Iterative methods for a class of complementarity problems
- Two-stage parallel iterative methods for the symmetric linear complementarity problem
- A variable-penalty alternating directions method for convex optimization
- Error bounds and convergence analysis of feasible descent methods: A general approach
- A smooth system of equations approach to complementarity problems for frictionless contacts
- General fixed-point method for solving the linear complementarity problem
- Inexact multisplitting methods for linear complementarity problems
- Global convergence of a modified gradient projection method for convex constrained problems
- A representation of the solution set of a class of linear complementarity problems
- An iterative rank penalty method for nonconvex quadratically constrained quadratic programs
- Convergence properties of nonmonotone spectral projected gradient methods
- Perturbation resilience of proximal gradient algorithm for composite objectives
- Bounded perturbation resilience of projected scaled gradient methods
- Projected fixed point iterative method for large and sparse horizontal linear complementarity problem
- Solving linear variational inequality problems by a self-adaptive projection method
- Two parallel distribution algorithms for convex constrained minimization problems
- Projection methods, isotone projection cones, and the complementarity problem
- Convergence of a projected gradient method variant for quasiconvex objectives
This page was built for publication: On the gradient-projection method for solving the nonsymmetric linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1053618)