A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds (Q5287104)
From MaRDI portal
scientific article; zbMATH DE number 232279
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds |
scientific article; zbMATH DE number 232279 |
Statements
A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds (English)
0 references
11 August 1993
0 references
interior point methods
0 references
box constraints
0 references
large sparse minimization
0 references
superlinearly convergent algorithm
0 references
convex quadratic programs
0 references
simple bounds
0 references
unconstrained piecewise quadratic function
0 references
optimality conditions
0 references
Cholesky factorization
0 references
parallel computers
0 references
