An Efficient Logarithmic Barrier Method without Line Search for Convex Quadratic Programming

被引:0
|
作者
S. Chaghoub
D. Benterki
机构
[1] School of Mathematical Science and Institute of Mathematics,
[2] Nanjing Normal University,undefined
[3] Laboratory of Fundamental and Numerical Mathematics,undefined
[4] Sétif-1 Ferhat Abbas University,undefined
来源
关键词
quadratic programming; linear programming; interior point methods; line search; approximate function;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:156 / 169
页数:13
相关论文
共 50 条