A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Armand, Paul ; Gilbert, Jean Charles ; Jan-Jégou, Sophie
HAL, hal-01962283 / Harvested from HAL
Text on HAL
International audience
Publié le : 2000-01-04
Classification:  [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC] 
@article{hal-01962283,
     author = {Armand, Paul and Gilbert, Jean Charles and Jan-J\'egou, Sophie},
     title = {A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems},
     journal = {HAL},
     volume = {2000},
     number = {0},
     year = {2000},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-01962283}
}

Armand, Paul; Gilbert, Jean Charles; Jan-Jégou, Sophie. A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems. HAL, Tome 2000 (2000) no. 0, . http://gdmltest.u-ga.fr/item/hal-01962283/