Package org.apache.commons.math.optimization

Examples of org.apache.commons.math.optimization.OptimizationException

236
237
238
239
240
241
242
243
244
245
246
        // compute the amplitude and pulsation coefficients
        double c1 = sy2 * sxz - sxy * syz;
        double c2 = sxy * sxz - sx2 * syz;
        double c3 = sx2 * sy2 - sxy * sxy;
        if ((c1 / c2 < 0.0) || (c2 / c3 < 0.0)) {
            throw new OptimizationException(LocalizedFormats.UNABLE_TO_FIRST_GUESS_HARMONIC_COEFFICIENTS);
        }
        a     = FastMath.sqrt(c1 / c2);
        omega = FastMath.sqrt(c2 / c3);

    }
View Full Code Here
769
770
771
772
773
774
775
776
777
778
779
                for (int j = k; j < jacobian.length; ++j) {
                    double aki = jacobian[j][permutation[i]];
                    norm2 += aki * aki;
                }
                if (Double.isInfinite(norm2) || Double.isNaN(norm2)) {
                    throw new OptimizationException(
                            "unable to perform Q.R decomposition on the {0}x{1} jacobian matrix",
                            rows, cols);
                }
                if (norm2 > ak2) {
                    nextColumn = i;
View Full Code Here
206
207
208
209
210
211
212
213
                }

            }

        } catch (ConvergenceException ce) {
            throw new OptimizationException(ce);
        }
    }
View Full Code Here
231
232
233
234
235
236
237
            yB = f.value(b);
            if (yA * yB <= 0) {
                return b;
            }
        }
        throw new OptimizationException("unable to bracket optimum in line search");
    }
View Full Code Here
162
163
164
165
166
167
168
169
     * of iterations is exceeded
     */
    protected void incrementIterationsCounter()
        throws OptimizationException {
        if (++iterations > maxIterations) {
            throw new OptimizationException(new MaxIterationsExceededException(maxIterations));
        }
    }
View Full Code Here
280
281
282
283
284
285
286
287
288
            // compute the covariances matrix
            RealMatrix inverse =
                new LUDecompositionImpl(MatrixUtils.createRealMatrix(jTj)).getSolver().getInverse();
            return inverse.getData();
        } catch (InvalidMatrixException ime) {
            throw new OptimizationException("unable to compute covariances: singular problem");
        }

    }
View Full Code Here
297
298
299
300
301
302
303
304
305
306
307
     * lesser or equal to number of parameters)
     */
    public double[] guessParametersErrors()
        throws FunctionEvaluationException, OptimizationException {
        if (rows <= cols) {
            throw new OptimizationException(
                    "no degrees of freedom ({0} measurements, {1} parameters)",
                    rows, cols);
        }
        double[] errors = new double[cols];
        final double c = Math.sqrt(getChiSquare() / (rows - cols));
View Full Code Here
317
318
319
320
321
322
323
324
325
326
327
                                            final double[] target, final double[] weights,
                                            final double[] startPoint)
        throws FunctionEvaluationException, OptimizationException, IllegalArgumentException {

        if (target.length != weights.length) {
            throw new OptimizationException("dimension mismatch {0} != {1}",
                                            target.length, weights.length);
        }

        // reset counters
        iterations           = 0;
View Full Code Here
132
133
134
135
136
137
138
139
     * of iterations is exceeded
     */
    protected void incrementIterationsCounter()
        throws OptimizationException {
        if (++iterations > maxIterations) {
            throw new OptimizationException(new MaxIterationsExceededException(maxIterations));
        }
    }
View Full Code Here
315
316
317
318
319
320
321
322
     * of iterations is exceeded
     */
    protected void incrementIterationsCounter()
        throws OptimizationException {
        if (++iterations > maxIterations) {
            throw new OptimizationException(new MaxIterationsExceededException(maxIterations));
        }
    }
View Full Code Here
TOP

Related Classes of org.apache.commons.math.optimization.OptimizationException

  • org.apache.commons.math.exception.util.DummyLocalizable
  • org.apache.commons.math.optimization.direct.DirectSearchOptimizer
  • org.apache.commons.math.optimization.direct.PowellOptimizer$LineSearch
  • org.apache.commons.math.optimization.fitting.HarmonicCoefficientsGuesser
  • org.apache.commons.math.optimization.fitting.HarmonicFitter
  • org.apache.commons.math.optimization.general.AbstractLeastSquaresOptimizer
  • org.apache.commons.math.optimization.general.AbstractScalarDifferentiableOptimizer
  • org.apache.commons.math.optimization.general.GaussNewtonOptimizer
  • org.apache.commons.math.optimization.general.LevenbergMarquardtOptimizer
  • org.apache.commons.math.optimization.general.NonLinearConjugateGradientOptimizer
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.