The method of convex programming with a prescribed absolute-relative error (Q1571209)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1472946
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The method of convex programming with a prescribed absolute-relative error |
scientific article; zbMATH DE number 1472946 |
Statements
The method of convex programming with a prescribed absolute-relative error (English)
0 references
1998
0 references
Questions concerning the effectiveness of optimization methods, their theoretical rates of convergence, and the solution errors are considered. A finite method for solving a convex programming problem with a given absolute-relative error is proposed. The method represents a further development of earlier suggested methods for solving this problem with given absolute and relative errors.
0 references
convex programming
0 references
absolute-relative error
0 references
numerical solutions optimization method
0 references
convergence
0 references
0.7953767776489258
0 references
0.772080659866333
0 references
