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
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
Convex programming (90C25) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Related Items
Farkas' theorem of nonconvex type and its application to a min-max problem ⋮ Efficient and weakly efficient solutions for the vector topical optimization ⋮ Necessary and sufficient conditions for solving infinite-dimensional linear inequalities ⋮ Solvability results for sublinear functions and operators ⋮ An algorithm for the best approximation by elements of a polyhedral set in banach spaces ⋮ Nonlinear alternative theorems and nondifferentiable programming ⋮ Optimality conditions for state constrained nonlinear control problems ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions ⋮ Lipschitz properties of convex functions ⋮ On uniformly convex functions ⋮ Unnamed Item ⋮ The Farkas lemma of Shimizu, Aiyoshi and Katayama ⋮ Farkas' lemma for separable sublinear inequalities without qualifications ⋮ Merit functions in vector optimization ⋮ A generl farkas type lemma ⋮ A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes ⋮ Norm duality for convex processes and applications ⋮ On gwinner's paper "results of emas type" ⋮ On an abstract control problem ⋮ Images of cones under linear mappings ⋮ A general Farkas lemma ⋮ A Farkas lemma for difference sublinear systems and quasidifferentiable programming ⋮ On the duality gap and Gale's example in infinite-dimensional conic linear programming ⋮ A generalized Farkas lemma with applications to quasidifferentiable programming
Cites Work
- Infinite programming and duality in topological vector spaces
- A class of nondifferentiable mathematical programming problems
- Sur la séparation des ensembles convexes
- Asymptotic cones and duality of linear relations
- A course on optimization and best approximation
- Linear programs in topological vector spaces
- General Lagrange multiplier theorems
- Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
- Separation Properties of Convex Cones
- Nonlinear programming in complex space
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item