An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
From MaRDI portal
Publication:2710387
DOI10.1080/02331930108844524zbMath0966.90081OpenAlexW1971296668MaRDI QIDQ2710387
Publication date: 20 August 2001
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930108844524
Ekeland's variational principlenondifferentiable mathematical programming\(\varepsilon\)-minimal solutions
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (26)
On \(\epsilon\)-solutions for convex optimization problems with uncertainty data ⋮ \(\varepsilon\)-optimality for multiobjective programming on a Banach space ⋮ On approximate efficiency for nonsmooth robust vector optimization problems ⋮ Approximate KKT points and a proximity measure for termination ⋮ On approximate solutions for robust convex semidefinite optimization problems ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS ⋮ Further results on quasi efficient solutions in multiobjective optimization ⋮ Existence and optimality conditions for approximate solutions to vector optimization problems ⋮ Two Types of Approximate Saddle Points ⋮ On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems ⋮ A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization ⋮ An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems ⋮ \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints ⋮ Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions ⋮ \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions ⋮ Unnamed Item ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ Approximate Saddle Point and Duality for Multiobjective n-Set Optimization ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints ⋮ Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data ⋮ Necessary optimality conditions and saddle points for approximate optimization in Banach space ⋮ On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization ⋮ Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems ⋮ On \(\epsilon\)-solutions for robust fractional optimization problems ⋮ Optimality conditions for quasi-solutions of vector optimization problems
Cites Work
This page was built for publication: An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
