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

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

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

• 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
• Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
• An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
• A power penalty method for linear complementarity problems
• Title not available (Why is that?)
• On smoothing methods for the \(P_{0}\) matrix linear complementarity problem
• Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods
• Smooth Approximations to Nonlinear Complementarity Problems
• A convergent decomposition method for box-constrained optimization problems
• An interior-point affine-scaling trust-region method for semismooth equations with box constraints
• Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems

Cited In (3)

• Solving constrained optimization problems by solution-based decomposition search
• Title not available (Why is that?)
• Title not available (Why is that?)

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)