Pages that link to "Item:Q2316622"
From MaRDI portal
The following pages link to On the existence of Pareto solutions for polynomial vector optimization problems (Q2316622):
Displaying 14 items.
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints (Q778155) (← links)
- Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
- Atypical points at infinity and algorithmic detection of the bifurcation locus of real polynomials (Q2043085) (← links)
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems (Q2046554) (← links)
- Existence of Pareto solutions for vector polynomial optimization problems with constraints (Q2082235) (← links)
- Minimax programming as a tool for studying robust multi-objective optimization problems (Q2108806) (← links)
- Existence of efficient and properly efficient solutions to problems of constrained vector optimization (Q2235148) (← links)
- Efficiency in quasiconvex multiobjective nondifferentiable optimization on the real line (Q5067342) (← links)
- Stability of closedness of semi-algebraic sets under continuous semi-algebraic mappings (Q5086916) (← links)
- An Application of the Tarski-Seidenberg Theorem with Quantifiers to Vector Variational Inequalities (Q5107810) (← links)
- New results on proper efficiency for a class of vector optimization problems (Q5164912) (← links)
- Solvability of a regular polynomial vector optimization problem without convexity (Q5882837) (← links)
- Tangencies and polynomial optimization (Q6038670) (← links)
- A new scheme for approximating the weakly efficient solution set of vector rational optimization problems (Q6109053) (← links)
