Complete characterizations of stable Farkas' lemma and cone-convex programming duality (Q927159): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q124879278, #quickstatements; #temporary_batch_1710862453543 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q124879278 / rank | |||
Normal rank | |||
Revision as of 17:41, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complete characterizations of stable Farkas' lemma and cone-convex programming duality |
scientific article |
Statements
Complete characterizations of stable Farkas' lemma and cone-convex programming duality (English)
0 references
4 June 2008
0 references
Stable Farkas lemma
0 references
Stable duality
0 references
Convex optimization
0 references
Semi-definite programming
0 references
Second-order cone programming
0 references
