A generalization of the Farkas lemma and applications to convex programming

From MaRDI portal
Publication:1253612

DOI10.1016/0022-247X(78)90260-3zbMath0396.90070OpenAlexW2146187364WikidataQ124883568 ScholiaQ124883568MaRDI QIDQ1253612

Constantin Zalinescu

Publication date: 1978

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(78)90260-3




Related Items

Farkas' theorem of nonconvex type and its application to a min-max problemEfficient and weakly efficient solutions for the vector topical optimizationNecessary and sufficient conditions for solving infinite-dimensional linear inequalitiesSolvability results for sublinear functions and operatorsAn algorithm for the best approximation by elements of a polyhedral set in banach spacesNonlinear alternative theorems and nondifferentiable programmingOptimality conditions for state constrained nonlinear control problemsFarkas' lemma: three decades of generalizations for mathematical optimizationNew Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT ConditionsLipschitz properties of convex functionsOn uniformly convex functionsUnnamed ItemThe Farkas lemma of Shimizu, Aiyoshi and KatayamaFarkas' lemma for separable sublinear inequalities without qualificationsMerit functions in vector optimizationA generl farkas type lemmaA general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processesNorm duality for convex processes and applicationsOn gwinner's paper "results of emas type"On an abstract control problemImages of cones under linear mappingsA general Farkas lemmaA Farkas lemma for difference sublinear systems and quasidifferentiable programmingOn the duality gap and Gale's example in infinite-dimensional conic linear programmingA generalized Farkas lemma with applications to quasidifferentiable programming



Cites Work