Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier (Q1935397): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11075-012-9581-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11075-012-9581-Y / rank | |||
Normal rank | |||
Latest revision as of 13:38, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier |
scientific article |
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
