Set optimization using improvement sets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 755708 (Why is no real title available?)
- scientific article; zbMATH DE number 1377943 (Why is no real title available?)
- scientific article; zbMATH DE number 3307201 (Why is no real title available?)
- A unified stability result with perturbations in vector optimization
- Existence of optimal points via improvement sets
- Existence theorems of set optimization with set-valued maps
- Improvement sets and convergence of optimal points
- Nonconvex scalarization in set optimization with set-valued maps
- On approximate solutions in set-valued optimization problems
- On optimization problems with set-valued objective maps: existence and optimality
- On scalarization of vector optimization type problems
- On set-valued optimization.
- On solutions of set-valued optimization problems
- Optimality conditions for a unified vector optimization problem with not necessarily preordering relations
- Optimality conditions for set-valued optimization problems
- Set-valued optimization. An introduction with applications
- Some properties of approximate solutions for vector optimization problem with set-valued functions
- Stability and scalarization in vector optimization using improvement sets
- Strict efficiency in set-valued optimization
- Variational Analysis
- Vector optimization problems via improvement sets
- Weak E-optimal solution in vector optimization
- \(E\)-Benson proper efficiency in vector optimization
- \(e\)-proper saddle points and \(e\)-proper duality in vector optimization with set-valued maps
Cited in
(20)- Solving set optimization problems based on the concept of null set
- Optimality and stability conditions for Benson efficient solutions in vector optimization problems
- Second-order optimality conditions for set optimization using coradiant sets
- Set relations and weak minimal solutions for nonconvex set optimization problems with applications
- Painlevé-Kuratowski convergence of minimal solutions for set-valued optimization problems via improvement sets
- An improvement algorithm based on local approximation of the attainable set.
- The stability of minimal solution sets for set optimization problems via improvement sets
- Stability of optimal points with respect to improvement sets
- Generalized minimality in set optimization
- Scalarization and well-posedness for set optimization using coradiant sets
- A unified minimal solution in set optimization
- Improvement sets and vector optimization
- Solution stability and well-posedness for classes of parametric set optimization problems
- On the stability of minimal solutions for parametric set optimization problems
- Existence and convergence of optimal points with respect to improvement sets
- Scalarization and well-posedness for set optimization problems involving general set less relations
- The inf-translation for solving set minimization problems
- Painlevé-Kuratowski stability of approximate solution sets for perturbed set optimization problems under general ordering sets by recession cone
- Globally proper efficiency of set optimization problems based on the certainly set less order relation
- The stability of the solution sets for set optimization problems via improvement sets
This page was built for publication: Set optimization using improvement sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987687)