Duality related to approximate proper solutions of vector optimization problems
DOI10.1007/S10898-015-0366-4zbMATH Open1329.90166OpenAlexW1741289154MaRDI QIDQ905760FDOQ905760
Authors: L. Huerga, Chr. Tammer, C. Gutiérrez, V. Novo 
Publication date: 28 January 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0366-4
Recommendations
- scientific article; zbMATH DE number 3951400
- scientific article; zbMATH DE number 6508503
- The duality on vector optimization problems
- scientific article; zbMATH DE number 3999687
- Some results on dual vector optimization problems
- Approximate duality for vector quasi-equilibrium problems and applications
- Sur la dualité en optimisation vectorielle convexe
- A new approach to duality in vector optimization
- Duality for vector optimization problems via a general scalarization
- Some Remarks on Dualization in Vector Optimization
vector optimizationlinear scalarizationnearly cone-subconvexlikenessapproximate dualityproper \(\epsilon \)-efficiency
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)
Cites Work
- Variational methods in partially ordered spaces
- Title not available (Why is that?)
- Near-subconvexlikeness in vector optimization with set-valued functions
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Vector Optimization
- Title not available (Why is that?)
- 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
- Dual Characterization and Scalarization for Benson Proper Efficiency
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
- Duality in Vector Optimization
- Benson proper efficiency in the vector optimization of set-valued maps
- Approximate saddle-point theorems in vector optimization
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- On duality theory in multiobjective programming
- Duality theory in multiobjective programming
- ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps
- Approximate duality for vector quasi-equilibrium problems and applications
- A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
- On approximate efficiency in multiobjective programming
- Duality in vector optimization
- An analysis of some dual problems in multiobjective optimization (I)
- Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency
- Proper approximate solutions and \(\varepsilon\)-subdifferentials in vector optimization: basic properties and limit behaviour
- Proper approximate solutions and \(\varepsilon\)-subdifferentials in vector optimization: Moreau-Rockafellar type theorems
- Approximation in multiobjective optimization
- (\(\epsilon\)-)efficiency in difference vector optimization
- Duality for vector optimization problems via a general scalarization
Cited In (16)
- Title not available (Why is that?)
- Approximate duality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Duality in vector Padé-Hermite approximation problems
- Title not available (Why is that?)
- Approximate duality for vector quasi-equilibrium problems and applications
- On duality for weakly minimized vector valued optimization problems
- Strict approximate duality in vector spaces
- Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications
- Duality and weak efficiency in vector variational problems
- Duality assertions in vector optimization w.r.t. relatively solid convex cones in real linear spaces
- Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
- Vector optimization w.r.t. relatively solid convex cones in real linear spaces
- Approximate properly solutions of constrained vector optimization with variable coradiant sets
This page was built for publication: Duality related to approximate proper solutions of vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905760)
