On set-valued complementarity problems

DOI10.1155/2013/105930MaRDI QIDQ1949427zbMATH OpenOpenAlexWikidataFDO

Authors Jein-Shan Chen, Jinchuan Zhou, Gue Myung Lee

Publication date 8 May 2013

Published in Abstract and Applied Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2013/105930

zbMATH Keywords

error boundedlevel boundedmerit functionsset-valued complementarity problems

Mathematics Subject Classification ID

Set-valued and variational analysis (49J53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Review text

Summary: This paper investigates the Set-Valued Complementarity Problems (SVCPs) which pose rather different features from those that classical complementarity problems hold, due to the fact that the index set is not fixed, but dependent on \(x\). While comparing the set-valued complementarity problems with the classical complementarity problems, we analyze the solution set of SVCPs. Moreover, properties of merit functions for SVCPs are studied, such as being level bounded and error bounded. Finally, some possible research directions are discussed.

Recommendations

• Variational inequality and complementarity problem for set-valued mapping with application
• The existence of solutions for set-valued nonlinear complementarity problems
• scientific article; zbMATH DE number 4145684
• Generalized strongly set-valued nonlinear complementarity problems
• Feasibility of set-valued implicit complementarity problems

Cites work

• Computation of error bounds for P-matrix linear complementarity problems
• Error bounds in mathematical programming
• Expected Residual Minimization Method for Stochastic Linear Complementarity Problems
• Extended general variational inequalities
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• scientific article; zbMATH DE number 3848999 (Why is no real title available?)
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 1059222 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• On the extended linear complementarity problem
• Optimization. Algorithms and consistent approximations
• Properties and construction of NCP functions
• Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
• Robust solution of monotone stochastic linear complementarity problems
• Set-valued analysis
• Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
• Solution properties and error bounds for semi-infinite complementarity problems
• Some developments in general variational inequalities
• Some generalizations of positive definiteness and monotonicity
• Stochastic R₀ Matrix Linear Complementarity Problems
• The Extended Linear Complementarity Problem
• Variational Analysis

Cited in

(2)

• Solution properties and error bounds for semi-infinite complementarity problems
• Optimal scheduling for retrieval jobs in double-deep AS/RS by evolutionary algorithms

This page was built for publication: On set-valued complementarity problems

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