A feasible BFGS interior point algorithm for solving convex minimization problems (Q2706324)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A feasible BFGS interior point algorithm for solving convex minimization problems |
scientific article |
Statements
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
0.91576684
0 references
0.9153199
0 references
0.9047935
0 references
0 references
0.90136874
0 references
0.8975397
0 references
A feasible BFGS interior point algorithm for solving convex minimization problems (English)
0 references
