Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
DOI10.1016/j.na.2010.02.012zbMath1211.90211OpenAlexW2072307957MaRDI QIDQ965046
Rubén López, Vicente Novo Sanjurjo, César Gutiérrez
Publication date: 21 April 2010
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/144400
nonsmooth analysisexistence theoremsoptimality conditionsmultiobjective optimizationasymptotic analysisEkeland's variational principleClarke's derivative\(\varepsilon \)-efficiency
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Related Items (26)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalized Ekeland vector variational principle and its applications in optimization
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- On approximate efficiency in multiobjective programming
- An extension of Ekeland's variational principle to locally complete spaces
- On the set of weakly efficient minimizers for convex multiobjective programming
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces
- \(\epsilon\)-solutions in vector minimization problems
- Theory of multiobjective optimization
- Conjugate maps and duality in multiobjective optimization
- Proper efficiency with respect to cones
- Semi-continuous mappings in general topology
- Approximation in multiobjective optimization
- On several concepts for \(\varepsilon\)-efficiency
- Ideal, weakly efficient solutions for vector optimization problems
- Characterizations of efficient points in convex vector optimization problems
- Variational methods in partially ordered spaces
- On the variational principle
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- On the existence and stability of approximate solutions of perturbed vector equilibrium problems
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- Vector optimization. Set-valued and variational analysis.
- Geometrical characterization of weakly efficient points
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Two Types of Approximate Saddle Points
- A Set-Valued Ekeland's Variational Principle in Vector Optimization
- Necessary conditions for ε-optimality
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Variational Analysis
- OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
- Ekeland's variational principle in Fréchet spaces and the density of extremal points
- Stability Results for Ekeland's ε-Variational Principle and Cone Extremal Solutions
- A nonconvex vector minimization problem
- Necessary Suboptimality and Optimality Conditions via Variational Principles
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
This page was built for publication: Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions