Exceptional family and solvability of copositive complementarity problems
From MaRDI portal
Publication:662097
DOI10.1016/j.jmaa.2011.10.028zbMath1233.90262MaRDI QIDQ662097
Zi-Sheng Ouyang, Zhong-Mei Wang, Qing-Jie Hu
Publication date: 11 February 2012
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2011.10.028
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Exceptional family and solvability of the second-order cone complementarity problems, Solvability of implicit semidefinite and implicit copositive complementarity problems, A sufficient condition that has no exceptional family of elements for SDCP
Cites Work
- Unnamed Item
- Unnamed Item
- Copositive optimization -- recent developments and applications
- A solution condition for complementarity problems: With an application to spatial price equilibrium
- Merit functions for semi-definite complementarity problems
- Exceptional families and existence theorems for variational inequality problems
- Exceptional family of elements for a variational inequality problem and its applications
- Exceptional families, topological degree and complementarity problems
- Non-interior continuation methods for solving semidefinite complementarity problems
- Existence theorems of solution to variational inequality problems
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Exceptional families of elements for continuous functions: Some applications to complementarity theory
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Solvability of semidefinite complementarity problems
- Application of topological degree theory to semi-definite complementarity problem
- A Variational Approach to Copositive Matrices
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- A Copositive Programming Approach to Graph Partitioning
- Coercivity Conditions in Nonlinear Complementarity Problems
- On copositive programming and standard quadratic optimization problems
