Two Types of Approximate Saddle Points

DOI10.1080/01630560802099274zbMath1209.90350OpenAlexW2154456062MaRDI QIDQ3514738

Aparna Mehra, Deepali Gupta

Publication date: 23 July 2008

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630560802099274

zbMATH Keywords

vector optimizationapproximate saddle pointvector Lagrangianapproximate quasi efficient solutionapproximate quasi saddle point

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)

Related Items (26)

Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency ⋮ Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems ⋮ Vector critical points and generalized quasi-efficient solutions in nonsmooth multi-objective programming ⋮ Optimality conditions for approximate solutions in multiobjective optimization problems ⋮ Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency ⋮ On relations between nonsmooth interval-valued multiobjective programming problems and generalized Stampacchia vector variational inequalities ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ Further results on quasi efficient solutions in multiobjective optimization ⋮ On Minty variational principle for nonsmooth multiobjective optimization problems on Hadamard manifolds ⋮ 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 ⋮ Existence and duality of generalized \(\epsilon\)-vector equilibrium problems ⋮ Optimality conditions for \(\epsilon\)-vector equilibrium problems ⋮ A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization ⋮ Nonlinear separation concerning \(E\)-optimal solution of constrained multi-objective optimization problems ⋮ Duality and gap function for generalized multivalued ϵ-vector variational inequality ⋮ Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators ⋮ Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems ⋮ Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data ⋮ On approximate solutions for nonsmooth robust multiobjective optimization problems ⋮ Generalized \({\varepsilon }\)-quasi solutions of set optimization problems ⋮ Approximate solutions of multiobjective optimization problems ⋮ Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems ⋮ Optimality conditions for quasi-solutions of vector optimization problems

Cites Work

• Unnamed Item
• \(\epsilon\)-solutions in vector minimization problems
• Theory of multiobjective optimization
• Epsilon efficiency
• Lagrange multipliers and saddle points in multiobjective programming
• Approximate saddle-point theorems in vector optimization
• On the variational principle
• \(\varepsilon\)-optimality for multiobjective programming on a Banach space
• \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
• On the vectorial Ekeland's variational principle and minimal points in product spaces
• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
• Necessary optimality conditions and saddle points for approximate optimization in Banach space
• Saddle points and Pareto points in multiple objective programming
• An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces^∗
• ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
• Necessary conditions for ε-optimality
• ε-approximate solutions in multiobjective optimization
• On Approximate Solutions in Convex Vector Optimization
• OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
• Approximately Efficient Solutions in Vector Optimization

This page was built for publication: Two Types of Approximate Saddle Points