Hello John, John Pye <[email protected]> writes:
> My first point is that IPOPT, our optimisation solver, already uses > Lagrange multipliers internally. So you don't need to code up all this > stuff for yourself. Otherwise, you're essentially trying to run a solver > within a solver, which isn't really a great idea. Aha. Indeed. > If you *really* want to try to solve a problem like this, using QRSlv as > your ASCEND solver, then you can control which root ASCEND converges to > by constraining the lower_bound and upper_bound of the unknowns in your > system. Check our wiki for details. No, I have no desire to re-invent the wheel. Now I have a stimulus to try and get IPOPT and ASCEND to co-operate. The problem from the Lagrange multiplier site was just a toy, to see what happened. The real problem on which I want to work is more complex, but still probably trivial for ASCEND. > That's OK. Hope you don't mind that I CCed my response to the users' > mailing list, for future reference. I don't mind at all. I only sent the message to your private mail becasuse I thought the list was not working. I never see messages sent to it in my mailbox. Cheers, Roger ------------------------------------------------------------------------------ What happens now with your Lotus Notes apps - do you make another costly upgrade, or settle for being marooned without product support? Time to move off Lotus Notes and onto the cloud with Force.com, apps are easier to build, use, and manage than apps on traditional platforms. Sign up for the Lotus Notes Migration Kit to learn more. http://p.sf.net/sfu/salesforce-d2d _______________________________________________ Ascend-sim-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/ascend-sim-users
