Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CQP / rank | |||
Normal rank | |||
Revision as of 13:51, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Trajectory-following methods for large-scale degenerate convex quadratic programming |
scientific article |
Statements
Trajectory-following methods for large-scale degenerate convex quadratic programming (English)
0 references
5 August 2013
0 references
This paper considers an infeasible interior-point method for solving the general convex quadratic programming problem. Global convergence of the method is established. Additional trial steps for the choice of idealised solution trajectory are described to accelerate the convergence of the method on both degenerate and nondegenerate problems. The implementation of the convex quadratic programming package is described. Some experimental results on 178 convex examples are presented to illustrate the performance of the package.
0 references
convex quadratic programming
0 references
path-following methods
0 references
degenerate problems
0 references
software
0 references
numerical examples
0 references
interior-point method
0 references
global convergence
0 references
