|
Viewing Issue Advanced Details
[ Jump to Notes ]
|
[ View Simple ]
[ Issue History ]
[ Print ]
|
|
ID |
Category |
Severity |
Reproducibility |
Date Submitted |
Last Update |
|
0000868 |
[ALGLIB] Optimization |
feature |
have not tried |
2019-11-19 19:26 |
2019-11-19 19:26 |
|
|
Reporter |
SergeyB |
View Status |
public |
|
|
Assigned To |
SergeyB |
|
Priority |
normal |
Resolution |
implemented |
Platform |
|
|
Status |
resolved |
|
OS |
|
|
Projection |
none |
|
OS Version |
|
|
ETA |
none |
Fixed in Version |
3.16.0 |
Product Version |
|
| |
Target Version |
3.16.0 |
Product Build |
|
|
|
Summary |
0000868: IMPLEMENTED: dense interior point QP solver |
|
Description |
Implemented dense interior point QP solver for convex and semidefinite QP problems with moderate (up to several thousands) variables count.
New algorithm is order of magnitude faster than BLEIC-QP and DENSE-AUL-QL solvers on general QP problems (although some special cases are still better handled by BLEIC/DENSE-AUL). |
|
Steps To Reproduce |
|
|
Additional Information |
|
|
|
Programming language |
Unspecified |
|
|
Attached Files |
|
|
|
Relationships 
