A new proof of the Kuhn-Tucker and Farkas theorems
From MaRDI portal
Publication:1991635
DOI10.1134/S0965542518070072zbMath1408.46069OpenAlexW2888380322MaRDI QIDQ1991635
Yuri G. Evtushenko, Alexey A. Tret'yakov
Publication date: 30 October 2018
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542518070072
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
- A new class of theorems of the alternative
- pth-order approximation of the solution set of nonlinear equations
- An elementary proof of the Karush–Kuhn–Tucker theorem in normed linear spaces for problems with a finite number of inequality constraints
- On the Development of Optimization Theory
- Classroom Note:An Elementary Proof of Farkas' Lemma
This page was built for publication: A new proof of the Kuhn-Tucker and Farkas theorems