Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier (Q1935397)
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: Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier |
scientific article; zbMATH DE number 6136622
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier |
scientific article; zbMATH DE number 6136622 |
Statements
Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier (English)
0 references
15 February 2013
0 references
convex quadratic optimization
0 references
Kernel function
0 references
large- and small-update methods
0 references
iteration bound
0 references
numerical examples
0 references
primal-dual interior-point methods
0 references
algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0.8513672351837158
0 references
0.8403093218803406
0 references
0.8218817114830017
0 references
0.8080325722694397
0 references
