A note on the linear complementarity problem involving a subgradient

MaRDI QIDQ806683zbMATH OpenFDO

Authors N. E. Zubov

Publication date 1991

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

convex quadratic programming over coneslinear complementaritynondifferentiable objective functionstrong duality resultsubgradient

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Duality theory (optimization) (49N15) Quadratic programming (90C20) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Review text

The authors generalize some of their previous work about the existence of solutions to linear complementarity problems involving a subgradient. For this purpose some regularity conditions are used. An application is given to convex quadratic programming over cones with a nondifferentiable objective function and a strong duality result is also presented.

Recommendations

• A linear complementarity problem involving a subgradient
• A class of nonlinear complementarity problems for multifunctions
• On the minimum of a class of nondifferentiable functions
• Quadratic programming problems and related linear complementarity problems
• scientific article; zbMATH DE number 617262

Cited in

(2)

• A linear complementarity problem involving a subgradient
• scientific article; zbMATH DE number 617262 (Why is no real title available?)

This page was built for publication: A note on the linear complementarity problem involving a subgradient

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