Results 1 to 2 of 2

Thread: JMSL Version for Matlab's lsqnonlin Routine

  1. #1
    Junior Member
    Join Date
    May 2009

    JMSL Version for Matlab's lsqnonlin Routine

    After a few days testing with various permutations of tolerance parameters, I've failed to find an accurate way of using the "BoundedLeastSquares" class in place of the matlab "lsqnonlin" routine. Aside from various differences in methodology (i.e. matlab expects guess parameters x, jmsl expects initial guess solutions), I've found one fundamental difference that I don't see possible in the jmsl version of the same routine...

    Matlab lsqnonlin documentation:
    By default lsqnonlin chooses the large-scale algorithm. This algorithm is a subspace trust-region method and is based on the interior-reflective Newton method described in [1] and [2]. Each iteration involves the approximate solution of a large linear system using the method of preconditioned conjugate gradients (PCG). See Trust-Region Methods for Nonlinear Minimization and Preconditioned Conjugate Gradients.
    It doesn't appear that JMSL has an implementation for the interior-reflective Newton method to handle a termed "large-scale" algorithm. Is there a way to handle this discrepancy using JMSL?

  2. #2
    Senior Member ed's Avatar
    Join Date
    Aug 2005
    Both the JMSL algorithms BoundedLeastSquares and NonlinLeastSquares use a modified Levenberg-Marquardt algorithm and an active set strategy. If you have a code example that fails, you should get in touch with technical support to see if they can dig into things and find a solution. There may be other optimizers in the library you can try, but none implement the interior-reflective Newton method.

    The first 90% of the code accounts for the first 90% of the development time. The remaining 10% of the code accounts for the other 90% of the development time.

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts