A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems (Q4884037)
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: A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems |
scientific article; zbMATH DE number 898147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems |
scientific article; zbMATH DE number 898147 |
Statements
A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems (English)
0 references
25 March 1997
0 references
convex programming
0 references
superlinear convergence
0 references
stepsize problem
0 references
line search
0 references
bisection method
0 references
barrier methods
0 references
eigenvalues
0 references
0.8263222575187683
0 references
0.8156554698944092
0 references
0.8020725846290588
0 references
0.7802531123161316
0 references
0.7771691679954529
0 references
