Pointwise well-posedness in set optimization with cone proper sets

DOI10.1016/j.na.2011.09.028zbMath1237.49024OpenAlexW2035138741MaRDI QIDQ412628

Elena Molho, César Gutiérrez, Enrico Miglierina, Vicente Novo Sanjurjo

Publication date: 4 May 2012

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2011.09.028

zbMATH Keywords

well-posednessscalarizationset optimizationstrict minimizercone proper setGerstewitz's mapquasiconvex set-valued map

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Set-valued and variational analysis (49J53)

Related Items (64)

Well-posedness for the optimistic counterpart of uncertain vector optimization problems ⋮ A New Topological Framework and Its Application to Well-Posedness in Set-Valued Optimization ⋮ On the stability of the solution set mappings to parametric set optimization problems ⋮ Convergence of solutions of a set optimization problem in the image space ⋮ Well-posedness and scalarization in set optimization involving ordering cones with possibly empty interior ⋮ On the solution continuity of parametric set optimization problems ⋮ Generalized \(B\)-well-posedness for set optimization problems ⋮ Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization ⋮ Continuity and convexity of a nonlinear scalarizing function in set optimization problems with applications ⋮ Connectedness of weak minimal solution set for set optimization problems ⋮ Pointwise well-posedness and scalarization of optimization problems for locally convex cone-valued functions ⋮ Convergence of solutions to set optimization problems with the set less order relation ⋮ Pointwise well-posedness and scalarization in set optimization ⋮ On the existence of weak efficient solutions of nonconvex vector optimization problems ⋮ On scalarization and well-posedness in set optimization with a partial set order relation ⋮ Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization ⋮ Conjugate duality in set optimization via nonlinear scalarization ⋮ Approximation of Weak Efficient Solutions in Vector Optimization ⋮ Scalarization of Set-Valued Optimization Problems in Normed Spaces ⋮ On proper minimality in set optimization ⋮ Global well-posedness of set-valued optimization with application to uncertain problems ⋮ On global well-posedness of semi-infinite set optimization problems ⋮ Pointwise well-posedness of a set-valued optimization problem at a weak solution ⋮ Well-posedness and stability of solutions for set optimization problems ⋮ Scalarization of Levitin–Polyak well-posed set optimization problems ⋮ Unnamed Item ⋮ A calculation approach to scalarization for polyhedral sets by means of set relations ⋮ Continuity of the solution set mappings to a parametric set optimization problem ⋮ Pointwise and global well-posedness in set optimization: a direct approach ⋮ Characterizations of generalized Levitin-Polyak well-posed set optimization problems ⋮ Set relations and weak minimal solutions for nonconvex set optimization problems with applications ⋮ Scalarization and pointwise well-posedness for set optimization problems ⋮ Unnamed Item ⋮ Qualitative properties of solutions to set optimization problems ⋮ A set scalarization function based on the oriented distance and relations with other set scalarizations ⋮ Optimality for set-valued optimization in the sense of vector and set criteria ⋮ A generalized scalarization method in set optimization with respect to variable domination structures ⋮ Well-setness and scalarization in set optimization ⋮ Nonlinear scalarization functions and polar cone in set optimization ⋮ Scalarization in set optimization with solid and nonsolid ordering cones ⋮ Weak minimal elements and weak minimal solutions of a nonconvex set-valued optimization problem ⋮ Some properties of nonconvex oriented distance function and applications to vector optimization problems ⋮ Continuity of solutions for parametric set optimization problems via scalarization methods ⋮ Nonlinear Scalarizations of Set Optimization Problems with Set Orderings ⋮ Set Optimization—A Rather Short Introduction ⋮ A Survey of Set Optimization Problems with Set Solutions ⋮ Arcwise connectedness of the solution sets for set optimization problems ⋮ Well-posedness and stability in set optimization with applications ⋮ Six set scalarizations based on the oriented distance: properties and application to set optimization ⋮ Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order ⋮ Characterization of set relations through extensions of the oriented distance ⋮ The stability and extended well-posedness of the solution sets for set optimization problems via the Painlevé-Kuratowski convergence ⋮ Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency ⋮ Scalar characterizations of cone-continuous set-valued maps ⋮ Differential stability properties in convex scalar and vector optimization ⋮ Levitin-Polyak well-posedness for set optimization problems involving set order relations ⋮ Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization ⋮ Nonlinear scalarizing functions in set optimization problems ⋮ Well-posedness for set optimization problems involving set order relations ⋮ Continuity of solution maps to parametric set optimization problems via parametric equilibrium problems ⋮ Continuity of solutions mappings of parametric set optimization problems ⋮ Global Well-Posedness in Set Optimization ⋮ Scalarization and well-posedness for set optimization using coradiant sets ⋮ A note on pointwise well-posedness of set-valued optimization problems

Uses Software

• BENSOLVE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonconvex separation theorems and some applications in vector optimization
• Strict approximate solutions in set-valued optimization with applications to the approximate Ekeland variational principle
• A Brézis-Browder principle on partially ordered spaces and related ordering theorems
• Well-posed optimization problems
• A mountain pass-type theorem for vector-valued functions
• Well-posedness and scalarization in vector optimization
• Nonconvex scalarization in set optimization with set-valued maps
• Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
• Well-posedness for set optimization problems
• Existence and Lagrangian duality for maximization of set-valued functions
• Recession cones and asymptotically compact sets
• Variational methods in partially ordered spaces
• Characterizations of convex and quasiconvex set-valued maps
• The algebra of many-valued quantities
• Some variants of the Ekeland variational principle for a set-valued map
• On set-valued optimization.
• Well-posedness and convexity in vector optimization
• On variational principles, level sets, well-posedness, and \(\epsilon\)-solutions in vector optimization
• Convexity for set-valued maps
• Existence theorems for set optimization problems
• Scalarization for pointwise well-posed vectorial problems
• Vector Optimization with Infimum and Supremum
• Duality for Set-Valued Measures of Risk
• Strict Efficiency in Set-Valued Optimization
• A Set-Valued Ekeland's Variational Principle in Vector Optimization
• On cone convexity of set-valued maps
• Minima of quasi-convex functions

This page was built for publication: Pointwise well-posedness in set optimization with cone proper sets