Name
Title | ||
|---|---|---|
Polynomial Vector Variational Inequalities under Polynomial Constraints and Applications. |
Abstract | ||
|---|---|---|
By using a scalarization method and some properties of semi-algebraic sets, we prove that both the proper Pareto solution set and the weak Pareto solution set of a vector variational inequality, where the convex constraint set is given by polynomial functions and all the components of the basic operators are polynomial functions, have finitely many connected components, provided that the Mangasarian-Fromovitz constraint qualification is satisfied at every point of the constraint set. In addition, if the proper Pareto solution set is dense in the Pareto solution set, then the latter also has finitely many connected components. Consequences of the results for vector optimization problems are discussed in detail. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1137/15M1041134 | SIAM JOURNAL ON OPTIMIZATION |
Keywords | Field | DocType |
polynomial vector variational inequality,solution set,connectedness structure,scalarization,semi-algebraic set | Discrete mathematics,Mathematical optimization,Polynomial,Vector optimization,Regular polygon,Operator (computer programming),Solution set,Connected component,Matrix polynomial,Mathematics,Variational inequality | Journal |
Volume | Issue | ISSN |
26 | 2 | 1052-6234 |
Citations | PageRank | References |
5 | 0.98 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| N. T. T. Huong | 1 | 5 | 1.65 |
| Jen-chih Yao | 2 | 504 | 100.09 |
| Nguyen Dong Yen | 3 | 49 | 5.79 |