Skip to search formSkip to main contentSkip to account menu

Farkas' lemma

Known as: Farkas's lemma, Farkas Lemma, Farkas’ Lemma 
Farkas's lemma is a result in mathematics stating that a vector is either in a given convex cone or that there exists a (hyper)plane separating the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations

Broader (3)

Convex analysisLinear programmingMathematical optimization
Convex coneConvex optimizationKarush–Kuhn–Tucker conditionsList of numerical analysis topics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Controller design for rigid spacecraft attitude tracking with actuator saturation
Highly Cited
2011
Highly Cited
2011
Educational Effects of a Vocabulary Intervention on Preschoolers' Word Knowledge and Conceptual Development: A Cluster‐Randomized Trial
A B S T R A C T The purpose of this study was to examine the hypothesis that helping preschoolers learn words through… 
Highly Cited
2008
Highly Cited
2008
Lexical Plurals: A Morphosemantic Approach
Introduction PART I: A TYPOLOGY OF LEXICAL PLURALS 1. Varieties of Non-Inflectional Plurals 2. Plurals and Morphological… 
Highly Cited
2006
Highly Cited
2006
Model Predictive Control for Transparent Teleoperation Under Communication Time Delay
Prior efforts in bilateral teleoperation under communication delay have mainly yielded control algorithms that sacrifice… 
Highly Cited
2005
Highly Cited
2005
Scalable Analysis of Linear Systems Using Mathematical Programming
We present a method for generating linear invariants for large systems. The method performs forward propagation in an abstract… 
Highly Cited
2004
Highly Cited
2004
Indexing spatio-temporal trajectories with Chebyshev polynomials
In this paper, we attempt to approximate and index a d- dimensional (d ≥ 1) spatio-temporal trajectory with a low order… 
Highly Cited
2003
Highly Cited
2003
Leave-One-Out Bounds for Kernel Methods
In this article, we study leave-one-out style cross-validation bounds for kernel methods. The essential element in our analysis… 
Highly Cited
2003
Highly Cited
2003
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least ε n2 edges have… 
Review
1997
Review
1997
An Introduction to Binary Decision Diagrams
1 2 Preface This note is a short introduction to Binary Decision Diagrams. It provides some background knowledge and describes… 
Highly Cited
1990
Highly Cited
1990
Pseudo-random generators under uniform assumptions
1. I n t r o d u c t i o n Randomness have been playing an ever increasing role in computer science. The demand for cheap random… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)