Asymptotic dual conditions characterizing optimality for infinite convex programs
From MaRDI portal
Publication:1379971
DOI10.1023/A:1022606002804zbMath0901.90158OpenAlexW152555402MaRDI QIDQ1379971
Publication date: 5 March 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022606002804
necessary and sufficient optimality conditionssubdifferentialsinfinite-dimensional convex programminggeneralized Farkas lemma
Related Items
The stable duality of DC programs for composite convex functions ⋮ On \(\epsilon\)-solutions for convex optimization problems with uncertainty data ⋮ Linear regularity, equirregularity, and intersection mappings for convex semi-infinite inequality systems ⋮ Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs ⋮ Liberating the subgradient optimality conditions from constraint qualifications ⋮ Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems ⋮ Characterizations of robust solution set of convex programs with uncertain data ⋮ Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ Characterizing global optimality for DC optimization problems under convex inequality constraints ⋮ On quasi \(\epsilon\)-solution for robust convex optimization problems ⋮ Approximate optimality conditions for composite convex optimization problems ⋮ Optimality theorems for convex semidefinite vector optimization problems ⋮ Optimality conditions for composite DC infinite programming problems ⋮ Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs ⋮ On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems ⋮ Optimality conditions of robust convex multiobjective optimization viaε-constraint scalarization and image space analysis ⋮ Unnamed Item ⋮ On approximate solutions and saddle point theorems for robust convex optimization ⋮ Multiobjective DC programs with infinite convex constraints ⋮ A closedness condition and its applications to DC programs with convex constraints ⋮ New Farkas-type constraint qualifications in convex infinite programming ⋮ Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs ⋮ Duality and optimality conditions for generalized equilibrium problems involving DC functions ⋮ Characterizations of solution sets of convex vector minimization problems ⋮ Sequential optimality conditions for multiobjective fractional programming problems ⋮ Unnamed Item ⋮ Characterizations of optimal solution sets of convex infinite programs ⋮ On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data ⋮ Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data ⋮ On \(\epsilon\)-solutions for robust semi-infinite optimization problems ⋮ On \(\epsilon\)-solutions for robust fractional optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\)
- Generalizations of Slater's constraint qualification for infinite convex programs
- On systems of convex inequalities
- A Farkas lemma for difference sublinear systems and quasidifferentiable programming
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
- Optimization and nonsmooth analysis
- Results of farkas type
- Complete characterization of optimality for convex programming in banach spaces†
- A generalized Farkas lemma with applications to quasidifferentiable programming
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- Characterizations of optimality without constraint qualification for the abstract convex program
- Semismooth and Semiconvex Functions in Constrained Optimization
- Corrigendum and addendum to “results of farkas type” this journal 9, 471–520 (1987)
- Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
