Generalized -quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
From MaRDI portal
Publication:965046
DOI10.1016/J.NA.2010.02.012zbMATH Open1211.90211OpenAlexW2072307957MaRDI QIDQ965046FDOQ965046
Authors: Rubén López, C. Gutiérrez, V. Novo 
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
Recommendations
- scientific article; zbMATH DE number 5951407
- A sufficient condition for \( (\varepsilon ,\bar \varepsilon)\)-approximate quasi properly solutions of multiobjective optimization problems
- Generalized \({\varepsilon }\)-quasi solutions of set optimization problems
- Optimality conditions and duality theorems for \(\varepsilon\)-quasi weakly efficient solutions in semi-convex multi-objective optimization problems
- The optimality conditions of approximate solutions for quasiconvex multiobjective optimization problem
- ε-approximate solutions in multiobjective optimization
- Some characterization of \(\varepsilon\)-approximate solutions for multiobjective programming problems
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- Further results on quasi efficient solutions in multiobjective optimization
- Nonlinear scalarizations for \((\varepsilon, \bar{\varepsilon})\)-approximate quasi solutions of multiobjective optimization problems
Clarke's derivativeasymptotic analysismultiobjective optimizationnonsmooth analysisoptimality conditionsEkeland's variational principleexistence theorems\(\varepsilon \)-efficiency
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Cites Work
- Variational Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of multiobjective optimization
- Variational methods in partially ordered spaces
- On the variational principle
- Title not available (Why is that?)
- \(\epsilon\)-solutions in vector minimization problems
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- Vector optimization. Set-valued and variational analysis.
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Title not available (Why is that?)
- Two Types of Approximate Saddle Points
- A Set-Valued Ekeland's Variational Principle in Vector Optimization
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
- Necessary Suboptimality and Optimality Conditions via Variational Principles
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Ekeland's variational principle in Fréchet spaces and the density of extremal points
- Variational principles for set-valued mappings with applications to multiobjective optimization
- A generalized Ekeland vector variational principle and its applications in optimization
- An extension of Ekeland's variational principle to locally complete spaces
- Proper efficiency with respect to cones
- Stability Results for Ekeland's ε-Variational Principle and Cone Extremal Solutions
- Title not available (Why is that?)
- On the set of weakly efficient minimizers for convex multiobjective programming
- Necessary conditions for ε-optimality
- Semi-continuous mappings in general topology
- A nonconvex vector minimization problem
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- Conjugate maps and duality in multiobjective optimization
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- Title not available (Why is that?)
- Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces
- On several concepts for \(\varepsilon\)-efficiency
- Ideal, weakly efficient solutions for vector optimization problems
- On the existence and stability of approximate solutions of perturbed vector equilibrium problems
- On approximate efficiency in multiobjective programming
- Approximation in multiobjective optimization
- Characterizations of efficient points in convex vector optimization problems
- Geometrical characterization of weakly efficient points
Cited In (33)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
- On approximate solutions in multiobjective optimization
- Approximate solutions of multiobjective optimization problems
- Optimality conditions for quasi-solutions of vector optimization problems
- Further results on quasi efficient solutions in multiobjective optimization
- Equivalent \(\varepsilon\)-efficiency notions in vector optimization
- Generalized \({\varepsilon }\)-quasi solutions of set optimization problems
- Approximations of optimization-related problems in terms of variational convergence
- The existence of \(\varepsilon\)-solutions to general quasiequilibrium problems
- Some properties of generalized oriented distance function and their applications to set optimization problems
- Optimality conditions for approximate solutions in multiobjective optimization problems
- Pointwise well-posedness in set optimization with cone proper sets
- A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization
- Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity
- On Hadamard well-posedness of families of Pareto optimization problems
- Directional and approximate efficiency in set optimization
- Properties of the nonlinear scalar functional and its applications to vector optimization problems
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- Existence and boundedness of solutions in infinite-dimensional vector optimization problems
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
- Approximate solutions for robust multiobjective optimization programming in Asplund spaces
- Optimality conditions for quasi proper solutions in multiobjective optimization with a polyhedral cone
- Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
- Variational convergence for vector-valued functions and its applications to convex multiobjective optimization
- On solving parametric multiobjective quadratic programs with parameters in general locations
- Approximate optimality conditions for nonsmooth optimization problems
- Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
- Title not available (Why is that?)
- On approximate optimality conditions for robust multi-objective convex optimization problems
- Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems
This page was built for publication: Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965046)
