Anonymous | Login | Signup for a new account | 2024-11-24 10:27 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 | ||
0000486 | [ALGLIB] Optimization | minor | always | 2012-08-31 15:32 | 2012-10-24 10:59 | ||
Reporter | nlagerr | View Status | public | ||||
Assigned To | SergeyB | ||||||
Priority | normal | Resolution | fixed | ||||
Status | resolved | Product Version | 3.6.0 | ||||
Summary | 0000486: FIXED: bug in the constraint activation/deactivation code of QP solver | ||||||
Description |
QP solver incorrectly activated/deactivated linear constraints in some tricky cases (multiple constraints which form degenerate system). New version of the solver uses another algorithm for constraint activation/deactivation which is more robust and should not experience this sort of bugs. Below is an original report from one of the users: > I have included two NUnit tests in which the QP solver of > version 3.6.0 does not find the correct optimum. The QP > solver does return the success termination type. I found > that if I do not supply a starting point to the solver, > this problem does not occur and the correct minimum is > found. |
||||||
Additional Information | |||||||
Programming language | C# | ||||||
Attached Files | AlglibQPSolverTest.cs [^] (4,519 bytes) 2012-08-31 15:32 | ||||||
|
Mantis 1.1.6[^] Copyright © 2000 - 2008 Mantis Group |