Anonymous | Login | Signup for a new account | 2024-11-22 09:36 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 | |||||||
0000437 | [ALGLIB] Optimization | feature | have not tried | 2012-01-17 15:09 | 2018-01-02 17:22 | |||||||
Reporter | SergeyB | View Status | public | |||||||||
Assigned To | SergeyB | |||||||||||
Priority | normal | Resolution | open | |||||||||
Status | assigned | Product Version | ||||||||||
Summary | 0000437: Feasibility solver | |||||||||||
Description |
Solver which finds feasible point subject to boundary and linear constraints: * two forms - canonical (A*x=b) and general BLEIC constraints * may be, solver for a problem with general (nonlinear) constraints * scaling of the inputs and constraint matrix - we must rescale problem in order to have good convergence * use LQ or bidiagonalization instead of SVD. Or, maybe, orthogonalization for rows of the matrix... * use algorithm similar to one used by MinQP. Not sure that we should use MinQP internally, because MinQP may need same feasibility detection code. Maybe we should separate internal QP solver from MinQP subpackage, and call this solver from feasibility solver AND from MinQP * efficient hot starts |
|||||||||||
Additional Information | ||||||||||||
Programming language | Unspecified | |||||||||||
Attached Files | ||||||||||||
|
There are no notes attached to this issue. |
Mantis 1.1.6[^] Copyright © 2000 - 2008 Mantis Group |