Package org.apache.commons.math.optimization

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

820
821
822
823
824
825
826
827
828
829
830
                for (int j = k; j < wjacobian.length; ++j) {
                    double aki = wjacobian[j][permutation[i]];
                    norm2 += aki * aki;
                }
                if (Double.isInfinite(norm2) || Double.isNaN(norm2)) {
                    throw new OptimizationException(LocalizedFormats.UNABLE_TO_PERFORM_QR_DECOMPOSITION_ON_JACOBIAN,
                            rows, cols);
                }
                if (norm2 > ak2) {
                    nextColumn = i;
                    ak2        = norm2;
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(LocalizedFormats.UNABLE_TO_BRACKET_OPTIMUM_IN_LINE_SEARCH);
    }
View Full Code Here
176
177
178
179
180
181
182
183
     * of iterations is exceeded
     */
    protected void incrementIterationsCounter()
        throws OptimizationException {
        if (++iterations > maxIterations) {
            throw new OptimizationException(new MaxIterationsExceededException(maxIterations));
        }
    }
View Full Code Here
290
291
292
293
294
295
296
297
298
            // compute the covariance matrix
            RealMatrix inverse =
                new LUDecompositionImpl(MatrixUtils.createRealMatrix(jTj)).getSolver().getInverse();
            return inverse.getData();
        } catch (InvalidMatrixException ime) {
            throw new OptimizationException(LocalizedFormats.UNABLE_TO_COMPUTE_COVARIANCE_SINGULAR_PROBLEM);
        }

    }
View Full Code Here
307
308
309
310
311
312
313
314
315
316
317
     * lesser or equal to number of parameters)
     */
    public double[] guessParametersErrors()
        throws FunctionEvaluationException, OptimizationException {
        if (rows <= cols) {
            throw new OptimizationException(
                    LocalizedFormats.NO_DEGREES_OF_FREEDOM,
                    rows, cols);
        }
        double[] errors = new double[cols];
        final double c = FastMath.sqrt(getChiSquare() / (rows - cols));
View Full Code Here
327
328
329
330
331
332
333
334
335
336
337
                                            final double[] target, final double[] weights,
                                            final double[] startPoint)
        throws FunctionEvaluationException, OptimizationException, IllegalArgumentException {

        if (target.length != weights.length) {
            throw new OptimizationException(LocalizedFormats.DIMENSIONS_MISMATCH_SIMPLE,
                                            target.length, weights.length);
        }

        // reset counters
        iterations           = 0;
View Full Code Here
138
139
140
141
142
143
144
145
     * of iterations is exceeded
     */
    protected void incrementIterationsCounter()
        throws OptimizationException {
        if (++iterations > maxIterations) {
            throw new OptimizationException(new MaxIterationsExceededException(maxIterations));
        }
    }
View Full Code Here
115
116
117
118
119
120
121
122
123
124
125
                for (int i = 0; i < cols; ++i) {
                    point[i] += dX[i];
                }

            } catch(InvalidMatrixException e) {
                throw new OptimizationException(LocalizedFormats.UNABLE_TO_SOLVE_SINGULAR_PROBLEM);
            }

            // check convergence
            if (previous != null) {
                converged = checker.converged(getIterations(), previous, current);
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
        // shall we compute the first guess of the parameters ourselves ?
        if (parameters == null) {
            final WeightedObservedPoint[] observations = fitter.getObservations();
            if (observations.length < 4) {
                throw new OptimizationException(LocalizedFormats.INSUFFICIENT_OBSERVED_POINTS_IN_SAMPLE,
                                                observations.length, 4);
            }

            HarmonicCoefficientsGuesser guesser = new HarmonicCoefficientsGuesser(observations);
            guesser.guess();
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.