A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems (Q2706324): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: L-BFGS / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:07, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems |
scientific article |
Statements
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems (English)
0 references
19 March 2001
0 references
analytic center
0 references
BFGS quasi-Newton approximations
0 references
constrained optimization
0 references
convex programming
0 references
interior point algorithm
0 references
line-search
0 references
primal-dual method
0 references
superlinear convergence
0 references
