A feasible decomposition method for constrained equations and its application to complementarity problems

DOI10.1007/s10255-011-0090-xzbMath1302.90227OpenAlexW2022584839MaRDI QIDQ475708

Chang-He Liu, Xiang-Li Li, Hong-Wei Liu

Publication date: 27 November 2014

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-011-0090-x

zbMATH Keywords

convex quadratic programmingfeasible decomposition methodnonnegative constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15)

Cites Work

• Unnamed Item
• A convergent decomposition method for box-constrained optimization problems
• A power penalty method for linear complementarity problems
• A family of NCP functions and a descent method for the nonlinear complementarity problem
• Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
• A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
• An interior-point affine-scaling trust-region method for semismooth equations with box constraints
• On Smoothing Methods for the P₀ Matrix Linear Complementarity Problem
• Smooth Approximations to Nonlinear Complementarity Problems
• An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
• Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods
• Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems

This page was built for publication: A feasible decomposition method for constrained equations and its application to complementarity problems