Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves (Q2832889): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: QPSchur / rank | |||
Normal rank | |||
Revision as of 20:53, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves |
scientific article |
Statements
Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves (English)
0 references
15 November 2016
0 references
convex quadratic optimization
0 references
primal-dual active-set methods
0 references
semi-smooth Newton methods
0 references
inexact Newton methods
0 references
Karush-Kuhn-Tucker optimality conditions
0 references
Krylov subspace methods
0 references
