A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming

Yanjin Wang

首页> 外文期刊>Numerical Functional Analysis and Optimization >A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming

【24h】

A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming

机译：一类凸二次规划的不可行内点算法。

获取原文

获取原文并翻译 | 示例

开具论文收录证明 >>

页面导航

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

摘要

This article proposes a class of infeasible interior point algorithms for convex quadratic programming, and analyzes its complexity. It is shown that this algorithm has the polynomial complexity. Its best complexity is O(nL).

机译：本文针对凸二次规划提出了一种不可行的内点算法，并对其复杂性进行了分析。结果表明，该算法具有多项式复杂度。其最佳复杂度为O（nL）。

著录项

来源
《Numerical Functional Analysis and Optimization》 |2010年第11期|p.1283-1293|共11页
作者
Yanjin Wang;
展开▼
作者单位

Institute of Applied Physics and Computational Mathematics, Beijing, P. R. China;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词

相似文献

外文文献
中文文献
专利

1. A class of infeasible interior point algorithms for convex quadratic programming [J] . Wang Y. Numerical Functional Analysis and Optimization . 2010,第10a12期

机译：一类凸二次规划的不可行内点算法。
2. A primal-infeasible interior point algorithm for linearly constrained convex programming [J] . Yanjin Wang, Pusheng Fei Control & Cybernetics . 2009,第3期

机译：线性约束凸规划的原始不可行内点算法
3. AN INFEASIBLE MIZUNO-TODD-YE TYPE ALGORITHM FOR CONVEX QUADRATIC PROGRAMMING WITH POLYNOMIAL COMPLEXITY [J] . Yanjin Wang, Pusheng Fei Numerical Functional Analysis and Optimization . 2007,第3a4期

机译：具有多项式复杂性的凸二次规划的不可行Mizuno-todd-ye型算法
4. On extending kernel-based interior point algorithms for linear programming to convex quadratic second-order cone programming [C] . Yanfang Li, Xibo Duan, Jia Gu International Conference on Natural Computation;International Conference on Fuzzy Systems and Knowledge Discovery . 2015

机译：关于将基于线性规划的基于内核的内点算法扩展到凸二次二次锥编程
5. Infeasible path-following algorithms for convex quadratic programming. [D] . Hsieh, Yi-Chih. 1995

机译：凸二次规划的不可行路径跟踪算法。
6. Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization [O] . John W. Pearson, Jacek Gondzio -1

机译：PDE约束优化引起的二次编程问题的快速内点解
7. A Simple quadratically convergent Interior Point Algorithm for Linear Programming and Convex quadratic Programming [O] . Tits, A.L., Zhou, J.L. 1993

机译：线性规划和凸二次规划的简单二次收敛内点算法
8. O(n3L) Interior Point Algorithm for Convex Quadratic Programming [R] . Monteiro, R. C., Adler, I. 1987

机译：凸二次规划的O（n3L）内点算法

A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming

摘要

著录项

引文网络

相似文献

相关主题

期刊订阅