Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
From MaRDI portal
Publication:764948
DOI10.1016/J.JMAA.2011.12.050zbMATH Open1261.90049OpenAlexW1981805154MaRDI QIDQ764948FDOQ764948
Authors: C. Gutiérrez, L. Huerga, V. Novo 
Publication date: 16 March 2012
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2011.12.050
Recommendations
- On approximate solutions in vector optimization problems via scalarization
- Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization
- Approximate saddle-point theorems in vector optimization
- Scalarization and pointwise well-posedness in vector optimization problems
- Proper saddle points and properly efficient solutions to constrained vector optimization problems
- Linear scalarization for vector optimization problem and characterizations of approximate solutions
- Conic scalarizations for approximate efficient solutions in nonconvex vector optimization problems
- A nonlinear scalarization characterization of \((C, \varepsilon)\)-proper solutions in vector optimization
- A nonlinear scalarization characterization for \(\varepsilon\)-properly efficient solutions in vector optimization
- Scalarization of approximate solution for vector equilibrium problems
Lagrangian functionlinear scalarizationSlater constraint qualificationapproximate proper saddle point theoremnearly subconvexlike mappingproper \(\varepsilon \)-efficiency
Cites Work
- Title not available (Why is that?)
- Near-subconvexlikeness in vector optimization with set-valued functions
- Super efficiency in vector optimization with nearly convexlike set-valued maps.
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Title not available (Why is that?)
- Two Types of Approximate Saddle Points
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- Title not available (Why is that?)
- Optimality conditions for approximate solutions of vector optimization problems
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- e-weak minimal solutions of vector optimization problems with set-valued maps
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- Dual Characterization and Scalarization for Benson Proper Efficiency
- An improved definition of proper efficiency for vector maximization with respect to cones
- Benson proper efficiency in the vector optimization of set-valued maps
- Proper efficiency in vector optimization on real linear spaces.
- Approximate saddle-point theorems in vector optimization
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- On duality theory in multiobjective programming
- Duality theory in multiobjective programming
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- Separable conditions and scalarization of Benson proper efficiency
- Lagrange multipliers and saddle points in multiobjective programming
- Nearly subconvexlike set-valued maps and vector optimization problems
- Vector variational principles; \(\varepsilon\)-efficiency and scalar stationarity
- On approximate efficiency in multiobjective programming
- Duality theory for maximizations with respect to cones
- Approximate duality
- Approximate saddle point assertions for a general class of approximation problems
- Duality and saddle-points for convex-like vector optimization problems on real linear spaces
Cited In (20)
- Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
- A kind of unified proper efficiency in vector optimization
- Approximate saddle point assertions for a general class of approximation problems
- Characterizations of improvement sets via quasi interior and applications in vector optimization
- Duality related to approximate proper solutions of vector optimization problems
- Approximate proper efficiency for multiobjective optimization problems
- Approximate saddle-point theorems in vector optimization
- Limit behavior of approximate proper solutions in vector optimization
- Ekeland variational principles involving set perturbations in vector equilibrium problems
- Approximate proper solutions in vector equilibrium problems. Limit behavior and linear scalarization results
- Nearly subconvexlike set-valued maps and vector optimization problems
- Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications
- Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems
- Chain rules for a proper \(\varepsilon\)-subdifferential of vector mappings
- Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
- Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization
- \((C, \varepsilon)\)-super subdifferentials of set-valued maps and optimality conditions for set-valued optimization problems
- Nonlinear scalarization in multiobjective optimization with a polyhedral ordering cone
- Approximate proper efficiency in vector optimization
- Approximate solutions of vector optimization problems via improvement sets in real linear spaces
This page was built for publication: Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764948)
