A Farkas lemma for difference sublinear systems and quasidifferentiable programming
From MaRDI portal
Recommendations
- 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
Cites work
- 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?)
- 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
- Inequality systems and optimization
- Nonlinear alternative theorems and nondifferentiable programming
- Nonsmoothness and quasidifferentiability
- On Quasidifferentiable Functions and Non-Differentiable Programming
- 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
- 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
Cited in
(15)- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
- On minty variational principle for quasidifferentiable vector optimization problems
- On constraint qualifications in nonlinear programming
- Nonsmooth invex functions and sufficient optimality conditions
- Vector subdifferentials via recession mappings∗∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef:
- Nonlinear alternative theorems and nondifferentiable programming
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- A new constraint qualification and sharp optimality conditions for nonsmooth mathematical programming problems in terms of quasidifferentials
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Farkas theorems for positively homogeneous quasiconvex functions
- Solvability results for sublinear functions and operators
- A new version of Farkas' lemma and global convex maximization
- Farkas' lemma for separable sublinear inequalities without qualifications
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- Solvability theorems for classes of difference convex functions
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)
