On the gradient-projection method for solving the nonsymmetric linear complementarity problem

DOI10.1007/BF00935004zbMath0517.90083OpenAlexW1966771096MaRDI QIDQ1053618

J. Blot

Publication date: 1984

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00935004

zbMATH Keywords

linear complementarity problemP-matrixnonsymmetric matrixpositive-semidefinite matrixLevitin-Poljak gradient projection method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (20)

General fixed-point method for solving the linear complementarity problem ⋮ Inexact multisplitting methods for linear complementarity problems ⋮ Iterative methods for a class of complementarity problems ⋮ Solving linear variational inequality problems by a self-adaptive projection method ⋮ A smooth system of equations approach to complementarity problems for frictionless contacts ⋮ Two parallel distribution algorithms for convex constrained minimization problems ⋮ Global convergence of a modified gradient projection method for convex constrained problems ⋮ Projection methods, isotone projection cones, and the complementarity problem ⋮ Two-stage parallel iterative methods for the symmetric linear complementarity problem ⋮ Perturbation resilience of proximal gradient algorithm for composite objectives ⋮ Convergence properties of nonmonotone spectral projected gradient methods ⋮ A representation of the solution set of a class of linear complementarity problems ⋮ Convergence of a projected gradient method variant for quasiconvex objectives ⋮ Bounded perturbation resilience of projected scaled gradient methods ⋮ Projected fixed point iterative method for large and sparse horizontal linear complementarity problem ⋮ A variable-penalty alternating directions method for convex optimization ⋮ An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs ⋮ Error bounds and convergence analysis of feasible descent methods: A general approach ⋮ Monotonicity of metric projection onto positive cones of ordered Euclidean spaces ⋮ Linear, quadratic, and bilinear programming approaches to the linear complementarity problem

Cites Work

• Complementary pivot theory of mathematical programming
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• Nonlinear Perturbation of Linear Programs
• On the Goldstein-Levitin-Polyak gradient projection method
• Computational complexity of complementary pivot methods
• Bimatrix Equilibrium Points and Mathematical Programming
• Unnamed Item
• Unnamed Item

This page was built for publication: On the gradient-projection method for solving the nonsymmetric linear complementarity problem