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

DOI10.1007/S10255-011-0090-XzbMATH Open1302.90227OpenAlexW2022584839MaRDI QIDQ475708FDOQ475708

Authors Changhe Liu, Xiangli Li, Hongwei 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)

Recommendations

• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
• scientific article; zbMATH DE number 5041529
• A kind of QP-free feasible method
• scientific article; zbMATH DE number 1190656
• scientific article; zbMATH DE number 1283896

Cites work

• scientific article; zbMATH DE number 4147426 (Why is no real title available?)
• A convergent decomposition method for box-constrained optimization problems
• A family of NCP functions and a descent method for the nonlinear complementarity problem
• A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
• A power penalty method for linear complementarity problems
• An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
• An interior-point affine-scaling trust-region method for semismooth equations with box constraints
• On smoothing methods for the \(P_{0}\) matrix linear complementarity problem
• Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
• Smooth Approximations to Nonlinear Complementarity Problems
• Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods
• Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization

Cited in

(3)

• scientific article; zbMATH DE number 411827 (Why is no real title available?)
• Solving constrained optimization problems by solution-based decomposition search
• scientific article; zbMATH DE number 5041529 (Why is no real title available?)

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

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