Necessary optimality conditions and saddle points for approximate optimization in Banach space
From MaRDI portal
Publication:2568603
DOI10.1007/BF02578991zbMath1139.90429OpenAlexW2061942560MaRDI QIDQ2568603
Publication date: 18 October 2005
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02578991
Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48)
Related Items (23)
Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity ⋮ On quasi \(\epsilon\)-solution for robust convex optimization problems ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ Further results on quasi efficient solutions in multiobjective optimization ⋮ Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones ⋮ Two Types of Approximate Saddle Points ⋮ Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications ⋮ Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs ⋮ Unnamed Item ⋮ 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 ⋮ 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 ⋮ Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints ⋮ 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 ⋮ Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications ⋮ Generalized \({\varepsilon }\)-quasi solutions of set optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex functions, monotone operators and differentiability.
- Generalized differential calculus for nonsmooth and set-valued mappings
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Optimization and nonsmooth analysis
- Necessary conditions for ε-optimality
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- ∊-gradients pour les ponctions localements lipschitziennes et applications
- Variational Analysis
- Penalty functions in ε-programming and ε-minimax problems
- Necessary Suboptimality and Optimality Conditions via Variational Principles
- Nonsmooth sequential analysis in Asplund spaces
- Approximate optimal solutions and nonlinear Lagrangian functions.
This page was built for publication: Necessary optimality conditions and saddle points for approximate optimization in Banach space
