Results of farkas type
From MaRDI portal
Publication:3732434
DOI10.1080/01630568708816244zbMath0598.49017OpenAlexW2109523503MaRDI QIDQ3732434
Publication date: 1987
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630568708816244
Karush-Kuhn-Tucker optimality conditionshomogeneous programmingFarkas lemmaKarlin constraint qualification
Programming in abstract spaces (90C48) Duality theory (optimization) (49N15) Optimality conditions for problems in abstract spaces (49K27)
Related Items
Optimality conditions in mathematical programming and composite optimization ⋮ On KKT points of homogeneous programs ⋮ Some dual characterizations of Farkas-type results for fractional programming problems ⋮ Asymptotic dual conditions characterizing optimality for infinite convex programs ⋮ Characterizing global optimality for DC optimization problems under convex inequality constraints ⋮ Hahn-Banach-type theorems and applications to optimization for partially ordered vector space-valued invariant operators ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Complete characterizations of stable Farkas' lemma and cone-convex programming duality ⋮ New Farkas-type constraint qualifications in convex infinite programming ⋮ Sequential Lagrangian conditions for convex programs with applications to semidefinite programming ⋮ Duality and infinite dimensional optimization ⋮ The stable Farkas lemma for composite convex functions in infinite dimensional spaces ⋮ Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization ⋮ Hahn-Banach and sandwich theorems for equivariant vector lattice-valued operators and applications ⋮ A generl farkas type lemma ⋮ On gwinner's paper "results of emas type" ⋮ A Farkas lemma for difference sublinear systems and quasidifferentiable programming ⋮ Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear optimization and approximation
- An extension lemma and homogeneous programming
- A general Farkas lemma
- Farkas-Minkowski systems in semi-infinite programming
- Generalized Farkas' theorem and optimization of infinitely constrained problems
- Infinite programming and duality in topological vector spaces
- Closed images of convex multivalued mappings in linear topological spaces with applications
- On systems of convex inequalities
- Duality and regularization for inf-sup problems
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
- On infinite systems of linear inequalities
- Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
- On a theorem of Ky Fan and its application to nondifferentiame optimization
- Nonlinear alternative theorems and nondifferentiable programming
- An Extension of the Nonhomogeneous Farkas Theorem
- On the Development of Optimization Theory
- On regularity conditions in mathematical programming
- Asymptotic kuhn-tucker conditions in abstract spaces
- A generalized Farkas lemma with applications to quasidifferentiable programming
- Characterizations of optimality without constraint qualification for the abstract convex program
- The theorem of the alternative, the key-theorem, and the vector-maximum problem
- A Solvability Theorem for Homogeneous Functions
- Semismooth and Semiconvex Functions in Constrained Optimization
- A multivalued approach to the Farkas lemma
- Generalizations of Farkas’ Theorem
- The Farkas lemma of Shimizu, Aiyoshi and Katayama
- Convex Analysis
- Linear inequalities, mathematical programming and matrix theory
- Sufficient conditions for extremum, penalty functions and regularity
