scientific article; zbMATH DE number 1379225
From MaRDI portal
Publication:4703569
Recommendations
Cited in
(14)- On robustness for set-valued optimization problems
- Characterization of set relations through extensions of the oriented distance
- Global well-posedness of set-valued optimization with application to uncertain problems
- Pointwise well-posedness of a set-valued optimization problem at a weak solution
- Some duality theorems of set-valued optimization with natural criteria
- Set Optimization—A Rather Short Introduction
- A set scalarization function based on the oriented distance and relations with other set scalarizations
- A Minty variational principle for set optimization
- Efficiencies and Pareto efficiencies of set-valued mappings on ordered spaces
- Six set scalarizations based on the oriented distance: properties and application to set optimization
- A unified scheme for scalarization in set optimization
- Karush-Kuhn-Tucker conditions and Lagrangian approach for improving machine learning techniques: a survey and new developments
- Strict efficiency in set optimization studied with the set approach
- A solution method for arbitrary polyhedral convex set optimization problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4703569)