A generalized Farkas lemma with applications to quasidifferentiable programming
From MaRDI portal
Publication:3958297
DOI10.1007/BF01917106zbMath0494.90088WikidataQ125051206 ScholiaQ125051206MaRDI QIDQ3958297
No author found.
Publication date: 1982
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
normed linear spacesclosed convex conesublinear mappingsquasidifferentiable programmingnon- differentiable programminggeneralization of Farkas' lemmageneralized Motzkin alternative theoremKuhn-Tucker type necessary optimality condition
Related Items (21)
Nonasymptotic necessary conditions for nonsmooth infinite optimization problems ⋮ Theorems of the alternative for multifunctions with applications to optimization: General results ⋮ Nondifferentiable optimization by smooth approximations ⋮ Optimal Control Problems with Terminal Complementarity Constraints ⋮ Results of farkas type ⋮ Solvability results for sublinear functions and operators ⋮ Asymptotic dual conditions characterizing optimality for infinite convex programs ⋮ Nonlinear alternative theorems and nondifferentiable programming ⋮ On Quasidifferentiable Functions and Non-Differentiable Programming ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Vector subdifferentials via recession mappings∗∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef: ⋮ Optimality conditions for the simple convex bilevel programming problem in Banach spaces ⋮ Generalized convexity in nondifferentiable programming ⋮ Unnamed Item ⋮ Farkas' lemma for separable sublinear inequalities without qualifications ⋮ Asymptotic conditions for weak and proper optimality in infinite dimensional convex 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 ⋮ A Farkas lemma for difference sublinear systems and quasidifferentiable programming ⋮ Inequality systems and optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Another application of Guignard's generalized Kuhn-Tucker conditions
- A generalization of the Farkas lemma and applications to convex programming
- A course on optimization and best approximation
- On an abstract control problem
- Asymptotic kuhn-tucker conditions in abstract spaces
- Fractional programming without differentiability
- Extensions of Asymptotic Kuhn–Tucker Conditions in Mathematical Programming
- Normed Convex Processes
- Sufficient conditions for extremum, penalty functions and regularity
This page was built for publication: A generalized Farkas lemma with applications to quasidifferentiable programming