A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming

DOI10.1007/BF01182323zbMath0767.90086MaRDI QIDQ1188288

Bing-sheng He

Publication date: 13 August 1992

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

zbMATH Keywords

linear complementarityprojectionconvex quadratic programminglarge sparse problemsFéjer-contraction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Some recent advances in projection-type methods for variational inequalities ⋮ Iterative learning control for constrained linear systems ⋮ A class of projection and contraction methods for monotone variational inequalities ⋮ New contraction methods for linear inequalities ⋮ A new method for a class of linear variational inequalities ⋮ A rapid algorithm for a class of linear complementarity problems ⋮ Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities ⋮ General fixed-point method for solving the linear complementarity problem ⋮ A class of iterative methods for solving nonlinear projection equations ⋮ Minisum location problem with farthest Euclidean distances ⋮ Solving linear variational inequality problems by a self-adaptive projection method ⋮ A fast continuous method for the extreme eigenvalue problem ⋮ A new method for a class of nonlinear variational inequalities with fuzzy mappings ⋮ Solving symmetric monotone linear variational inequalities by some modified Levitin-Polyak projection methods ⋮ Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs ⋮ Unnamed Item ⋮ New decomposition methods for solving variational inequality problems. ⋮ Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method ⋮ Decomposition method for a class of monotone variational inequality problems ⋮ A modified alternating direction method for convex minimization problems ⋮ A class of projection and contraction methods for asymmetric linear variational inequalities and their relations to Fukushima's descent method ⋮ Solution of projection problems over polytopes ⋮ The iterative methods for monotone generalized variational inequalities ⋮ A new class of projection and contraction methods for solving variational inequality problems ⋮ A modified descent method for co-coercive variational inequalities ⋮ Local convergence behavior of some projection-type methods for affine variational inequalities ⋮ A class of projection-contraction methods applied to monotone variational inequalities ⋮ A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems ⋮ A new class of iterative algorithms for approximation-solvability of nonlinear variational inequalities ⋮ Projection methods, algorithms, and a new system of nonlinear variational inequalities ⋮ A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs ⋮ Improvements of some projection methods for monotone nonlinear variational inequalities ⋮ A variable metric proximal-descent algorithm for monotone operators ⋮ 3D DDA Based on Variational Inequality Theory and Its Solution Scheme ⋮ Extended projection methods for monotone variational inequalities ⋮ Role of twice Fréchet-differentiable mappings in general auxiliary problem principle ⋮ Solving a class of asymmetric variational inequalities by a new alternating direction method ⋮ Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities ⋮ A new projection and contraction method for linear variational inequalities ⋮ The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense ⋮ New alternating direction method for a class of nonlinear variational inequality problems ⋮ On a class of iterative projection and contraction methods for linear programming ⋮ A self-adaptive projection and contraction method for monotone symmetric linear variational inequalities. ⋮ Two new self-adaptive projection methods for variational inequality problems ⋮ A new stepsize rule in He and Zhou's alternating direction method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A numerically stable dual method for solving strictly convex quadratic programs
• A new polynomial-time algorithm for linear programming
• A projected Newton method for minimization problems with nonlinear inequality constraints
• A polynomial-time algorithm for a class of linear complementarity problems
• Solution of nonsymmetric, linear complementarity problems by iterative methods
• Solution of symmetric linear complementarity problems by iterative methods
• On the convergence of projected gradient processes to singular critical points
• Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
• Complementary pivot theory of mathematical programming
• The Simplex Method for Quadratic Programming
• Equivalence of some quadratic programming algorithms
• Projected gradient methods for linearly constrained problems
• An equivalence between two algorithms for quadratic programming
• Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
• On the Goldstein-Levitin-Polyak gradient projection method
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Numerically stable methods for quadratic programming
• Inexact Newton methods for the nonlinear complementarity problem
• Numerical methods for finding saddle points
• Bimatrix Equilibrium Points and Mathematical Programming
• Convex programming in Hilbert space
• The method of projections for finding the common point of convex sets
• A General Quadratic Programming Algorithm