A Farkas lemma for difference sublinear systems and quasidifferentiable programming
It is well-known that the Farkas-Minkowski theorem can be formulated for sublinear (i.e., positively homogeneous) functions \(f: \mathbb{R}^ n\to \mathbb{R}\) and \(g= (g_ 1, \dots, g_ m): \mathbb{R}^ n\to \mathbb{R}^ m\) by means of the subdifferentials in the following manner: The system \(\{g(x) \leq 0\), \(f(x)<0\}\) is not solvable if and only if \(0\in \partial f(0)+ \overline {\text{cone}} \bigcup^ m_{i=1} \partial g(0)\). In the present paper some generalizations of this theorem are presented where 1. \(g\) (partly also \(f\)) is a vector function from a Banach space in an ordered Banach space, 2. \(f\) and \(g\) are difference sublinear (DSL), i.e., the difference of sublinear functions, 3. inhomogeneous systems are discussed. All the results are used for the construction of asymptotic first order necessary optimality conditions of Karush-Kuhn-Tucker type for quasidifferentiable programming problems. In short examples some special problems of difference convex programming, quasidifferentiable programming, convex minimization, and semi-infinite convex (concave) programming are discussed. At the end of the paper the authors give some remarks to generalized Robinson stability conditions.
- Farkas theorems for positively homogeneous quasiconvex functions
- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
- Farkas' lemma for separable sublinear inequalities without qualifications
- On Quasidifferentiable Functions and Non-Differentiable Programming
- Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
- A constraint qualification in quasidifferentiable programming
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
- A generalization of the Farkas lemma and applications to convex programming
- A generalized Farkas lemma with applications to quasidifferentiable programming
- A solvability theorem for a class of quasiconvex mappings with applications to optimization
- Asymptotic kuhn-tucker conditions in abstract spaces
- scientific article; zbMATH DE number 4031411 (Why is no real title available?)
- scientific article; zbMATH DE number 3664752 (Why is no real title available?)
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- scientific article; zbMATH DE number 3719794 (Why is no real title available?)
- scientific article; zbMATH DE number 3336209 (Why is no real title available?)
- Inequality systems and optimization
- Nonlinear alternative theorems and nondifferentiable programming
- Nonsmoothness and quasidifferentiability
- On implicit function theorems for set-valued maps and their application to mathematical programming under inclusion constraints
- On necessary minimum conditions in quasidifferential calculus: independence of the specific choice of quasidifferentials
- On optimality conditions in nonsmooth inequality constrained minimization
- On Quasidifferentiable Functions and Non-Differentiable Programming
- Optimality conditions in nondifferentiable programming and their applications to best approximations
- Optimization and nonsmooth analysis
- Quasidifferential calculus and first-order optimality conditions in nonsmooth optimization
- Quasidifferentials and maximal normal operators
- Results of farkas type
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- A new version of Farkas' lemma and global convex maximization
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
- Solvability results for sublinear functions and operators
- Nonlinear alternative theorems and nondifferentiable programming
- Solvability theorems for classes of difference convex functions
- Vector subdifferentials via recession mappings∗∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef:
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
- A new constraint qualification and sharp optimality conditions for nonsmooth mathematical programming problems in terms of quasidifferentials
- Farkas theorems for positively homogeneous quasiconvex functions
- On minty variational principle for quasidifferentiable vector optimization problems
- Nonsmooth invex functions and sufficient optimality conditions
- Farkas' lemma for separable sublinear inequalities without qualifications
- On constraint qualifications in nonlinear programming
This page was built for publication: A Farkas lemma for difference sublinear systems and quasidifferentiable programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315435)
