Well-posedness of set optimization problems with set order defined by Minkowski difference
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1305858 (Why is no real title available?)
- scientific article; zbMATH DE number 1937278 (Why is no real title available?)
- scientific article; zbMATH DE number 1377943 (Why is no real title available?)
- scientific article; zbMATH DE number 1379525 (Why is no real title available?)
- A new nonlinear scalarization function and applications
- A new topological framework and its application to well-posedness in set-valued optimization
- Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
- Coercivity properties and well-posedness in vector optimization
- Ekeland's variational principle with weighted set order relations
- Extended and strongly extended well-posedness of set-valued optimization problems
- Extended well-posedness properties of vector optimization problems
- Generalized Levitin--Polyak Well-Posedness in Constrained Optimization
- Generalized B-well-posedness for set optimization problems
- Global well-posedness of set-valued optimization with application to uncertain problems
- New order relations in set optimization
- Nonconvex scalarization in set optimization with set-valued maps
- Nonconvex separation theorems and some applications in vector optimization
- On Levitin-Polyak well-posedness and stability in set optimization
- On cone convexity of set-valued maps
- On the stability of the functional optimization problem
- Optimization, Variational Analysis and Applications
- Painlevé-Kuratowski convergence and extended well-posedness for set 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
- Pointwise well-posedness in set optimization with cone proper sets
- Scalarization and pointwise well-posedness for set optimization problems
- Scalarizations for a set optimization problem using generalized oriented distance function
- Set relations and weak minimal solutions for nonconvex set optimization problems with applications
- Set-valued optimization. An introduction with applications
- The stability and extended well-posedness of the solution sets for set optimization problems via the Painlevé-Kuratowski convergence
- Vector variational inequalities and vector optimization. Theory and applications
- Well-posed optimization problems
- Well-posedness and convexity in vector optimization
- Well-posedness and scalarization in set optimization involving ordering cones with possibly empty interior
- Well-posedness for set optimization problems
- Well-posedness for set optimization problems involving set order relations
Cited in
(9)- A decomposition-based evolutionary algorithm with multiple reference points strategy for multiobjective optimization
- External and internal stability for set optimization problems
- Proper subdifferential of set-valued maps and its applications in linear spaces
- Levitin-Polyak well-posedness for set optimization with a variable set structure
- Well-posedness for set optimization problems involving set less relation via scalarization method
- Solution stability and well-posedness for classes of parametric set optimization problems
- Generalized conditional gradient methods for multiobjective composite optimization problems with Hölder condition
- Pascoletti-Serafini scalarizations for approximate quasi efficient solutions for multiobjective optimization problems
- Existence of solutions for set optimization problems with variable ordering structures
This page was built for publication: Well-posedness of set optimization problems with set order defined by Minkowski difference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022494)
