Asymptotic Dual Conditions Characterizing Optimality for Infinite Convex Programs
Author:
- 1 April 1997
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 93 (1) , 153-165
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least SquaresMathematics of Operations Research, 1995
- A Farkas lemma for difference sublinear systems and quasidifferentiable programmingMathematical Programming, 1994
- Convex Analysis and Minimization Algorithms I1993
- Generalizations of Slater's constraint qualification for infinite convex programsMathematical Programming, 1992
- Corrigendum and addendum to “results of farkas type” this journal 9, 471–520 (1987)Numerical Functional Analysis and Optimization, 1989
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processesJournal of Optimization Theory and Applications, 1987
- Results of farkas typeNumerical Functional Analysis and Optimization, 1987
- Characterizations of optimality without constraint qualification for the abstract convex program1982
- Complete characterization of optimality for convex programming in banach spaces†Applicable Analysis, 1980
- On systems of convex inequalitiesJournal of Mathematical Analysis and Applications, 1979