Unified approaches for solvable and unsolvable linear complementarity problems

DOI10.1016/j.ejor.2003.06.014zbMath1113.90157OpenAlexW2010355849MaRDI QIDQ1876138

Michael M. Kostreva, Xiao Qi Yang

Publication date: 16 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.06.014

zbMATH Keywords

Quadratic programmingMinimax optimizationLinear complementarity problemMulticriteria optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Equivalence of vertical block linear complementarity problems and multi-objective programming problems, An RLT approach for solving the binary-constrained mixed linear complementarity problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality conditions for non-finite valued convex composite functions
• Linear complementarity problems and multiple objective programming
• Theory of multiobjective optimization
• Second-order global optimality conditions for convex composite optimization
• First and second-order optimality conditions for convex composite multiobjective optimization
• Multiple-objective approximation of feasible but unsolvable linear complementarity problems
• Convex composite minimization with \(C^{1,1}\) functions
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• Variational principles for variational inequalities
• Composite Nonsmooth Programming with Gâteaux Differentiability
• On solving linear complementarity problems as linear programs