Nonconvex separation theorems and some applications in vector optimization
From MaRDI portal
Separation theorems for an arbitrary set and a not necessarily convex set in a linear topological space are proved and applied to vector optimization. Scalarization results for weakly efficient points and properly efficient points are deduced.
Recommendations
- Nonconvex separation theorems via assumption B and applications in vector optimization
- New nonlinear separation theorems and applications in vector optimization
- scientific article; zbMATH DE number 3986025
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- A result on sets, with applications to vector optimization
Cites work
- Complete efficiency and interdependencies between objective functions in vector optimization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- scientific article; zbMATH DE number 3820430 (Why is no real title available?)
- scientific article; zbMATH DE number 3896694 (Why is no real title available?)
- scientific article; zbMATH DE number 3926624 (Why is no real title available?)
- scientific article; zbMATH DE number 3932805 (Why is no real title available?)
- scientific article; zbMATH DE number 3986025 (Why is no real title available?)
- scientific article; zbMATH DE number 3987068 (Why is no real title available?)
- scientific article; zbMATH DE number 4029284 (Why is no real title available?)
- scientific article; zbMATH DE number 4035594 (Why is no real title available?)
- scientific article; zbMATH DE number 3741157 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 3560164 (Why is no real title available?)
- On the characterization of efficient points by means of monotone functionals
- Proper efficiency with respect to cones
- Scalarization in vector optimization
- Some duality theorems for the non-linear vector maximum problem
- The structure of admissible points with respect to cone dominance
Cited in
(only showing first 100 items - show all)- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- Stability results for approximately efficient solutions
- Generalized minimax inequalities for set-valued mappings
- Nonconvex vector optimization of set-valued mappings.
- Weak Pareto equilibria for multiobjective constrained games
- The extension theorems of cone linear operators
- Higher-order generalized Studniarski epiderivative and its applications in set-valued optimization
- Relationships between the oriented distance functional and a nonlinear separation functional
- Connectedness of solution sets of strong vector equilibrium problems with an application
- Constrained extremum problems and image space analysis. I: Optimality conditions
- Continuity and convexity of a nonlinear scalarizing function in set optimization problems with applications
- Image space analysis to Lagrange-type duality for constrained vector optimization problems with applications
- Image space analysis for constrained inverse vector variational inequalities via multiobjective optimization
- Radiant separation theorems and minimum-type subdifferentials of calm functions
- Separation functions and optimality conditions in vector optimization
- Solution existence in bifunction-set optimization
- The hierarchical minimax inequalities for set-valued mappings
- Constrained weak Nash-type equilibrium problems
- Well-posedness of multicriteria network equilibrium problem
- Optimality conditions for \(\epsilon\)-vector equilibrium problems
- Notes on Lipschitz properties of nonlinear scalarization functions with applications
- A unified characterization of multiobjective robustness via separation
- Separations and optimality of constrained multiobjective optimization via improvement sets
- Optimality conditions and minimax properties in set optimization
- Characterizations of generalized Levitin-Polyak well-posed set optimization problems
- A unified approach to uncertain optimization
- Convergence results for weak efficiency in vector optimization problems with equilibrium constraints
- The influence of proper efficiency on optimal solutions of scalarizing problems in multicriteria optimization
- Nonconvex separation theorem for multifunctions, subdifferential calculus and applications
- A new maximal point theorem
- On variational principles, level sets, well-posedness, and \(\epsilon\)-solutions in vector optimization
- Scalarization method for Levitin-Polyak well-posedness of vectorial optimization problems
- Minimax theorems for set-valued mappings under cone-convexities
- Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
- Pseudo-metric space and fixed point theorem
- Scalarization of Levitin-Polyak well-posedness in vector optimization using weak efficiency
- Scalarization in set optimization with solid and nonsolid ordering cones
- Some properties of nonconvex oriented distance function and applications to vector optimization problems
- Well-posedness and structural stability on a system of simultaneous generalized vector quasi-equilibrium problems
- Duality in nonconvex vector optimization
- A general branch-and-bound framework for continuous global multiobjective optimization
- Six set scalarizations based on the oriented distance: continuity, convexity and application to convex set optimization
- Second-order characterizations for set-valued equilibrium problems with variable ordering structures
- Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach
- Image space analysis for uncertain multiobjective optimization problems: robust optimality conditions
- On the ordinal structure of the weighted set relation
- Some properties of generalized oriented distance function and their applications to set optimization problems
- Connectedness of solution sets for generalized vector equilibrium problems via free-disposal sets in complete metric space
- Unified vector quasiequilibrium problems via improvement sets and nonlinear scalarization with stability analysis
- Robustness characterizations for uncertain optimization problems via image space analysis
- Necessary conditions for nondominated solutions in vector optimization
- A separation theorem for nonconvex sets and its applications
- Optimality conditions and scalarization of approximate quasi weak efficient solutions for vector equilibrium problem
- A pre-order principle and set-valued Ekeland variational principle
- Improvement sets and vector optimization
- Bilevel minimax theorems for non-continuous set-valued mappings
- Well-posed generalized vector equilibrium problems
- Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior
- Minimum type functions, plus-cogauges, and applications
- Minimax problems under hierarchical structures
- Comparison of some scalarization methods in multiobjective optimization
- Nonlinear separation approach to inverse variational inequalities in real linear spaces
- Separation theorems for nonconvex sets and application in optimization
- Characterization of set relations through extensions of the oriented distance
- Ekeland's variational principle with weighted set order relations
- A new concept of slope for set-valued maps and applications in set optimization studied with Kuroiwa's set approach
- Higher-order weak radial epiderivatives and non-convex set-valued optimization problems
- Scalarization functionals with uniform level sets in set optimization
- A new tool for the investigation of extended real-valued functions
- A unified characterization of nonlinear scalarizing functionals in optimization
- On fixed point theorems for monotone increasing vector valued mappings via scalarizing
- Vectorial form of Ekeland-type variational principle with applications to vector equilibrium problems and fixed point theory
- Vector equilibrium problems with elastic demands and capacity constraints
- Optimality conditions for a unified vector optimization problem with not necessarily preordering relations
- On a new generalized symmetric vector equilibrium problem
- Gerstewitz functionals on linear spaces and functionals with uniform sublevel sets
- A unified minimal solution in set optimization
- An extension of gap functions for a system of vector equilibrium problems with applications to optimization problems
- A general approach for studying duality in multiobjective optimization
- Scalarization for pointwise well-posed vectorial problems
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Equivalents to Ekeland's variational principle in uniform spaces
- Gap functions and existence of solutions to generalized vector quasi-equilibrium problems
- A nonconvex separation property and some applications
- A nonlinear scalarization function and generalized quasi-vector equilibrium problems
- Sequential optimality conditions for multiobjective fractional programming problems
- On the -variational principle for set-valued mappings
- Well-posed symmetric vector quasi-equilibrium problems
- Optimality conditions for quasi-solutions of vector optimization problems
- Arcwise connected cone-quasiconvex set-valued mappings and Pareto reducibility in vector optimization
- Vector optimization with domination structures: variational principles and applications
- Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization
- Asymptotic analysis of scalarization functions and applications
- On Ha's version of set-valued Ekeland's variational principle
- On generalized quasi-vector equilibrium problems via scalarization method
- εVariational inequalities for vector approximation problems
- A new nonlinear scalarization function and applications
- On efficient solutions with trade-offs bounded by given values
- Nonlinear scalarizations of set optimization problems with set orderings
- Set Optimization—A Rather Short Introduction
This page was built for publication: Nonconvex separation theorems and some applications in vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q584070)