A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation (Q722399): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129982736, #quickstatements; #temporary_batch_1729469299256 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s0965542518030132 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2797610513 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129982736 / rank | |||
Normal rank | |||
Latest revision as of 01:12, 21 October 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation |
scientific article |
Statements
A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation (English)
0 references
23 July 2018
0 references
approximate solutions
0 references
mathematical programming
0 references
Karush-Kuhn-Tucker theorem
0 references
quadratic programming
0 references
0 references
