Anonymous | Login | Signup for a new account | 2024-11-21 21:39 MSK |
Main | My View | View Issues | Change Log | Roadmap | Docs |
Viewing Issue Simple Details [ Jump to Notes ] | [ View Advanced ] [ Issue History ] [ Print ] | |||||||||||
ID | Category | Severity | Reproducibility | Date Submitted | Last Update | |||||||
0000606 | [ALGLIB] Optimization | feature | have not tried | 2014-05-15 11:13 | 2018-01-02 17:15 | |||||||
Reporter | SergeyB | View Status | public | |||||||||
Assigned To | SergeyB | |||||||||||
Priority | normal | Resolution | open | |||||||||
Status | assigned | Product Version | ||||||||||
Summary | 0000606: QQP improvements | |||||||||||
Description |
* Newton step for sparse QP with general linear constraints * investigate feasibility of updating Cholesky decomposition for sparse QP problems. It is possible, but sometimes it is faster to perform sparse Cholesky from scratch than to update it. At least, for large batches of updates... * permutation of variables (should be performed during initial scaling of the problem) for faster sparse Cholesky * support for sparse Cholesky solvers other than SKS-based one |
|||||||||||
Additional Information | ||||||||||||
Programming language | Unspecified | |||||||||||
Attached Files | ||||||||||||
|
There are no notes attached to this issue. |
Mantis 1.1.6[^] Copyright © 2000 - 2008 Mantis Group |