Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
From MaRDI portal
Recommendations
- On Levitin-Polyak well-posedness and stability in set optimization
- Levitin-Polyak well-posedness for set optimization problems
- Levitin-Polyak well-posedness for set optimization problems involving set order relations
- Characterizations of generalized Levitin-Polyak well-posed set optimization problems
- Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency
Cites work
- scientific article; zbMATH DE number 7227247 (Why is no real title available?)
- scientific article; zbMATH DE number 3662118 (Why is no real title available?)
- scientific article; zbMATH DE number 597934 (Why is no real title available?)
- scientific article; zbMATH DE number 1380938 (Why is no real title available?)
- A note on semicontinuity of the solution mapping for parametric set optimization problems
- Approximate solutions and scalarization in set-valued optimization
- Approximate solutions of vector optimization problems via improvement sets in real linear spaces
- Characterizations of generalized Levitin-Polyak well-posed set optimization problems
- Characterizations of multiobjective robustness via oriented distance function and image space analysis
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Extended well-posedness of quasiconvex vector optimization problems
- External and internal stability in set optimization
- Generalized B-well-posedness for set optimization problems
- Minimal element theorems and Ekeland's variational principle with new set order relations
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- Partial order relations on family of sets and scalarizations for set optimization
- Pointwise and global well-posedness in set optimization: a direct approach
- Scalarization method for Levitin-Polyak well-posedness of vectorial optimization problems
- Scalarization of Levitin-Polyak well-posedness in vector optimization using weak efficiency
- Scalarizations for a set optimization problem using generalized oriented distance function
- Set Optimization—A Rather Short Introduction
- Set-valued analysis
- Set-valued optimization in welfare economics
- Set-valued optimization. An introduction with applications
- Some duality theorems of set-valued optimization with natural criteria
- Well-posed optimization problems
- Well-posedness and scalarization in set optimization involving ordering cones with possibly empty interior
- Well-posedness for set optimization problems
- \(\epsilon\)-solutions in vector minimization problems
Cited in
(12)- Continuity of the solutions sets for parametric set optimization problems
- Well-posedness of approximation and optimization problems for weakly convex sets and functions
- Solving Optimization Problems over the Weakly Efficient Set
- Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors
- Painlevé-Kuratowski convergence and extended well-posedness for set optimization problems
- An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set
- An unified scalarization and Ekeland's variational principle for partial set order
- Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency
- Levitin-Polyak well-posedness for set optimization problems
- An algorithm to solve polytopic set optimization problem based on a partial set order relation
- Image space analysis for set optimization problems with applications
- Characterizations of multi-objective robustness solutions defined by Minkowski set difference
This page was built for publication: Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q779866)
