An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091)
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: An interior point algorithm of O( m| |) iterations for C^ 1-convex programming |
scientific article; zbMATH DE number 429124
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming |
scientific article; zbMATH DE number 429124 |
Statements
An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (English)
0 references
6 January 1994
0 references
convergence analysis
0 references
path-following algorithm
0 references
convex programs
0 references
nonsmooth Newton subroutine
0 references
interior point methods
0 references
0 references
0 references
0 references
0.8538767099380493
0 references
0.853520393371582
0 references
0.8368412852287292
0 references
