A Farkas lemma for difference sublinear systems and quasidifferentiable programming

DOI10.1007/BF01582061zbMath0804.49015OpenAlexW2087446297WikidataQ124833823 ScholiaQ124833823MaRDI QIDQ1315435

V. Pereyra

Publication date: 16 January 1995

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582061

zbMATH Keywords

optimality conditionssubdifferentialsdifference convex programmingalternative theoremsFarkas-Minkowski theoremgeneralized Robinson stability conditionsquasidifferentiable programming problems

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48) Convexity of real functions of several variables, generalizations (26B25) Optimality conditions for problems in abstract spaces (49K27)

Related Items (10)

On minty variational principle for quasidifferentiable vector optimization problems ⋮ Asymptotic dual conditions characterizing optimality for infinite convex programs ⋮ Solvability theorems for classes of difference convex functions ⋮ Characterizing global optimality for DC optimization problems under convex inequality constraints ⋮ 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: ⋮ On constraint qualifications in nonlinear programming ⋮ Nonsmooth invex functions and sufficient optimality conditions ⋮ A New Constraint Qualification and Sharp Optimality Conditions for Nonsmooth Mathematical Programming Problems in Terms of Quasidifferentials ⋮ A new version of Farkas' lemma and global convex maximization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inequality systems and optimization
• Optimality conditions in nondifferentiable programming and their applications to best approximations
• On implicit function theorems for set-valued maps and their application to mathematical programming under inclusion constraints
• A generalization of the Farkas lemma and applications to convex programming
• A solvability theorem for a class of quasiconvex mappings with applications to optimization
• A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
• Quasidifferentials and maximal normal operators
• Optimization and nonsmooth analysis
• Results of farkas type
• Nonsmoothness and quasidifferentiability
• Quasidifferential calculus and first-order optimality conditions in nonsmooth optimization
• On optimality conditions in nonsmooth inequality constrained minimization
• Nonlinear alternative theorems and nondifferentiable programming
• Asymptotic kuhn-tucker conditions in abstract spaces
• A generalized Farkas lemma with applications to quasidifferentiable programming
• On necessary minimum conditions in quasidifferential calculus: independence of the specific choice of quasidifferentials
• A constraint qualification in quasidifferentiable programming
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• On Quasidifferentiable Functions and Non-Differentiable Programming

This page was built for publication: A Farkas lemma for difference sublinear systems and quasidifferentiable programming