Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
From MaRDI portal
Publication:4714542
DOI10.1080/01630569608816697zbMath0858.90110OpenAlexW2072455710MaRDI QIDQ4714542
Vaithilingam Jeyakumar, Alberto Zaffaroni
Publication date: 23 March 1997
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569608816697
subdifferentialsepigraphs of conjugate functionsinfinite-dimensional vector convex programmingnecessary and sufficient dual conditionsweak and proper minimality
Related Items (13)
Optimality theorems for convex semidefinite vector optimization problems ⋮ Optimality conditions for Pareto nonsmooth nonconvex programming in Banach spaces ⋮ Pareto-Fenchel ε-Subdifferential Composition Rule and ε-Efficiency ⋮ Some vector optimization problems in Banach spaces with generalized convexity ⋮ An alternative formulation for a new closed cone constraint qualification ⋮ Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces ⋮ Multiobjective programming under generalized type I invexity ⋮ Sequential Lagrangian conditions for convex programs with applications to semidefinite programming ⋮ Characterizations of solution sets of convex vector minimization problems ⋮ A Global Approach to Nonlinearly Constrained Best Approximation ⋮ Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under \((\varPhi, \rho)\)-invexity ⋮ Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proper efficiency with respect to cones
- Subdifferentials of compactly Lipschitzian vector-valued functions
- Generalizations of Slater's constraint qualification for infinite convex programs
- On systems of convex inequalities
- A new version of Farkas' lemma and global convex maximization
- On the notion of proper efficiency in vector optimization
- A saddle-point characterization of Pareto optima
- Necessary and Sufficient Conditions for a Local Minimum. 2: Conditions of Levitin–Miljutin–Osmolovskii Type
- Results of farkas type
- Nonlinear alternative theorems and nondifferentiable programming
- Characterization of weakly efficient points
- A generalized Farkas lemma with applications to quasidifferentiable programming
- Two Generalizations of a Theorem of Arrow, Barankin, and Blackwell
- Corrigendum and addendum to “results of farkas type” this journal 9, 471–520 (1987)
This page was built for publication: Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
