View Javadoc
1   /*
2    * Licensed to the Hipparchus project under one or more
3    * contributor license agreements.  See the NOTICE file distributed with
4    * this work for additional information regarding copyright ownership.
5    * The Hipparchus project licenses this file to You under the Apache License, Version 2.0
6    * (the "License"); you may not use this file except in compliance with
7    * the License.  You may obtain a copy of the License at
8    *
9    *      https://www.apache.org/licenses/LICENSE-2.0
10   *
11   * Unless required by applicable law or agreed to in writing, software
12   * distributed under the License is distributed on an "AS IS" BASIS,
13   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14   * See the License for the specific language governing permissions and
15   * limitations under the License.
16   */
17  
18  package org.hipparchus.optim.nonlinear.vector.leastsquares;
19  
20  import java.io.IOException;
21  
22  import org.hipparchus.exception.LocalizedCoreFormats;
23  import org.hipparchus.exception.MathIllegalStateException;
24  import org.hipparchus.linear.LUDecomposer;
25  import org.hipparchus.optim.LocalizedOptimFormats;
26  import org.hipparchus.optim.SimpleVectorValueChecker;
27  import org.hipparchus.optim.nonlinear.vector.leastsquares.LeastSquaresProblem.Evaluation;
28  import org.junit.Assert;
29  import org.junit.Test;
30  
31  /**
32   * <p>Some of the unit tests are re-implementations of the MINPACK <a
33   * href="http://www.netlib.org/minpack/ex/file17">file17</a> and <a
34   * href="http://www.netlib.org/minpack/ex/file22">file22</a> test files.
35   * The redistribution policy for MINPACK is available <a
36   * href="http://www.netlib.org/minpack/disclaimer">here</a>/
37   *
38   */
39  public class SequentialGaussNewtonOptimizerWithLUTest
40      extends AbstractSequentialLeastSquaresOptimizerAbstractTest {
41      
42      
43  
44      @Override
45      public int getMaxIterations() {
46          return 1000;
47      }
48  
49      @Override
50      public void defineOptimizer(Evaluation evaluation) {
51          this.optimizer = new SequentialGaussNewtonOptimizer().
52                           withDecomposer(new LUDecomposer(1.0e-11)).
53                           withFormNormalEquations(true).
54                           withEvaluation(evaluation);
55      }
56  
57      @Override
58      @Test
59      public void testMoreEstimatedParametersSimple() {
60          try {
61              /*
62               * Exception is expected with this optimizer
63               */
64              super.testMoreEstimatedParametersSimple();
65              fail(optimizer);
66          } catch (MathIllegalStateException e) {
67              Assert.assertEquals(LocalizedOptimFormats.UNABLE_TO_SOLVE_SINGULAR_PROBLEM,
68                                  e.getSpecifier());
69          }
70      }
71  
72      @Override
73      @Test
74      public void testMoreEstimatedParametersUnsorted() {
75          try {
76              /*
77               * Exception is expected with this optimizer
78               */
79              super.testMoreEstimatedParametersUnsorted();
80              fail(optimizer);
81          } catch (MathIllegalStateException e) {
82              Assert.assertEquals(LocalizedOptimFormats.UNABLE_TO_SOLVE_SINGULAR_PROBLEM,
83                                  e.getSpecifier());
84          }
85      }
86  
87      @Test
88      public void testMaxEvaluations() throws Exception {
89          try {
90              CircleVectorial circle = new CircleVectorial();
91              circle.addPoint( 30.0,  68.0);
92              circle.addPoint( 50.0,  -6.0);
93              circle.addPoint(110.0, -20.0);
94              circle.addPoint( 35.0,  15.0);
95              circle.addPoint( 45.0,  97.0);
96  
97              LeastSquaresProblem lsp = builder(circle)
98                              .checkerPair(new SimpleVectorValueChecker(1e-30, 1e-30))
99                              .maxIterations(Integer.MAX_VALUE)
100                             .start(new double[]{98.680, 47.345})
101                             .build();
102 
103             defineOptimizer(null);
104             optimizer.optimize(lsp);
105 
106             fail(optimizer);
107         } catch (MathIllegalStateException e) {
108             Assert.assertEquals(LocalizedCoreFormats.MAX_COUNT_EXCEEDED, e.getSpecifier());
109         }
110     }
111 
112 
113     @Override
114     @Test
115     public void testHahn1()
116         throws IOException {
117         /*
118          * TODO This test leads to a singular problem with the Gauss-Newton
119          * optimizer. This should be inquired.
120          */
121         try {
122             super.testHahn1();
123         } catch (MathIllegalStateException e) {
124            Assert.assertEquals(LocalizedOptimFormats.UNABLE_TO_SOLVE_SINGULAR_PROBLEM, e.getSpecifier());
125         }
126     }
127 }