.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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
Keywords:
INTERIOR-POINT ALGORITHMS
DISCRETE-TIME
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSaveShareSave
View more