Levitin-Polyak well-posedness for set optimization with a variable set structure
From MaRDI portal
Levitin-Polyak well-posednessPainlevé-Kuratowski convergenceset optimizationupper Hausdorff convergencevariable structure
Set-valued and variational analysis (49J53) Sensitivity, stability, well-posedness (49K40) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Optimality conditions and duality in mathematical programming (90C46)
Cites work
- A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
- A generalized scalarization method in set optimization with respect to variable domination structures
- Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
- Characterizations of generalized Levitin-Polyak well-posed set optimization problems
- Characterizations of set relations with respect to variable domination structures via oriented distance function
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Convergence of solutions of a set optimization problem in the image space
- Convergence of the efficient sets
- scientific article; zbMATH DE number 7227247 (Why is no real title available?)
- scientific article; zbMATH DE number 7347557 (Why is no real title available?)
- scientific article; zbMATH DE number 3257595 (Why is no real title available?)
- Image space analysis for set optimization problems with applications
- Levitin-Polyak Well-Posedness for Parametric Set Optimization Problem
- Levitin-Polyak well-posedness for set optimization problems
- Levitin-Polyak well-posedness for set optimization problems involving set order relations
- Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency
- On Levitin-Polyak well-posedness and stability in set optimization
- On the stability of the functional optimization problem
- Optimality conditions for Benson proper efficiency of set-valued equilibrium problems
- Robust multiple objective game theory
- Robustness characterizations for uncertain optimization problems via image space analysis
- Scalarizations and optimality of constrained set-valued optimization using improvement sets and image space analysis
- Set approach for set optimization with variable ordering structures. I: Set relations and relationship to vector approach
- Set-valued analysis
- Set-valued optimization. An introduction with applications
- Six set scalarizations based on the oriented distance: properties and application to set optimization
- Stability and scalarization of weak efficient, efficient and Henig proper efficient sets using generalized quasiconvexities
- Strong metric subregularity of the optimality mapping and second-order sufficient optimality conditions in extremal problems with constraints
- Two Set Scalarizations Based on the Oriented Distance with Variable Ordering Structures: Properties and Application to Set Optimization
- Variable ordering structures in vector optimization
- Vector optimization in medical engineering
- Well-posedness and stability of solutions for set optimization problems
- Well-posedness for set optimization problems
- Well-posedness of set optimization problems with set order defined by Minkowski difference
This page was built for publication: Levitin-Polyak well-posedness for set optimization with a variable set structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7249660)
