Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems
From MaRDI portal
Publication:1945504
DOI10.1007/s10898-012-9846-yzbMath1291.90219OpenAlexW1987389806MaRDI QIDQ1945504
Publication date: 8 April 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9846-y
solution setweakly efficient solutionset-valued optimizationcone convex set-valued mapwell-posedness of optimization problem
Related Items (4)
Convergence of a class of penalty methods for constrained scalar set-valued optimization ⋮ Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ On characterization of solution sets of set-valued pseudoinvex optimization problems ⋮ On set containment characterizations for sets described by set-valued maps with applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Further study on the Levitin-Polyak well-posedness of constrained convex vector optimization problems
- Well-posed optimization problems
- An existence result for maximizations with respect to cones
- Calmness and exact penalization in vector optimization with cone constraints
- Convergence analysis of a class of penalty methods for vector optimization problems with cone constraints
- Characterization of the nonemptiness and compactness of solution sets in convex and nonconvex vector optimization
- Pareto optimality, game theory and equilibria
- Levitin-Polyak well-posedness of constrained vector optimization problems
- Theory of multiobjective optimization
- Existence and Lagrangian duality for maximization of set-valued functions
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- Ideal, weakly efficient solutions for vector optimization problems
- Characterizations of convex and quasiconvex set-valued maps
- Advances in multicriteria analysis
- A survey of recent developments in multiobjective optimization
- Vector optimization. Set-valued and variational analysis.
- Handbook of multicriteria analysis
- Contingent derivatives of set-valued maps and applications to vector optimization
- A Nonlinear Lagrangian Approach to Constrained Optimization Problems
- Combined Primal–Dual and Penalty Methods for Convex Programming
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- An Existence Theorem in Vector Optimization
- Constrained convex optimization problems-well-posedness and stability*
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- The Lagrange Multiplier Rule in Set-Valued Optimization
- Generalized Levitin--Polyak Well-Posedness in Constrained Optimization
- Convex Analysis
- On the stability of the functional optimization problem
- Optimality conditions for maximizations of set-valued functions
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
This page was built for publication: Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems
