On reducibility of the general convex programming problem to an unconditional extremum problem (Q1380189)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On reducibility of the general convex programming problem to an unconditional extremum problem |
scientific article; zbMATH DE number 1122687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On reducibility of the general convex programming problem to an unconditional extremum problem |
scientific article; zbMATH DE number 1122687 |
Statements
On reducibility of the general convex programming problem to an unconditional extremum problem (English)
0 references
9 March 1998
0 references
penalty functions
0 references
sequence of unconditional extremum problems
0 references
0.8766604065895081
0 references
0.8451250791549683
0 references
0.8356313705444336
0 references
0.8335320353507996
0 references
