Nonconvex separation theorems and some applications in vector optimization
From MaRDI portal
Publication:584070
DOI10.1007/BF00940478zbMath0692.90063MaRDI QIDQ584070
Publication date: 1990
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
vector optimizationseparation theoremslinear topological spaceweakly efficient pointsproperly efficient points
Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48) Duality theory for topological vector spaces (46A20)
Related Items (only showing first 100 items - show all)
Stability results for approximately efficient solutions ⋮ On Ha's version of set-valued Ekeland's variational principle ⋮ On generalized quasi-vector equilibrium problems via scalarization method ⋮ New vectorial versions of Takahashi's nonconvex minimization problem ⋮ Higher-order generalized Studniarski epiderivative and its applications in set-valued optimization ⋮ The Lipschitzianity of convex vector and set-valued functions ⋮ On the ordinal structure of the weighted set relation ⋮ A generalized Ekeland vector variational principle and its applications in optimization ⋮ Some properties of generalized oriented distance function and their applications to set optimization problems ⋮ Generalized well-posedness for symmetric vector quasi-equilibrium problems ⋮ Variational analysis in cone pseudo-quasimetric spaces and applications to group dynamics ⋮ A new maximal point theorem ⋮ A note on cone metric fixed point theory and its equivalence ⋮ Nuclear and full nuclear cones in product spaces: Pareto efficiency and an Ekeland type variational principle ⋮ Relationships between the oriented distance functional and a nonlinear separation functional ⋮ Nonconvex scalarization in set optimization with set-valued maps ⋮ Lagrangian conditions for vector optimization in Banach spaces ⋮ A note on vector network equilibrium principles ⋮ On approximate solutions in vector optimization problems via scalarization ⋮ New scalarizing approach to the stability analysis in parametric generalized Ky Fan inequality problems ⋮ On Ekeland's variational principle for set-valued mappings ⋮ On variational principles, level sets, well-posedness, and \(\epsilon\)-solutions in vector optimization ⋮ 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 ⋮ Existence of solutions for generalized vector quasi-equilibrium problems by scalarization method 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 ⋮ The generalized Tykhonov well-posedness for system of vector quasi-equilibrium problems ⋮ Radiant separation theorems and minimum-type subdifferentials of calm functions ⋮ New existence theorems for quasi-equilibrium problems and a minimax theorem on complete metric spaces ⋮ Scalarization of Henig properly efficient points in locally convex spaces ⋮ Vectorial form of Ekeland-type variational principle ⋮ Continuity of solution mappings in some parametric non-weak vector Ky Fan inequalities ⋮ Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems ⋮ Pointwise well-posedness and scalarization in set optimization ⋮ Separation functions and optimality conditions in vector optimization ⋮ Scalarization method for Levitin-Polyak well-posedness of vectorial optimization problems ⋮ Generalized minimax inequalities for set-valued mappings ⋮ Minimax theorems for set-valued mappings under cone-convexities ⋮ Pointwise well-posedness in set optimization with cone proper sets ⋮ New nonlinear scalarization functions and applications ⋮ Four types of nonlinear scalarizations and some applications in set optimization ⋮ Nonconvex vector optimization of set-valued mappings. ⋮ Nonlinear versions of a vector maximal principle ⋮ Super efficiency of multicriterion network equilibrium model and vector variational inequality ⋮ On optimization problems with set-valued objective maps: existence and optimality ⋮ Solution existence in bifunction-set optimization ⋮ On subdifferential calculus for set-valued mappings and optimality conditions ⋮ Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization ⋮ The hierarchical minimax inequalities for set-valued mappings ⋮ Lagrange necessary conditions for Pareto minimizers in Asplund spaces and applications ⋮ Scalarization of set-valued optimization problems and variational inequalities in topological vector spaces ⋮ Characterization of approximate solutions of vector optimization problems with a variable order structure ⋮ 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 ⋮ Weak Pareto equilibria for multiobjective constrained games ⋮ Properly optimal elements in vector optimization with variable ordering structures ⋮ A unified characterization of multiobjective robustness via separation ⋮ Separations and optimality of constrained multiobjective optimization via improvement sets ⋮ Gap functions for a system of generalized vector quasi-equilibrium problems with set-valued mappings ⋮ Concepts for approximate solutions of vector optimization problems with variable order structures ⋮ Extremal systems for sets and multifunctions in multiobjective optimization with variable ordering structures ⋮ Optimality conditions and minimax properties in set optimization ⋮ Characterizations of generalized Levitin-Polyak well-posed set optimization problems ⋮ Scalarization and pointwise well-posedness for set optimization problems ⋮ On some nonlinear problems induced by an abstract maximal element principle ⋮ Construction of functions with uniform sublevel sets ⋮ 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 ⋮ A unified approach to uncertain optimization ⋮ Nonlinear scalarizations and some applications in vector optimization ⋮ Some properties of approximate solutions for vector optimization problem with set-valued functions ⋮ Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces ⋮ Ekeland's variational principle for vectorial multivalued mappings in a uniform space ⋮ Pseudo-metric space and fixed point theorem ⋮ Scalarization and optimality conditions for vector equilibrium problems ⋮ Scalarization of Levitin-Polyak well-posedness in vector optimization using weak efficiency ⋮ Scalarization in set optimization with solid and nonsolid ordering cones ⋮ Convergence results for weak efficiency in vector optimization problems with equilibrium constraints ⋮ 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 ⋮ The influence of proper efficiency on optimal solutions of scalarizing problems in multicriteria optimization ⋮ Optimality conditions for minimizing the difference of nonconvex vector-valued mappings ⋮ Optimality conditions for vector equilibrium problems with constraint in Banach spaces ⋮ Second-order characterizations for set-valued equilibrium problems with variable ordering structures ⋮ Continuity of solution maps to parametric set optimization problems via parametric equilibrium problems ⋮ Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach ⋮ Strong vector equilibrium problems with LSC approximate solution mappings ⋮ Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems ⋮ Image space analysis for uncertain multiobjective optimization problems: robust optimality conditions ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proper efficiency with respect to cones
- The structure of admissible points with respect to cone dominance
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Scalarization in vector optimization
- Complete efficiency and interdependencies between objective functions in vector optimization
- On the characterization of efficient points by means of monotone functionals
- Some duality theorems for the non-linear vector maximum problem
This page was built for publication: Nonconvex separation theorems and some applications in vector optimization