.png){kind=icon}
返回
A predictor-corrector method for extended linear-quadratic programming
.png){kind=icon}
PRE
AI
DOI：10.1016/0305-0548(95)00076-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The saddle point form of extended linear-quadratic programs can be solved by an interior point path-following method in polynomial time. The algorithm may take advantage of the block structures of certain problems arising from optimal control and stochastic programming. In addition, it needs no line searches and treats fully or not fully quadratic problems equally. Preliminary computational results apparently show that the algorithm is effective in solving a class of two-stage stochastic programming problems. (C) 1996 Elsevier Science Ltd
Keyword:
INTERIOR-POINT ALGORITHMS
DISCRETE-TIME
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容