On the numbers of connected components in the solution sets of polynomial vector variational inequalities
From MaRDI portal
Publication:2420770
DOI10.1007/s10957-018-1450-yzbMath1414.90312OpenAlexW2901924265WikidataQ128888476 ScholiaQ128888476MaRDI QIDQ2420770
Publication date: 7 June 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1450-y
semi-algebraic setsolution setnumber of connected componentspolynomial vector optimizationpolynomial vector variational inequality
Multi-objective and goal programming (90C29) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Semialgebraic sets and related spaces (14P10)
Cites Work
- Unnamed Item
- Polynomial Vector Variational Inequalities under Polynomial Constraints and Applications
- Monotone affine vector variational inequalities
- Vector Optimization
- Vector variational inequality as a tool for studying vector optimization problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems