Characterizations of the set less order relation in nonconvex set optimization
From MaRDI portal
Publication:2139270
The author presents solution methods for vector optimization problems in Euclidean spaces and infinite-dimensional spaces. The solution methodology proposed relies on the cases where the cone being used for the partial ordering of the spaces has non-empty interior.
Recommendations
- Vector optimization problems with nonconvex preferences
- Characterization of the nonemptiness and compactness of solution sets in convex and nonconvex vector optimization
- Existence and characteristics of solutions for vector optimization problems
- A result on sets, with applications to vector optimization
- Characterization of the non-emptiness and weak compactness of solution sets of nonconvex vector optimization problems
Cites work
- A derivative-free rooted tree method in nonconvex set optimization
- A vectorization for nonconvex set-valued optimization
- An introduction to a class of matrix cone programming
- Approximate solutions and scalarization in set-valued optimization
- Bishop-Phelps cones in optimization
- Derivatives of Eigenvalues and Eigenvectors of Matrix Functions
- Directional derivative of a minimax function
- Directional derivatives of the maximum function
- First and second order analysis of nonlinear semidefinite programs
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3874989 (Why is no real title available?)
- scientific article; zbMATH DE number 1379525 (Why is no real title available?)
- New order relations in set optimization
- Nonconvex scalarization in set optimization with set-valued maps
- Nonlinear scalarizations of set optimization problems with set orderings
- Nonlinear scalarizing functions in set optimization problems
- On eigenvalues of matrices dependent on a parameter
- Optimality conditions in discrete-continuous nonlinear optimization
- Properties of Bishop-Phelps cones
- Scalarization in set optimization with solid and nonsolid ordering cones
- Scalarizations for a set optimization problem using generalized oriented distance function
- The algebra of many-valued quantities
- Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization
- Vectorization in set optimization
Cited in
(8)- Vector optimization problems with nonconvex preferences
- Geometric properties of a parameterized order relation in vector optimization
- Nonsmooth set variational inequality problems and optimality criteria for set optimization
- A derivative-free rooted tree method in nonconvex set optimization
- Nonlinear Cone Separation Theorems in Real Topological Linear Spaces
- Nonlinear strict cone separation theorems in real normed spaces
- Set-valued Fan-Takahashi inequalities with set-relations based on scalarization methods
- Characterization of set-relations in set optimization via twofold scalar optimization problems
This page was built for publication: Characterizations of the set less order relation in nonconvex set optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139270)
