首页> 外文OA文献 >A Polynomial Method of Weighted Centers for Convex Quadratic Programming

【2h】

A Polynomial Method of Weighted Centers for Convex Quadratic Programming

机译：凸二次规划的加权中心多项式方法

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
D. den Hertog; C. Roos; T. Terlaky;
展开▼
作者单位

展开▼
年度 1991
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. On weighted linear least-squares problems related to interior methods for convex quadratic programming [J] . Forsgren A., Sporre G. SIAM Journal on Matrix Analysis and Applications . 2001,第1期

机译：与凸二次规划的内部方法有关的加权线性最小二乘问题
2. Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation [J] . Elloumi Sourour, Lambert Amelie, Lazare Arnaud Journal of Global Optimization . 2021,第2期

机译：通过二次凸重构来解决无约束的0-1多项式计划
3. An exterior point polynomial-time algorithm for convex quadratic programming [J] . Tian Da Gang Computational optimization and applications . 2015,第1期

机译：凸二次规划的外点多项式时间算法
4. Convergence properties of inexact sequential quadratically constrained quadratic programming method for convex programming [C] . Atsushi Kato, Yasushi Narushima, Hiroshi Yabe The 8th international conference on optimization: Techniques and Applications . 2010

机译：凸规划的不精确序次二次约束二次规划方法的收敛性。
5. Non-convex Quadratically Constrained Quadratic Programming: Hidden Convexity, Scalable Approximation and Applications [D] . Konar, Aritra. 2017

机译：非凸二次约束二次规划：隐凸性，可扩展近似和应用
6. Conic Sampling: An Efficient Method for Solving Linear and Quadratic Programming by Randomly Linking Constraints within the Interior [O] . Oliver Serang -1

机译：圆锥取样：由内部随机链接约束求解线性和二次规划的有效方法
7. A polynomial method of weighted centers for convex quadratic programming. [O] . Hertog D. den, Roos C., Terlaky T. 100

机译：凸二次规划的加权中心多项式方法。
8. Polynomial Method of Weighted Centers for Convex Quadratic Programming [R] . den Hertog, D., Roos, C., Terlaky, T. 1990

机译：凸二次规划的加权中心多项式方法

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

客服微信
服务号