commons-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From l..@apache.org
Subject svn commit: r857590 [23/48] - in /websites/production/commons/content/proper/commons-math/xref-test: ./ org/apache/commons/math3/ org/apache/commons/math3/analysis/ org/apache/commons/math3/analysis/differentiation/ org/apache/commons/math3/analysis/fu...
Date Sun, 07 Apr 2013 07:52:13 GMT
Modified: websites/production/commons/content/proper/commons-math/xref-test/org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html
==============================================================================
--- websites/production/commons/content/proper/commons-math/xref-test/org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html (original)
+++ websites/production/commons/content/proper/commons-math/xref-test/org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html Sun Apr  7 07:52:05 2013
@@ -37,151 +37,151 @@
 <a class="jxr_linenumber" name="27" href="#27">27</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.analysis.solvers.BrentSolver;
 <a class="jxr_linenumber" name="28" href="#28">28</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.exception.DimensionMismatchException;
 <a class="jxr_linenumber" name="29" href="#29">29</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.exception.MathIllegalArgumentException;
-<a class="jxr_linenumber" name="30" href="#30">30</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.geometry.euclidean.twod.Vector2D;
-<a class="jxr_linenumber" name="31" href="#31">31</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.linear.BlockRealMatrix;
-<a class="jxr_linenumber" name="32" href="#32">32</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.linear.RealMatrix;
-<a class="jxr_linenumber" name="33" href="#33">33</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.optim.nonlinear.scalar.GoalType;
+<a class="jxr_linenumber" name="30" href="#30">30</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.exception.MathUnsupportedOperationException;
+<a class="jxr_linenumber" name="31" href="#31">31</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.geometry.euclidean.twod.Vector2D;
+<a class="jxr_linenumber" name="32" href="#32">32</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.linear.BlockRealMatrix;
+<a class="jxr_linenumber" name="33" href="#33">33</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.linear.RealMatrix;
 <a class="jxr_linenumber" name="34" href="#34">34</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.optim.PointValuePair;
 <a class="jxr_linenumber" name="35" href="#35">35</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.optim.SimpleValueChecker;
 <a class="jxr_linenumber" name="36" href="#36">36</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.optim.InitialGuess;
 <a class="jxr_linenumber" name="37" href="#37">37</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.optim.MaxEval;
-<a class="jxr_linenumber" name="38" href="#38">38</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.optim.nonlinear.scalar.ObjectiveFunction;
-<a class="jxr_linenumber" name="39" href="#39">39</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.optim.nonlinear.scalar.ObjectiveFunctionGradient;
-<a class="jxr_linenumber" name="40" href="#40">40</a>  <strong class="jxr_keyword">import</strong> org.junit.Assert;
-<a class="jxr_linenumber" name="41" href="#41">41</a>  <strong class="jxr_keyword">import</strong> org.junit.Test;
-<a class="jxr_linenumber" name="42" href="#42">42</a>  
-<a class="jxr_linenumber" name="43" href="#43">43</a>  <em class="jxr_javadoccomment">/**</em>
-<a class="jxr_linenumber" name="44" href="#44">44</a>  <em class="jxr_javadoccomment"> * &lt;p&gt;Some of the unit tests are re-implementations of the MINPACK &lt;a</em>
-<a class="jxr_linenumber" name="45" href="#45">45</a>  <em class="jxr_javadoccomment"> * href="<a href="http://www.netlib.org/minpack/ex/file17" target="alexandria_uri">http://www.netlib.org/minpack/ex/file17</a>"&gt;file17&lt;/a&gt; and &lt;a</em>
-<a class="jxr_linenumber" name="46" href="#46">46</a>  <em class="jxr_javadoccomment"> * href="<a href="http://www.netlib.org/minpack/ex/file22" target="alexandria_uri">http://www.netlib.org/minpack/ex/file22</a>"&gt;file22&lt;/a&gt; test files.</em>
-<a class="jxr_linenumber" name="47" href="#47">47</a>  <em class="jxr_javadoccomment"> * The redistribution policy for MINPACK is available &lt;a</em>
-<a class="jxr_linenumber" name="48" href="#48">48</a>  <em class="jxr_javadoccomment"> * href="<a href="http://www.netlib.org/minpack/disclaimer" target="alexandria_uri">http://www.netlib.org/minpack/disclaimer</a>"&gt;here&lt;/a&gt;, for</em>
-<a class="jxr_linenumber" name="49" href="#49">49</a>  <em class="jxr_javadoccomment"> * convenience, it is reproduced below.&lt;/p&gt;</em>
-<a class="jxr_linenumber" name="50" href="#50">50</a>  <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="51" href="#51">51</a>  <em class="jxr_javadoccomment"> * &lt;table border="0" width="80%" cellpadding="10" align="center" bgcolor="#E0E0E0"&gt;</em>
-<a class="jxr_linenumber" name="52" href="#52">52</a>  <em class="jxr_javadoccomment"> * &lt;tr&gt;&lt;td&gt;</em>
-<a class="jxr_linenumber" name="53" href="#53">53</a>  <em class="jxr_javadoccomment"> *    Minpack Copyright Notice (1999) University of Chicago.</em>
-<a class="jxr_linenumber" name="54" href="#54">54</a>  <em class="jxr_javadoccomment"> *    All rights reserved</em>
-<a class="jxr_linenumber" name="55" href="#55">55</a>  <em class="jxr_javadoccomment"> * &lt;/td&gt;&lt;/tr&gt;</em>
-<a class="jxr_linenumber" name="56" href="#56">56</a>  <em class="jxr_javadoccomment"> * &lt;tr&gt;&lt;td&gt;</em>
-<a class="jxr_linenumber" name="57" href="#57">57</a>  <em class="jxr_javadoccomment"> * Redistribution and use in source and binary forms, with or without</em>
-<a class="jxr_linenumber" name="58" href="#58">58</a>  <em class="jxr_javadoccomment"> * modification, are permitted provided that the following conditions</em>
-<a class="jxr_linenumber" name="59" href="#59">59</a>  <em class="jxr_javadoccomment"> * are met:</em>
-<a class="jxr_linenumber" name="60" href="#60">60</a>  <em class="jxr_javadoccomment"> * &lt;ol&gt;</em>
-<a class="jxr_linenumber" name="61" href="#61">61</a>  <em class="jxr_javadoccomment"> *  &lt;li&gt;Redistributions of source code must retain the above copyright</em>
-<a class="jxr_linenumber" name="62" href="#62">62</a>  <em class="jxr_javadoccomment"> *      notice, this list of conditions and the following disclaimer.&lt;/li&gt;</em>
-<a class="jxr_linenumber" name="63" href="#63">63</a>  <em class="jxr_javadoccomment"> * &lt;li&gt;Redistributions in binary form must reproduce the above</em>
-<a class="jxr_linenumber" name="64" href="#64">64</a>  <em class="jxr_javadoccomment"> *     copyright notice, this list of conditions and the following</em>
-<a class="jxr_linenumber" name="65" href="#65">65</a>  <em class="jxr_javadoccomment"> *     disclaimer in the documentation and/or other materials provided</em>
-<a class="jxr_linenumber" name="66" href="#66">66</a>  <em class="jxr_javadoccomment"> *     with the distribution.&lt;/li&gt;</em>
-<a class="jxr_linenumber" name="67" href="#67">67</a>  <em class="jxr_javadoccomment"> * &lt;li&gt;The end-user documentation included with the redistribution, if any,</em>
-<a class="jxr_linenumber" name="68" href="#68">68</a>  <em class="jxr_javadoccomment"> *     must include the following acknowledgment:</em>
-<a class="jxr_linenumber" name="69" href="#69">69</a>  <em class="jxr_javadoccomment"> *     &lt;code&gt;This product includes software developed by the University of</em>
-<a class="jxr_linenumber" name="70" href="#70">70</a>  <em class="jxr_javadoccomment"> *           Chicago, as Operator of Argonne National Laboratory.&lt;/code&gt;</em>
-<a class="jxr_linenumber" name="71" href="#71">71</a>  <em class="jxr_javadoccomment"> *     Alternately, this acknowledgment may appear in the software itself,</em>
-<a class="jxr_linenumber" name="72" href="#72">72</a>  <em class="jxr_javadoccomment"> *     if and wherever such third-party acknowledgments normally appear.&lt;/li&gt;</em>
-<a class="jxr_linenumber" name="73" href="#73">73</a>  <em class="jxr_javadoccomment"> * &lt;li&gt;&lt;strong&gt;WARRANTY DISCLAIMER. THE SOFTWARE IS SUPPLIED "AS IS"</em>
-<a class="jxr_linenumber" name="74" href="#74">74</a>  <em class="jxr_javadoccomment"> *     WITHOUT WARRANTY OF ANY KIND. THE COPYRIGHT HOLDER, THE</em>
-<a class="jxr_linenumber" name="75" href="#75">75</a>  <em class="jxr_javadoccomment"> *     UNITED STATES, THE UNITED STATES DEPARTMENT OF ENERGY, AND</em>
-<a class="jxr_linenumber" name="76" href="#76">76</a>  <em class="jxr_javadoccomment"> *     THEIR EMPLOYEES: (1) DISCLAIM ANY WARRANTIES, EXPRESS OR</em>
-<a class="jxr_linenumber" name="77" href="#77">77</a>  <em class="jxr_javadoccomment"> *     IMPLIED, INCLUDING BUT NOT LIMITED TO ANY IMPLIED WARRANTIES</em>
-<a class="jxr_linenumber" name="78" href="#78">78</a>  <em class="jxr_javadoccomment"> *     OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE</em>
-<a class="jxr_linenumber" name="79" href="#79">79</a>  <em class="jxr_javadoccomment"> *     OR NON-INFRINGEMENT, (2) DO NOT ASSUME ANY LEGAL LIABILITY</em>
-<a class="jxr_linenumber" name="80" href="#80">80</a>  <em class="jxr_javadoccomment"> *     OR RESPONSIBILITY FOR THE ACCURACY, COMPLETENESS, OR</em>
-<a class="jxr_linenumber" name="81" href="#81">81</a>  <em class="jxr_javadoccomment"> *     USEFULNESS OF THE SOFTWARE, (3) DO NOT REPRESENT THAT USE OF</em>
-<a class="jxr_linenumber" name="82" href="#82">82</a>  <em class="jxr_javadoccomment"> *     THE SOFTWARE WOULD NOT INFRINGE PRIVATELY OWNED RIGHTS, (4)</em>
-<a class="jxr_linenumber" name="83" href="#83">83</a>  <em class="jxr_javadoccomment"> *     DO NOT WARRANT THAT THE SOFTWARE WILL FUNCTION</em>
-<a class="jxr_linenumber" name="84" href="#84">84</a>  <em class="jxr_javadoccomment"> *     UNINTERRUPTED, THAT IT IS ERROR-FREE OR THAT ANY ERRORS WILL</em>
-<a class="jxr_linenumber" name="85" href="#85">85</a>  <em class="jxr_javadoccomment"> *     BE CORRECTED.&lt;/strong&gt;&lt;/li&gt;</em>
-<a class="jxr_linenumber" name="86" href="#86">86</a>  <em class="jxr_javadoccomment"> * &lt;li&gt;&lt;strong&gt;LIMITATION OF LIABILITY. IN NO EVENT WILL THE COPYRIGHT</em>
-<a class="jxr_linenumber" name="87" href="#87">87</a>  <em class="jxr_javadoccomment"> *     HOLDER, THE UNITED STATES, THE UNITED STATES DEPARTMENT OF</em>
-<a class="jxr_linenumber" name="88" href="#88">88</a>  <em class="jxr_javadoccomment"> *     ENERGY, OR THEIR EMPLOYEES: BE LIABLE FOR ANY INDIRECT,</em>
-<a class="jxr_linenumber" name="89" href="#89">89</a>  <em class="jxr_javadoccomment"> *     INCIDENTAL, CONSEQUENTIAL, SPECIAL OR PUNITIVE DAMAGES OF</em>
-<a class="jxr_linenumber" name="90" href="#90">90</a>  <em class="jxr_javadoccomment"> *     ANY KIND OR NATURE, INCLUDING BUT NOT LIMITED TO LOSS OF</em>
-<a class="jxr_linenumber" name="91" href="#91">91</a>  <em class="jxr_javadoccomment"> *     PROFITS OR LOSS OF DATA, FOR ANY REASON WHATSOEVER, WHETHER</em>
-<a class="jxr_linenumber" name="92" href="#92">92</a>  <em class="jxr_javadoccomment"> *     SUCH LIABILITY IS ASSERTED ON THE BASIS OF CONTRACT, TORT</em>
-<a class="jxr_linenumber" name="93" href="#93">93</a>  <em class="jxr_javadoccomment"> *     (INCLUDING NEGLIGENCE OR STRICT LIABILITY), OR OTHERWISE,</em>
-<a class="jxr_linenumber" name="94" href="#94">94</a>  <em class="jxr_javadoccomment"> *     EVEN IF ANY OF SAID PARTIES HAS BEEN WARNED OF THE</em>
-<a class="jxr_linenumber" name="95" href="#95">95</a>  <em class="jxr_javadoccomment"> *     POSSIBILITY OF SUCH LOSS OR DAMAGES.&lt;/strong&gt;&lt;/li&gt;</em>
-<a class="jxr_linenumber" name="96" href="#96">96</a>  <em class="jxr_javadoccomment"> * &lt;ol&gt;&lt;/td&gt;&lt;/tr&gt;</em>
-<a class="jxr_linenumber" name="97" href="#97">97</a>  <em class="jxr_javadoccomment"> * &lt;/table&gt;</em>
-<a class="jxr_linenumber" name="98" href="#98">98</a>  <em class="jxr_javadoccomment"> *</em>
-<a class="jxr_linenumber" name="99" href="#99">99</a>  <em class="jxr_javadoccomment"> * @author Argonne National Laboratory. MINPACK project. March 1980 (original fortran minpack tests)</em>
-<a class="jxr_linenumber" name="100" href="#100">100</a> <em class="jxr_javadoccomment"> * @author Burton S. Garbow (original fortran minpack tests)</em>
-<a class="jxr_linenumber" name="101" href="#101">101</a> <em class="jxr_javadoccomment"> * @author Kenneth E. Hillstrom (original fortran minpack tests)</em>
-<a class="jxr_linenumber" name="102" href="#102">102</a> <em class="jxr_javadoccomment"> * @author Jorge J. More (original fortran minpack tests)</em>
-<a class="jxr_linenumber" name="103" href="#103">103</a> <em class="jxr_javadoccomment"> * @author Luc Maisonobe (non-minpack tests and minpack tests Java translation)</em>
-<a class="jxr_linenumber" name="104" href="#104">104</a> <em class="jxr_javadoccomment"> */</em>
-<a class="jxr_linenumber" name="105" href="#105">105</a> <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">class</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">NonLinearConjugateGradientOptimizerTest</a> {
-<a class="jxr_linenumber" name="106" href="#106">106</a>     @Test
-<a class="jxr_linenumber" name="107" href="#107">107</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testTrivial() {
-<a class="jxr_linenumber" name="108" href="#108">108</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem
-<a class="jxr_linenumber" name="109" href="#109">109</a>             = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] { { 2 } }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 3 });
-<a class="jxr_linenumber" name="110" href="#110">110</a>         NonLinearConjugateGradientOptimizer optimizer
-<a class="jxr_linenumber" name="111" href="#111">111</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
-<a class="jxr_linenumber" name="112" href="#112">112</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-6, 1e-6));
-<a class="jxr_linenumber" name="113" href="#113">113</a>         PointValuePair optimum
-<a class="jxr_linenumber" name="114" href="#114">114</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(100),
-<a class="jxr_linenumber" name="115" href="#115">115</a>                                  problem.getObjectiveFunction(),
-<a class="jxr_linenumber" name="116" href="#116">116</a>                                  problem.getObjectiveFunctionGradient(),
-<a class="jxr_linenumber" name="117" href="#117">117</a>                                  GoalType.MINIMIZE,
-<a class="jxr_linenumber" name="118" href="#118">118</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0 }));
-<a class="jxr_linenumber" name="119" href="#119">119</a>         Assert.assertEquals(1.5, optimum.getPoint()[0], 1.0e-10);
-<a class="jxr_linenumber" name="120" href="#120">120</a>         Assert.assertEquals(0.0, optimum.getValue(), 1.0e-10);
-<a class="jxr_linenumber" name="121" href="#121">121</a>     }
-<a class="jxr_linenumber" name="122" href="#122">122</a> 
-<a class="jxr_linenumber" name="123" href="#123">123</a>     @Test
-<a class="jxr_linenumber" name="124" href="#124">124</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testColumnsPermutation() {
-<a class="jxr_linenumber" name="125" href="#125">125</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem
-<a class="jxr_linenumber" name="126" href="#126">126</a>             = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] { { 1.0, -1.0 }, { 0.0, 2.0 }, { 1.0, -2.0 } },
-<a class="jxr_linenumber" name="127" href="#127">127</a>                                 <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 4.0, 6.0, 1.0 });
-<a class="jxr_linenumber" name="128" href="#128">128</a> 
-<a class="jxr_linenumber" name="129" href="#129">129</a>         NonLinearConjugateGradientOptimizer optimizer
-<a class="jxr_linenumber" name="130" href="#130">130</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
-<a class="jxr_linenumber" name="131" href="#131">131</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-6, 1e-6));
-<a class="jxr_linenumber" name="132" href="#132">132</a>         PointValuePair optimum
-<a class="jxr_linenumber" name="133" href="#133">133</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(100),
-<a class="jxr_linenumber" name="134" href="#134">134</a>                                  problem.getObjectiveFunction(),
-<a class="jxr_linenumber" name="135" href="#135">135</a>                                  problem.getObjectiveFunctionGradient(),
-<a class="jxr_linenumber" name="136" href="#136">136</a>                                  GoalType.MINIMIZE,
-<a class="jxr_linenumber" name="137" href="#137">137</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0, 0 }));
-<a class="jxr_linenumber" name="138" href="#138">138</a>         Assert.assertEquals(7.0, optimum.getPoint()[0], 1.0e-10);
-<a class="jxr_linenumber" name="139" href="#139">139</a>         Assert.assertEquals(3.0, optimum.getPoint()[1], 1.0e-10);
-<a class="jxr_linenumber" name="140" href="#140">140</a>         Assert.assertEquals(0.0, optimum.getValue(), 1.0e-10);
-<a class="jxr_linenumber" name="141" href="#141">141</a> 
+<a class="jxr_linenumber" name="38" href="#38">38</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.optim.SimpleBounds;
+<a class="jxr_linenumber" name="39" href="#39">39</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.optim.nonlinear.scalar.ObjectiveFunction;
+<a class="jxr_linenumber" name="40" href="#40">40</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.optim.nonlinear.scalar.GoalType;
+<a class="jxr_linenumber" name="41" href="#41">41</a>  <strong class="jxr_keyword">import</strong> org.apache.commons.math3.optim.nonlinear.scalar.ObjectiveFunctionGradient;
+<a class="jxr_linenumber" name="42" href="#42">42</a>  <strong class="jxr_keyword">import</strong> org.junit.Assert;
+<a class="jxr_linenumber" name="43" href="#43">43</a>  <strong class="jxr_keyword">import</strong> org.junit.Test;
+<a class="jxr_linenumber" name="44" href="#44">44</a>  
+<a class="jxr_linenumber" name="45" href="#45">45</a>  <em class="jxr_javadoccomment">/**</em>
+<a class="jxr_linenumber" name="46" href="#46">46</a>  <em class="jxr_javadoccomment"> * &lt;p&gt;Some of the unit tests are re-implementations of the MINPACK &lt;a</em>
+<a class="jxr_linenumber" name="47" href="#47">47</a>  <em class="jxr_javadoccomment"> * href="<a href="http://www.netlib.org/minpack/ex/file17" target="alexandria_uri">http://www.netlib.org/minpack/ex/file17</a>"&gt;file17&lt;/a&gt; and &lt;a</em>
+<a class="jxr_linenumber" name="48" href="#48">48</a>  <em class="jxr_javadoccomment"> * href="<a href="http://www.netlib.org/minpack/ex/file22" target="alexandria_uri">http://www.netlib.org/minpack/ex/file22</a>"&gt;file22&lt;/a&gt; test files.</em>
+<a class="jxr_linenumber" name="49" href="#49">49</a>  <em class="jxr_javadoccomment"> * The redistribution policy for MINPACK is available &lt;a</em>
+<a class="jxr_linenumber" name="50" href="#50">50</a>  <em class="jxr_javadoccomment"> * href="<a href="http://www.netlib.org/minpack/disclaimer" target="alexandria_uri">http://www.netlib.org/minpack/disclaimer</a>"&gt;here&lt;/a&gt;, for</em>
+<a class="jxr_linenumber" name="51" href="#51">51</a>  <em class="jxr_javadoccomment"> * convenience, it is reproduced below.&lt;/p&gt;</em>
+<a class="jxr_linenumber" name="52" href="#52">52</a>  <em class="jxr_javadoccomment"> *</em>
+<a class="jxr_linenumber" name="53" href="#53">53</a>  <em class="jxr_javadoccomment"> * &lt;table border="0" width="80%" cellpadding="10" align="center" bgcolor="#E0E0E0"&gt;</em>
+<a class="jxr_linenumber" name="54" href="#54">54</a>  <em class="jxr_javadoccomment"> * &lt;tr&gt;&lt;td&gt;</em>
+<a class="jxr_linenumber" name="55" href="#55">55</a>  <em class="jxr_javadoccomment"> *    Minpack Copyright Notice (1999) University of Chicago.</em>
+<a class="jxr_linenumber" name="56" href="#56">56</a>  <em class="jxr_javadoccomment"> *    All rights reserved</em>
+<a class="jxr_linenumber" name="57" href="#57">57</a>  <em class="jxr_javadoccomment"> * &lt;/td&gt;&lt;/tr&gt;</em>
+<a class="jxr_linenumber" name="58" href="#58">58</a>  <em class="jxr_javadoccomment"> * &lt;tr&gt;&lt;td&gt;</em>
+<a class="jxr_linenumber" name="59" href="#59">59</a>  <em class="jxr_javadoccomment"> * Redistribution and use in source and binary forms, with or without</em>
+<a class="jxr_linenumber" name="60" href="#60">60</a>  <em class="jxr_javadoccomment"> * modification, are permitted provided that the following conditions</em>
+<a class="jxr_linenumber" name="61" href="#61">61</a>  <em class="jxr_javadoccomment"> * are met:</em>
+<a class="jxr_linenumber" name="62" href="#62">62</a>  <em class="jxr_javadoccomment"> * &lt;ol&gt;</em>
+<a class="jxr_linenumber" name="63" href="#63">63</a>  <em class="jxr_javadoccomment"> *  &lt;li&gt;Redistributions of source code must retain the above copyright</em>
+<a class="jxr_linenumber" name="64" href="#64">64</a>  <em class="jxr_javadoccomment"> *      notice, this list of conditions and the following disclaimer.&lt;/li&gt;</em>
+<a class="jxr_linenumber" name="65" href="#65">65</a>  <em class="jxr_javadoccomment"> * &lt;li&gt;Redistributions in binary form must reproduce the above</em>
+<a class="jxr_linenumber" name="66" href="#66">66</a>  <em class="jxr_javadoccomment"> *     copyright notice, this list of conditions and the following</em>
+<a class="jxr_linenumber" name="67" href="#67">67</a>  <em class="jxr_javadoccomment"> *     disclaimer in the documentation and/or other materials provided</em>
+<a class="jxr_linenumber" name="68" href="#68">68</a>  <em class="jxr_javadoccomment"> *     with the distribution.&lt;/li&gt;</em>
+<a class="jxr_linenumber" name="69" href="#69">69</a>  <em class="jxr_javadoccomment"> * &lt;li&gt;The end-user documentation included with the redistribution, if any,</em>
+<a class="jxr_linenumber" name="70" href="#70">70</a>  <em class="jxr_javadoccomment"> *     must include the following acknowledgment:</em>
+<a class="jxr_linenumber" name="71" href="#71">71</a>  <em class="jxr_javadoccomment"> *     &lt;code&gt;This product includes software developed by the University of</em>
+<a class="jxr_linenumber" name="72" href="#72">72</a>  <em class="jxr_javadoccomment"> *           Chicago, as Operator of Argonne National Laboratory.&lt;/code&gt;</em>
+<a class="jxr_linenumber" name="73" href="#73">73</a>  <em class="jxr_javadoccomment"> *     Alternately, this acknowledgment may appear in the software itself,</em>
+<a class="jxr_linenumber" name="74" href="#74">74</a>  <em class="jxr_javadoccomment"> *     if and wherever such third-party acknowledgments normally appear.&lt;/li&gt;</em>
+<a class="jxr_linenumber" name="75" href="#75">75</a>  <em class="jxr_javadoccomment"> * &lt;li&gt;&lt;strong&gt;WARRANTY DISCLAIMER. THE SOFTWARE IS SUPPLIED "AS IS"</em>
+<a class="jxr_linenumber" name="76" href="#76">76</a>  <em class="jxr_javadoccomment"> *     WITHOUT WARRANTY OF ANY KIND. THE COPYRIGHT HOLDER, THE</em>
+<a class="jxr_linenumber" name="77" href="#77">77</a>  <em class="jxr_javadoccomment"> *     UNITED STATES, THE UNITED STATES DEPARTMENT OF ENERGY, AND</em>
+<a class="jxr_linenumber" name="78" href="#78">78</a>  <em class="jxr_javadoccomment"> *     THEIR EMPLOYEES: (1) DISCLAIM ANY WARRANTIES, EXPRESS OR</em>
+<a class="jxr_linenumber" name="79" href="#79">79</a>  <em class="jxr_javadoccomment"> *     IMPLIED, INCLUDING BUT NOT LIMITED TO ANY IMPLIED WARRANTIES</em>
+<a class="jxr_linenumber" name="80" href="#80">80</a>  <em class="jxr_javadoccomment"> *     OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE</em>
+<a class="jxr_linenumber" name="81" href="#81">81</a>  <em class="jxr_javadoccomment"> *     OR NON-INFRINGEMENT, (2) DO NOT ASSUME ANY LEGAL LIABILITY</em>
+<a class="jxr_linenumber" name="82" href="#82">82</a>  <em class="jxr_javadoccomment"> *     OR RESPONSIBILITY FOR THE ACCURACY, COMPLETENESS, OR</em>
+<a class="jxr_linenumber" name="83" href="#83">83</a>  <em class="jxr_javadoccomment"> *     USEFULNESS OF THE SOFTWARE, (3) DO NOT REPRESENT THAT USE OF</em>
+<a class="jxr_linenumber" name="84" href="#84">84</a>  <em class="jxr_javadoccomment"> *     THE SOFTWARE WOULD NOT INFRINGE PRIVATELY OWNED RIGHTS, (4)</em>
+<a class="jxr_linenumber" name="85" href="#85">85</a>  <em class="jxr_javadoccomment"> *     DO NOT WARRANT THAT THE SOFTWARE WILL FUNCTION</em>
+<a class="jxr_linenumber" name="86" href="#86">86</a>  <em class="jxr_javadoccomment"> *     UNINTERRUPTED, THAT IT IS ERROR-FREE OR THAT ANY ERRORS WILL</em>
+<a class="jxr_linenumber" name="87" href="#87">87</a>  <em class="jxr_javadoccomment"> *     BE CORRECTED.&lt;/strong&gt;&lt;/li&gt;</em>
+<a class="jxr_linenumber" name="88" href="#88">88</a>  <em class="jxr_javadoccomment"> * &lt;li&gt;&lt;strong&gt;LIMITATION OF LIABILITY. IN NO EVENT WILL THE COPYRIGHT</em>
+<a class="jxr_linenumber" name="89" href="#89">89</a>  <em class="jxr_javadoccomment"> *     HOLDER, THE UNITED STATES, THE UNITED STATES DEPARTMENT OF</em>
+<a class="jxr_linenumber" name="90" href="#90">90</a>  <em class="jxr_javadoccomment"> *     ENERGY, OR THEIR EMPLOYEES: BE LIABLE FOR ANY INDIRECT,</em>
+<a class="jxr_linenumber" name="91" href="#91">91</a>  <em class="jxr_javadoccomment"> *     INCIDENTAL, CONSEQUENTIAL, SPECIAL OR PUNITIVE DAMAGES OF</em>
+<a class="jxr_linenumber" name="92" href="#92">92</a>  <em class="jxr_javadoccomment"> *     ANY KIND OR NATURE, INCLUDING BUT NOT LIMITED TO LOSS OF</em>
+<a class="jxr_linenumber" name="93" href="#93">93</a>  <em class="jxr_javadoccomment"> *     PROFITS OR LOSS OF DATA, FOR ANY REASON WHATSOEVER, WHETHER</em>
+<a class="jxr_linenumber" name="94" href="#94">94</a>  <em class="jxr_javadoccomment"> *     SUCH LIABILITY IS ASSERTED ON THE BASIS OF CONTRACT, TORT</em>
+<a class="jxr_linenumber" name="95" href="#95">95</a>  <em class="jxr_javadoccomment"> *     (INCLUDING NEGLIGENCE OR STRICT LIABILITY), OR OTHERWISE,</em>
+<a class="jxr_linenumber" name="96" href="#96">96</a>  <em class="jxr_javadoccomment"> *     EVEN IF ANY OF SAID PARTIES HAS BEEN WARNED OF THE</em>
+<a class="jxr_linenumber" name="97" href="#97">97</a>  <em class="jxr_javadoccomment"> *     POSSIBILITY OF SUCH LOSS OR DAMAGES.&lt;/strong&gt;&lt;/li&gt;</em>
+<a class="jxr_linenumber" name="98" href="#98">98</a>  <em class="jxr_javadoccomment"> * &lt;ol&gt;&lt;/td&gt;&lt;/tr&gt;</em>
+<a class="jxr_linenumber" name="99" href="#99">99</a>  <em class="jxr_javadoccomment"> * &lt;/table&gt;</em>
+<a class="jxr_linenumber" name="100" href="#100">100</a> <em class="jxr_javadoccomment"> *</em>
+<a class="jxr_linenumber" name="101" href="#101">101</a> <em class="jxr_javadoccomment"> * @author Argonne National Laboratory. MINPACK project. March 1980 (original fortran minpack tests)</em>
+<a class="jxr_linenumber" name="102" href="#102">102</a> <em class="jxr_javadoccomment"> * @author Burton S. Garbow (original fortran minpack tests)</em>
+<a class="jxr_linenumber" name="103" href="#103">103</a> <em class="jxr_javadoccomment"> * @author Kenneth E. Hillstrom (original fortran minpack tests)</em>
+<a class="jxr_linenumber" name="104" href="#104">104</a> <em class="jxr_javadoccomment"> * @author Jorge J. More (original fortran minpack tests)</em>
+<a class="jxr_linenumber" name="105" href="#105">105</a> <em class="jxr_javadoccomment"> * @author Luc Maisonobe (non-minpack tests and minpack tests Java translation)</em>
+<a class="jxr_linenumber" name="106" href="#106">106</a> <em class="jxr_javadoccomment"> */</em>
+<a class="jxr_linenumber" name="107" href="#107">107</a> <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">class</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">NonLinearConjugateGradientOptimizerTest</a> {
+<a class="jxr_linenumber" name="108" href="#108">108</a>     @Test(expected=MathUnsupportedOperationException.<strong class="jxr_keyword">class</strong>)
+<a class="jxr_linenumber" name="109" href="#109">109</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testBoundsUnsupported() {
+<a class="jxr_linenumber" name="110" href="#110">110</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem
+<a class="jxr_linenumber" name="111" href="#111">111</a>             = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] { { 2 } }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 3 });
+<a class="jxr_linenumber" name="112" href="#112">112</a>         NonLinearConjugateGradientOptimizer optimizer
+<a class="jxr_linenumber" name="113" href="#113">113</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
+<a class="jxr_linenumber" name="114" href="#114">114</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-6, 1e-6));
+<a class="jxr_linenumber" name="115" href="#115">115</a>         optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(100),
+<a class="jxr_linenumber" name="116" href="#116">116</a>                            problem.getObjectiveFunction(),
+<a class="jxr_linenumber" name="117" href="#117">117</a>                            problem.getObjectiveFunctionGradient(),
+<a class="jxr_linenumber" name="118" href="#118">118</a>                            GoalType.MINIMIZE,
+<a class="jxr_linenumber" name="119" href="#119">119</a>                            <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0 }),
+<a class="jxr_linenumber" name="120" href="#120">120</a>                            <strong class="jxr_keyword">new</strong> SimpleBounds(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { -1 },
+<a class="jxr_linenumber" name="121" href="#121">121</a>                                             <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 1 }));
+<a class="jxr_linenumber" name="122" href="#122">122</a>     }
+<a class="jxr_linenumber" name="123" href="#123">123</a> 
+<a class="jxr_linenumber" name="124" href="#124">124</a>     @Test
+<a class="jxr_linenumber" name="125" href="#125">125</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testTrivial() {
+<a class="jxr_linenumber" name="126" href="#126">126</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem
+<a class="jxr_linenumber" name="127" href="#127">127</a>             = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] { { 2 } }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 3 });
+<a class="jxr_linenumber" name="128" href="#128">128</a>         NonLinearConjugateGradientOptimizer optimizer
+<a class="jxr_linenumber" name="129" href="#129">129</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
+<a class="jxr_linenumber" name="130" href="#130">130</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-6, 1e-6));
+<a class="jxr_linenumber" name="131" href="#131">131</a>         PointValuePair optimum
+<a class="jxr_linenumber" name="132" href="#132">132</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(100),
+<a class="jxr_linenumber" name="133" href="#133">133</a>                                  problem.getObjectiveFunction(),
+<a class="jxr_linenumber" name="134" href="#134">134</a>                                  problem.getObjectiveFunctionGradient(),
+<a class="jxr_linenumber" name="135" href="#135">135</a>                                  GoalType.MINIMIZE,
+<a class="jxr_linenumber" name="136" href="#136">136</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0 }));
+<a class="jxr_linenumber" name="137" href="#137">137</a>         Assert.assertEquals(1.5, optimum.getPoint()[0], 1.0e-10);
+<a class="jxr_linenumber" name="138" href="#138">138</a>         Assert.assertEquals(0.0, optimum.getValue(), 1.0e-10);
+<a class="jxr_linenumber" name="139" href="#139">139</a> 
+<a class="jxr_linenumber" name="140" href="#140">140</a>         <em class="jxr_comment">// Check that the number of iterations is updated (MATH-949).</em>
+<a class="jxr_linenumber" name="141" href="#141">141</a>         Assert.assertTrue(optimizer.getIterations() &gt; 0);
 <a class="jxr_linenumber" name="142" href="#142">142</a>     }
 <a class="jxr_linenumber" name="143" href="#143">143</a> 
 <a class="jxr_linenumber" name="144" href="#144">144</a>     @Test
-<a class="jxr_linenumber" name="145" href="#145">145</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testNoDependency() {
-<a class="jxr_linenumber" name="146" href="#146">146</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
-<a class="jxr_linenumber" name="147" href="#147">147</a>                 { 2, 0, 0, 0, 0, 0 },
-<a class="jxr_linenumber" name="148" href="#148">148</a>                 { 0, 2, 0, 0, 0, 0 },
-<a class="jxr_linenumber" name="149" href="#149">149</a>                 { 0, 0, 2, 0, 0, 0 },
-<a class="jxr_linenumber" name="150" href="#150">150</a>                 { 0, 0, 0, 2, 0, 0 },
-<a class="jxr_linenumber" name="151" href="#151">151</a>                 { 0, 0, 0, 0, 2, 0 },
-<a class="jxr_linenumber" name="152" href="#152">152</a>                 { 0, 0, 0, 0, 0, 2 }
-<a class="jxr_linenumber" name="153" href="#153">153</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0.0, 1.1, 2.2, 3.3, 4.4, 5.5 });
-<a class="jxr_linenumber" name="154" href="#154">154</a>         NonLinearConjugateGradientOptimizer optimizer
-<a class="jxr_linenumber" name="155" href="#155">155</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
-<a class="jxr_linenumber" name="156" href="#156">156</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-6, 1e-6));
-<a class="jxr_linenumber" name="157" href="#157">157</a>         PointValuePair optimum
-<a class="jxr_linenumber" name="158" href="#158">158</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(100),
-<a class="jxr_linenumber" name="159" href="#159">159</a>                                  problem.getObjectiveFunction(),
-<a class="jxr_linenumber" name="160" href="#160">160</a>                                  problem.getObjectiveFunctionGradient(),
-<a class="jxr_linenumber" name="161" href="#161">161</a>                                  GoalType.MINIMIZE,
-<a class="jxr_linenumber" name="162" href="#162">162</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0, 0, 0, 0, 0, 0 }));
-<a class="jxr_linenumber" name="163" href="#163">163</a>         <strong class="jxr_keyword">for</strong> (<strong class="jxr_keyword">int</strong> i = 0; i &lt; problem.target.length; ++i) {
-<a class="jxr_linenumber" name="164" href="#164">164</a>             Assert.assertEquals(0.55 * i, optimum.getPoint()[i], 1.0e-10);
-<a class="jxr_linenumber" name="165" href="#165">165</a>         }
-<a class="jxr_linenumber" name="166" href="#166">166</a>     }
-<a class="jxr_linenumber" name="167" href="#167">167</a> 
-<a class="jxr_linenumber" name="168" href="#168">168</a>     @Test
-<a class="jxr_linenumber" name="169" href="#169">169</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testOneSet() {
-<a class="jxr_linenumber" name="170" href="#170">170</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
-<a class="jxr_linenumber" name="171" href="#171">171</a>                 {  1,  0, 0 },
-<a class="jxr_linenumber" name="172" href="#172">172</a>                 { -1,  1, 0 },
-<a class="jxr_linenumber" name="173" href="#173">173</a>                 {  0, -1, 1 }
-<a class="jxr_linenumber" name="174" href="#174">174</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 1, 1, 1});
+<a class="jxr_linenumber" name="145" href="#145">145</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testColumnsPermutation() {
+<a class="jxr_linenumber" name="146" href="#146">146</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem
+<a class="jxr_linenumber" name="147" href="#147">147</a>             = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] { { 1.0, -1.0 }, { 0.0, 2.0 }, { 1.0, -2.0 } },
+<a class="jxr_linenumber" name="148" href="#148">148</a>                                 <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 4.0, 6.0, 1.0 });
+<a class="jxr_linenumber" name="149" href="#149">149</a> 
+<a class="jxr_linenumber" name="150" href="#150">150</a>         NonLinearConjugateGradientOptimizer optimizer
+<a class="jxr_linenumber" name="151" href="#151">151</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
+<a class="jxr_linenumber" name="152" href="#152">152</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-6, 1e-6));
+<a class="jxr_linenumber" name="153" href="#153">153</a>         PointValuePair optimum
+<a class="jxr_linenumber" name="154" href="#154">154</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(100),
+<a class="jxr_linenumber" name="155" href="#155">155</a>                                  problem.getObjectiveFunction(),
+<a class="jxr_linenumber" name="156" href="#156">156</a>                                  problem.getObjectiveFunctionGradient(),
+<a class="jxr_linenumber" name="157" href="#157">157</a>                                  GoalType.MINIMIZE,
+<a class="jxr_linenumber" name="158" href="#158">158</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0, 0 }));
+<a class="jxr_linenumber" name="159" href="#159">159</a>         Assert.assertEquals(7.0, optimum.getPoint()[0], 1.0e-10);
+<a class="jxr_linenumber" name="160" href="#160">160</a>         Assert.assertEquals(3.0, optimum.getPoint()[1], 1.0e-10);
+<a class="jxr_linenumber" name="161" href="#161">161</a>         Assert.assertEquals(0.0, optimum.getValue(), 1.0e-10);
+<a class="jxr_linenumber" name="162" href="#162">162</a> 
+<a class="jxr_linenumber" name="163" href="#163">163</a>     }
+<a class="jxr_linenumber" name="164" href="#164">164</a> 
+<a class="jxr_linenumber" name="165" href="#165">165</a>     @Test
+<a class="jxr_linenumber" name="166" href="#166">166</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testNoDependency() {
+<a class="jxr_linenumber" name="167" href="#167">167</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
+<a class="jxr_linenumber" name="168" href="#168">168</a>                 { 2, 0, 0, 0, 0, 0 },
+<a class="jxr_linenumber" name="169" href="#169">169</a>                 { 0, 2, 0, 0, 0, 0 },
+<a class="jxr_linenumber" name="170" href="#170">170</a>                 { 0, 0, 2, 0, 0, 0 },
+<a class="jxr_linenumber" name="171" href="#171">171</a>                 { 0, 0, 0, 2, 0, 0 },
+<a class="jxr_linenumber" name="172" href="#172">172</a>                 { 0, 0, 0, 0, 2, 0 },
+<a class="jxr_linenumber" name="173" href="#173">173</a>                 { 0, 0, 0, 0, 0, 2 }
+<a class="jxr_linenumber" name="174" href="#174">174</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0.0, 1.1, 2.2, 3.3, 4.4, 5.5 });
 <a class="jxr_linenumber" name="175" href="#175">175</a>         NonLinearConjugateGradientOptimizer optimizer
 <a class="jxr_linenumber" name="176" href="#176">176</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
 <a class="jxr_linenumber" name="177" href="#177">177</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-6, 1e-6));
@@ -190,271 +190,292 @@
 <a class="jxr_linenumber" name="180" href="#180">180</a>                                  problem.getObjectiveFunction(),
 <a class="jxr_linenumber" name="181" href="#181">181</a>                                  problem.getObjectiveFunctionGradient(),
 <a class="jxr_linenumber" name="182" href="#182">182</a>                                  GoalType.MINIMIZE,
-<a class="jxr_linenumber" name="183" href="#183">183</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0, 0, 0 }));
-<a class="jxr_linenumber" name="184" href="#184">184</a>         Assert.assertEquals(1.0, optimum.getPoint()[0], 1.0e-10);
-<a class="jxr_linenumber" name="185" href="#185">185</a>         Assert.assertEquals(2.0, optimum.getPoint()[1], 1.0e-10);
-<a class="jxr_linenumber" name="186" href="#186">186</a>         Assert.assertEquals(3.0, optimum.getPoint()[2], 1.0e-10);
-<a class="jxr_linenumber" name="187" href="#187">187</a> 
-<a class="jxr_linenumber" name="188" href="#188">188</a>     }
-<a class="jxr_linenumber" name="189" href="#189">189</a> 
-<a class="jxr_linenumber" name="190" href="#190">190</a>     @Test
-<a class="jxr_linenumber" name="191" href="#191">191</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testTwoSets() {
-<a class="jxr_linenumber" name="192" href="#192">192</a>         <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">double</strong> epsilon = 1.0e-7;
-<a class="jxr_linenumber" name="193" href="#193">193</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
-<a class="jxr_linenumber" name="194" href="#194">194</a>                 {  2,  1,   0,  4,       0, 0 },
-<a class="jxr_linenumber" name="195" href="#195">195</a>                 { -4, -2,   3, -7,       0, 0 },
-<a class="jxr_linenumber" name="196" href="#196">196</a>                 {  4,  1,  -2,  8,       0, 0 },
-<a class="jxr_linenumber" name="197" href="#197">197</a>                 {  0, -3, -12, -1,       0, 0 },
-<a class="jxr_linenumber" name="198" href="#198">198</a>                 {  0,  0,   0,  0, epsilon, 1 },
-<a class="jxr_linenumber" name="199" href="#199">199</a>                 {  0,  0,   0,  0,       1, 1 }
-<a class="jxr_linenumber" name="200" href="#200">200</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 2, -9, 2, 2, 1 + epsilon * epsilon, 2});
-<a class="jxr_linenumber" name="201" href="#201">201</a> 
-<a class="jxr_linenumber" name="202" href="#202">202</a>         <strong class="jxr_keyword">final</strong> Preconditioner preconditioner
-<a class="jxr_linenumber" name="203" href="#203">203</a>             = <strong class="jxr_keyword">new</strong> Preconditioner() {
-<a class="jxr_linenumber" name="204" href="#204">204</a>                     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">double</strong>[] precondition(<strong class="jxr_keyword">double</strong>[] point, <strong class="jxr_keyword">double</strong>[] r) {
-<a class="jxr_linenumber" name="205" href="#205">205</a>                         <strong class="jxr_keyword">double</strong>[] d = r.clone();
-<a class="jxr_linenumber" name="206" href="#206">206</a>                         d[0] /=  72.0;
-<a class="jxr_linenumber" name="207" href="#207">207</a>                         d[1] /=  30.0;
-<a class="jxr_linenumber" name="208" href="#208">208</a>                         d[2] /= 314.0;
-<a class="jxr_linenumber" name="209" href="#209">209</a>                         d[3] /= 260.0;
-<a class="jxr_linenumber" name="210" href="#210">210</a>                         d[4] /= 2 * (1 + epsilon * epsilon);
-<a class="jxr_linenumber" name="211" href="#211">211</a>                         d[5] /= 4.0;
-<a class="jxr_linenumber" name="212" href="#212">212</a>                         <strong class="jxr_keyword">return</strong> d;
-<a class="jxr_linenumber" name="213" href="#213">213</a>                     }
-<a class="jxr_linenumber" name="214" href="#214">214</a>                 };
-<a class="jxr_linenumber" name="215" href="#215">215</a> 
-<a class="jxr_linenumber" name="216" href="#216">216</a>         NonLinearConjugateGradientOptimizer optimizer
-<a class="jxr_linenumber" name="217" href="#217">217</a>            = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
-<a class="jxr_linenumber" name="218" href="#218">218</a>                                                      <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-13, 1e-13),
-<a class="jxr_linenumber" name="219" href="#219">219</a>                                                      <strong class="jxr_keyword">new</strong> BrentSolver(),
-<a class="jxr_linenumber" name="220" href="#220">220</a>                                                      preconditioner);
-<a class="jxr_linenumber" name="221" href="#221">221</a> 
-<a class="jxr_linenumber" name="222" href="#222">222</a>         PointValuePair optimum
-<a class="jxr_linenumber" name="223" href="#223">223</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(100),
-<a class="jxr_linenumber" name="224" href="#224">224</a>                                  problem.getObjectiveFunction(),
-<a class="jxr_linenumber" name="225" href="#225">225</a>                                  problem.getObjectiveFunctionGradient(),
-<a class="jxr_linenumber" name="226" href="#226">226</a>                                  GoalType.MINIMIZE,
-<a class="jxr_linenumber" name="227" href="#227">227</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0, 0, 0, 0, 0, 0 }));
-<a class="jxr_linenumber" name="228" href="#228">228</a>         Assert.assertEquals( 3.0, optimum.getPoint()[0], 1.0e-10);
-<a class="jxr_linenumber" name="229" href="#229">229</a>         Assert.assertEquals( 4.0, optimum.getPoint()[1], 1.0e-10);
-<a class="jxr_linenumber" name="230" href="#230">230</a>         Assert.assertEquals(-1.0, optimum.getPoint()[2], 1.0e-10);
-<a class="jxr_linenumber" name="231" href="#231">231</a>         Assert.assertEquals(-2.0, optimum.getPoint()[3], 1.0e-10);
-<a class="jxr_linenumber" name="232" href="#232">232</a>         Assert.assertEquals( 1.0 + epsilon, optimum.getPoint()[4], 1.0e-10);
-<a class="jxr_linenumber" name="233" href="#233">233</a>         Assert.assertEquals( 1.0 - epsilon, optimum.getPoint()[5], 1.0e-10);
-<a class="jxr_linenumber" name="234" href="#234">234</a> 
-<a class="jxr_linenumber" name="235" href="#235">235</a>     }
+<a class="jxr_linenumber" name="183" href="#183">183</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0, 0, 0, 0, 0, 0 }));
+<a class="jxr_linenumber" name="184" href="#184">184</a>         <strong class="jxr_keyword">for</strong> (<strong class="jxr_keyword">int</strong> i = 0; i &lt; problem.target.length; ++i) {
+<a class="jxr_linenumber" name="185" href="#185">185</a>             Assert.assertEquals(0.55 * i, optimum.getPoint()[i], 1.0e-10);
+<a class="jxr_linenumber" name="186" href="#186">186</a>         }
+<a class="jxr_linenumber" name="187" href="#187">187</a>     }
+<a class="jxr_linenumber" name="188" href="#188">188</a> 
+<a class="jxr_linenumber" name="189" href="#189">189</a>     @Test
+<a class="jxr_linenumber" name="190" href="#190">190</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testOneSet() {
+<a class="jxr_linenumber" name="191" href="#191">191</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
+<a class="jxr_linenumber" name="192" href="#192">192</a>                 {  1,  0, 0 },
+<a class="jxr_linenumber" name="193" href="#193">193</a>                 { -1,  1, 0 },
+<a class="jxr_linenumber" name="194" href="#194">194</a>                 {  0, -1, 1 }
+<a class="jxr_linenumber" name="195" href="#195">195</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 1, 1, 1});
+<a class="jxr_linenumber" name="196" href="#196">196</a>         NonLinearConjugateGradientOptimizer optimizer
+<a class="jxr_linenumber" name="197" href="#197">197</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
+<a class="jxr_linenumber" name="198" href="#198">198</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-6, 1e-6));
+<a class="jxr_linenumber" name="199" href="#199">199</a>         PointValuePair optimum
+<a class="jxr_linenumber" name="200" href="#200">200</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(100),
+<a class="jxr_linenumber" name="201" href="#201">201</a>                                  problem.getObjectiveFunction(),
+<a class="jxr_linenumber" name="202" href="#202">202</a>                                  problem.getObjectiveFunctionGradient(),
+<a class="jxr_linenumber" name="203" href="#203">203</a>                                  GoalType.MINIMIZE,
+<a class="jxr_linenumber" name="204" href="#204">204</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0, 0, 0 }));
+<a class="jxr_linenumber" name="205" href="#205">205</a>         Assert.assertEquals(1.0, optimum.getPoint()[0], 1.0e-10);
+<a class="jxr_linenumber" name="206" href="#206">206</a>         Assert.assertEquals(2.0, optimum.getPoint()[1], 1.0e-10);
+<a class="jxr_linenumber" name="207" href="#207">207</a>         Assert.assertEquals(3.0, optimum.getPoint()[2], 1.0e-10);
+<a class="jxr_linenumber" name="208" href="#208">208</a> 
+<a class="jxr_linenumber" name="209" href="#209">209</a>     }
+<a class="jxr_linenumber" name="210" href="#210">210</a> 
+<a class="jxr_linenumber" name="211" href="#211">211</a>     @Test
+<a class="jxr_linenumber" name="212" href="#212">212</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testTwoSets() {
+<a class="jxr_linenumber" name="213" href="#213">213</a>         <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">double</strong> epsilon = 1.0e-7;
+<a class="jxr_linenumber" name="214" href="#214">214</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
+<a class="jxr_linenumber" name="215" href="#215">215</a>                 {  2,  1,   0,  4,       0, 0 },
+<a class="jxr_linenumber" name="216" href="#216">216</a>                 { -4, -2,   3, -7,       0, 0 },
+<a class="jxr_linenumber" name="217" href="#217">217</a>                 {  4,  1,  -2,  8,       0, 0 },
+<a class="jxr_linenumber" name="218" href="#218">218</a>                 {  0, -3, -12, -1,       0, 0 },
+<a class="jxr_linenumber" name="219" href="#219">219</a>                 {  0,  0,   0,  0, epsilon, 1 },
+<a class="jxr_linenumber" name="220" href="#220">220</a>                 {  0,  0,   0,  0,       1, 1 }
+<a class="jxr_linenumber" name="221" href="#221">221</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 2, -9, 2, 2, 1 + epsilon * epsilon, 2});
+<a class="jxr_linenumber" name="222" href="#222">222</a> 
+<a class="jxr_linenumber" name="223" href="#223">223</a>         <strong class="jxr_keyword">final</strong> Preconditioner preconditioner
+<a class="jxr_linenumber" name="224" href="#224">224</a>             = <strong class="jxr_keyword">new</strong> Preconditioner() {
+<a class="jxr_linenumber" name="225" href="#225">225</a>                     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">double</strong>[] precondition(<strong class="jxr_keyword">double</strong>[] point, <strong class="jxr_keyword">double</strong>[] r) {
+<a class="jxr_linenumber" name="226" href="#226">226</a>                         <strong class="jxr_keyword">double</strong>[] d = r.clone();
+<a class="jxr_linenumber" name="227" href="#227">227</a>                         d[0] /=  72.0;
+<a class="jxr_linenumber" name="228" href="#228">228</a>                         d[1] /=  30.0;
+<a class="jxr_linenumber" name="229" href="#229">229</a>                         d[2] /= 314.0;
+<a class="jxr_linenumber" name="230" href="#230">230</a>                         d[3] /= 260.0;
+<a class="jxr_linenumber" name="231" href="#231">231</a>                         d[4] /= 2 * (1 + epsilon * epsilon);
+<a class="jxr_linenumber" name="232" href="#232">232</a>                         d[5] /= 4.0;
+<a class="jxr_linenumber" name="233" href="#233">233</a>                         <strong class="jxr_keyword">return</strong> d;
+<a class="jxr_linenumber" name="234" href="#234">234</a>                     }
+<a class="jxr_linenumber" name="235" href="#235">235</a>                 };
 <a class="jxr_linenumber" name="236" href="#236">236</a> 
-<a class="jxr_linenumber" name="237" href="#237">237</a>     @Test
-<a class="jxr_linenumber" name="238" href="#238">238</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testNonInversible() {
-<a class="jxr_linenumber" name="239" href="#239">239</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
-<a class="jxr_linenumber" name="240" href="#240">240</a>                 {  1, 2, -3 },
-<a class="jxr_linenumber" name="241" href="#241">241</a>                 {  2, 1,  3 },
-<a class="jxr_linenumber" name="242" href="#242">242</a>                 { -3, 0, -9 }
-<a class="jxr_linenumber" name="243" href="#243">243</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 1, 1, 1 });
-<a class="jxr_linenumber" name="244" href="#244">244</a>         NonLinearConjugateGradientOptimizer optimizer
-<a class="jxr_linenumber" name="245" href="#245">245</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
-<a class="jxr_linenumber" name="246" href="#246">246</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-6, 1e-6));
-<a class="jxr_linenumber" name="247" href="#247">247</a>         PointValuePair optimum
-<a class="jxr_linenumber" name="248" href="#248">248</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(100),
-<a class="jxr_linenumber" name="249" href="#249">249</a>                                  problem.getObjectiveFunction(),
-<a class="jxr_linenumber" name="250" href="#250">250</a>                                  problem.getObjectiveFunctionGradient(),
-<a class="jxr_linenumber" name="251" href="#251">251</a>                                  GoalType.MINIMIZE,
-<a class="jxr_linenumber" name="252" href="#252">252</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0, 0, 0 }));
-<a class="jxr_linenumber" name="253" href="#253">253</a>         Assert.assertTrue(optimum.getValue() &gt; 0.5);
-<a class="jxr_linenumber" name="254" href="#254">254</a>     }
+<a class="jxr_linenumber" name="237" href="#237">237</a>         NonLinearConjugateGradientOptimizer optimizer
+<a class="jxr_linenumber" name="238" href="#238">238</a>            = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
+<a class="jxr_linenumber" name="239" href="#239">239</a>                                                      <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-13, 1e-13),
+<a class="jxr_linenumber" name="240" href="#240">240</a>                                                      <strong class="jxr_keyword">new</strong> BrentSolver(),
+<a class="jxr_linenumber" name="241" href="#241">241</a>                                                      preconditioner);
+<a class="jxr_linenumber" name="242" href="#242">242</a> 
+<a class="jxr_linenumber" name="243" href="#243">243</a>         PointValuePair optimum
+<a class="jxr_linenumber" name="244" href="#244">244</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(100),
+<a class="jxr_linenumber" name="245" href="#245">245</a>                                  problem.getObjectiveFunction(),
+<a class="jxr_linenumber" name="246" href="#246">246</a>                                  problem.getObjectiveFunctionGradient(),
+<a class="jxr_linenumber" name="247" href="#247">247</a>                                  GoalType.MINIMIZE,
+<a class="jxr_linenumber" name="248" href="#248">248</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0, 0, 0, 0, 0, 0 }));
+<a class="jxr_linenumber" name="249" href="#249">249</a>         Assert.assertEquals( 3.0, optimum.getPoint()[0], 1.0e-10);
+<a class="jxr_linenumber" name="250" href="#250">250</a>         Assert.assertEquals( 4.0, optimum.getPoint()[1], 1.0e-10);
+<a class="jxr_linenumber" name="251" href="#251">251</a>         Assert.assertEquals(-1.0, optimum.getPoint()[2], 1.0e-10);
+<a class="jxr_linenumber" name="252" href="#252">252</a>         Assert.assertEquals(-2.0, optimum.getPoint()[3], 1.0e-10);
+<a class="jxr_linenumber" name="253" href="#253">253</a>         Assert.assertEquals( 1.0 + epsilon, optimum.getPoint()[4], 1.0e-10);
+<a class="jxr_linenumber" name="254" href="#254">254</a>         Assert.assertEquals( 1.0 - epsilon, optimum.getPoint()[5], 1.0e-10);
 <a class="jxr_linenumber" name="255" href="#255">255</a> 
-<a class="jxr_linenumber" name="256" href="#256">256</a>     @Test
-<a class="jxr_linenumber" name="257" href="#257">257</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testIllConditioned() {
-<a class="jxr_linenumber" name="258" href="#258">258</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem1 = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
-<a class="jxr_linenumber" name="259" href="#259">259</a>                 { 10.0, 7.0,  8.0,  7.0 },
-<a class="jxr_linenumber" name="260" href="#260">260</a>                 {  7.0, 5.0,  6.0,  5.0 },
-<a class="jxr_linenumber" name="261" href="#261">261</a>                 {  8.0, 6.0, 10.0,  9.0 },
-<a class="jxr_linenumber" name="262" href="#262">262</a>                 {  7.0, 5.0,  9.0, 10.0 }
-<a class="jxr_linenumber" name="263" href="#263">263</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 32, 23, 33, 31 });
-<a class="jxr_linenumber" name="264" href="#264">264</a>         NonLinearConjugateGradientOptimizer optimizer
-<a class="jxr_linenumber" name="265" href="#265">265</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
-<a class="jxr_linenumber" name="266" href="#266">266</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-13, 1e-13),
-<a class="jxr_linenumber" name="267" href="#267">267</a>                                                       <strong class="jxr_keyword">new</strong> BrentSolver(1e-15, 1e-15));
-<a class="jxr_linenumber" name="268" href="#268">268</a>         PointValuePair optimum1
-<a class="jxr_linenumber" name="269" href="#269">269</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(200),
-<a class="jxr_linenumber" name="270" href="#270">270</a>                                  problem1.getObjectiveFunction(),
-<a class="jxr_linenumber" name="271" href="#271">271</a>                                  problem1.getObjectiveFunctionGradient(),
+<a class="jxr_linenumber" name="256" href="#256">256</a>     }
+<a class="jxr_linenumber" name="257" href="#257">257</a> 
+<a class="jxr_linenumber" name="258" href="#258">258</a>     @Test
+<a class="jxr_linenumber" name="259" href="#259">259</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testNonInversible() {
+<a class="jxr_linenumber" name="260" href="#260">260</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
+<a class="jxr_linenumber" name="261" href="#261">261</a>                 {  1, 2, -3 },
+<a class="jxr_linenumber" name="262" href="#262">262</a>                 {  2, 1,  3 },
+<a class="jxr_linenumber" name="263" href="#263">263</a>                 { -3, 0, -9 }
+<a class="jxr_linenumber" name="264" href="#264">264</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 1, 1, 1 });
+<a class="jxr_linenumber" name="265" href="#265">265</a>         NonLinearConjugateGradientOptimizer optimizer
+<a class="jxr_linenumber" name="266" href="#266">266</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
+<a class="jxr_linenumber" name="267" href="#267">267</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-6, 1e-6));
+<a class="jxr_linenumber" name="268" href="#268">268</a>         PointValuePair optimum
+<a class="jxr_linenumber" name="269" href="#269">269</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(100),
+<a class="jxr_linenumber" name="270" href="#270">270</a>                                  problem.getObjectiveFunction(),
+<a class="jxr_linenumber" name="271" href="#271">271</a>                                  problem.getObjectiveFunctionGradient(),
 <a class="jxr_linenumber" name="272" href="#272">272</a>                                  GoalType.MINIMIZE,
-<a class="jxr_linenumber" name="273" href="#273">273</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0, 1, 2, 3 }));
-<a class="jxr_linenumber" name="274" href="#274">274</a>         Assert.assertEquals(1.0, optimum1.getPoint()[0], 1.0e-4);
-<a class="jxr_linenumber" name="275" href="#275">275</a>         Assert.assertEquals(1.0, optimum1.getPoint()[1], 1.0e-4);
-<a class="jxr_linenumber" name="276" href="#276">276</a>         Assert.assertEquals(1.0, optimum1.getPoint()[2], 1.0e-4);
-<a class="jxr_linenumber" name="277" href="#277">277</a>         Assert.assertEquals(1.0, optimum1.getPoint()[3], 1.0e-4);
-<a class="jxr_linenumber" name="278" href="#278">278</a> 
-<a class="jxr_linenumber" name="279" href="#279">279</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem2 = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
-<a class="jxr_linenumber" name="280" href="#280">280</a>                 { 10.00, 7.00, 8.10, 7.20 },
-<a class="jxr_linenumber" name="281" href="#281">281</a>                 {  7.08, 5.04, 6.00, 5.00 },
-<a class="jxr_linenumber" name="282" href="#282">282</a>                 {  8.00, 5.98, 9.89, 9.00 },
-<a class="jxr_linenumber" name="283" href="#283">283</a>                 {  6.99, 4.99, 9.00, 9.98 }
+<a class="jxr_linenumber" name="273" href="#273">273</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0, 0, 0 }));
+<a class="jxr_linenumber" name="274" href="#274">274</a>         Assert.assertTrue(optimum.getValue() &gt; 0.5);
+<a class="jxr_linenumber" name="275" href="#275">275</a>     }
+<a class="jxr_linenumber" name="276" href="#276">276</a> 
+<a class="jxr_linenumber" name="277" href="#277">277</a>     @Test
+<a class="jxr_linenumber" name="278" href="#278">278</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testIllConditioned() {
+<a class="jxr_linenumber" name="279" href="#279">279</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem1 = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
+<a class="jxr_linenumber" name="280" href="#280">280</a>                 { 10.0, 7.0,  8.0,  7.0 },
+<a class="jxr_linenumber" name="281" href="#281">281</a>                 {  7.0, 5.0,  6.0,  5.0 },
+<a class="jxr_linenumber" name="282" href="#282">282</a>                 {  8.0, 6.0, 10.0,  9.0 },
+<a class="jxr_linenumber" name="283" href="#283">283</a>                 {  7.0, 5.0,  9.0, 10.0 }
 <a class="jxr_linenumber" name="284" href="#284">284</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 32, 23, 33, 31 });
-<a class="jxr_linenumber" name="285" href="#285">285</a>         PointValuePair optimum2
-<a class="jxr_linenumber" name="286" href="#286">286</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(200),
-<a class="jxr_linenumber" name="287" href="#287">287</a>                                  problem2.getObjectiveFunction(),
-<a class="jxr_linenumber" name="288" href="#288">288</a>                                  problem2.getObjectiveFunctionGradient(),
-<a class="jxr_linenumber" name="289" href="#289">289</a>                                  GoalType.MINIMIZE,
-<a class="jxr_linenumber" name="290" href="#290">290</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0, 1, 2, 3 }));
-<a class="jxr_linenumber" name="291" href="#291">291</a>         Assert.assertEquals(-81.0, optimum2.getPoint()[0], 1.0e-1);
-<a class="jxr_linenumber" name="292" href="#292">292</a>         Assert.assertEquals(137.0, optimum2.getPoint()[1], 1.0e-1);
-<a class="jxr_linenumber" name="293" href="#293">293</a>         Assert.assertEquals(-34.0, optimum2.getPoint()[2], 1.0e-1);
-<a class="jxr_linenumber" name="294" href="#294">294</a>         Assert.assertEquals( 22.0, optimum2.getPoint()[3], 1.0e-1);
-<a class="jxr_linenumber" name="295" href="#295">295</a> 
-<a class="jxr_linenumber" name="296" href="#296">296</a>     }
-<a class="jxr_linenumber" name="297" href="#297">297</a> 
-<a class="jxr_linenumber" name="298" href="#298">298</a>     @Test
-<a class="jxr_linenumber" name="299" href="#299">299</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testMoreEstimatedParametersSimple() {
-<a class="jxr_linenumber" name="300" href="#300">300</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
-<a class="jxr_linenumber" name="301" href="#301">301</a>                 { 3.0, 2.0,  0.0, 0.0 },
-<a class="jxr_linenumber" name="302" href="#302">302</a>                 { 0.0, 1.0, -1.0, 1.0 },
-<a class="jxr_linenumber" name="303" href="#303">303</a>                 { 2.0, 0.0,  1.0, 0.0 }
-<a class="jxr_linenumber" name="304" href="#304">304</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 7.0, 3.0, 5.0 });
-<a class="jxr_linenumber" name="305" href="#305">305</a> 
-<a class="jxr_linenumber" name="306" href="#306">306</a>         NonLinearConjugateGradientOptimizer optimizer
-<a class="jxr_linenumber" name="307" href="#307">307</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
-<a class="jxr_linenumber" name="308" href="#308">308</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-6, 1e-6));
-<a class="jxr_linenumber" name="309" href="#309">309</a>         PointValuePair optimum
-<a class="jxr_linenumber" name="310" href="#310">310</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(100),
-<a class="jxr_linenumber" name="311" href="#311">311</a>                                  problem.getObjectiveFunction(),
-<a class="jxr_linenumber" name="312" href="#312">312</a>                                  problem.getObjectiveFunctionGradient(),
-<a class="jxr_linenumber" name="313" href="#313">313</a>                                  GoalType.MINIMIZE,
-<a class="jxr_linenumber" name="314" href="#314">314</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 7, 6, 5, 4 }));
-<a class="jxr_linenumber" name="315" href="#315">315</a>         Assert.assertEquals(0, optimum.getValue(), 1.0e-10);
+<a class="jxr_linenumber" name="285" href="#285">285</a>         NonLinearConjugateGradientOptimizer optimizer
+<a class="jxr_linenumber" name="286" href="#286">286</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
+<a class="jxr_linenumber" name="287" href="#287">287</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-13, 1e-13),
+<a class="jxr_linenumber" name="288" href="#288">288</a>                                                       <strong class="jxr_keyword">new</strong> BrentSolver(1e-15, 1e-15));
+<a class="jxr_linenumber" name="289" href="#289">289</a>         PointValuePair optimum1
+<a class="jxr_linenumber" name="290" href="#290">290</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(200),
+<a class="jxr_linenumber" name="291" href="#291">291</a>                                  problem1.getObjectiveFunction(),
+<a class="jxr_linenumber" name="292" href="#292">292</a>                                  problem1.getObjectiveFunctionGradient(),
+<a class="jxr_linenumber" name="293" href="#293">293</a>                                  GoalType.MINIMIZE,
+<a class="jxr_linenumber" name="294" href="#294">294</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0, 1, 2, 3 }));
+<a class="jxr_linenumber" name="295" href="#295">295</a>         Assert.assertEquals(1.0, optimum1.getPoint()[0], 1.0e-4);
+<a class="jxr_linenumber" name="296" href="#296">296</a>         Assert.assertEquals(1.0, optimum1.getPoint()[1], 1.0e-4);
+<a class="jxr_linenumber" name="297" href="#297">297</a>         Assert.assertEquals(1.0, optimum1.getPoint()[2], 1.0e-4);
+<a class="jxr_linenumber" name="298" href="#298">298</a>         Assert.assertEquals(1.0, optimum1.getPoint()[3], 1.0e-4);
+<a class="jxr_linenumber" name="299" href="#299">299</a> 
+<a class="jxr_linenumber" name="300" href="#300">300</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem2 = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
+<a class="jxr_linenumber" name="301" href="#301">301</a>                 { 10.00, 7.00, 8.10, 7.20 },
+<a class="jxr_linenumber" name="302" href="#302">302</a>                 {  7.08, 5.04, 6.00, 5.00 },
+<a class="jxr_linenumber" name="303" href="#303">303</a>                 {  8.00, 5.98, 9.89, 9.00 },
+<a class="jxr_linenumber" name="304" href="#304">304</a>                 {  6.99, 4.99, 9.00, 9.98 }
+<a class="jxr_linenumber" name="305" href="#305">305</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 32, 23, 33, 31 });
+<a class="jxr_linenumber" name="306" href="#306">306</a>         PointValuePair optimum2
+<a class="jxr_linenumber" name="307" href="#307">307</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(200),
+<a class="jxr_linenumber" name="308" href="#308">308</a>                                  problem2.getObjectiveFunction(),
+<a class="jxr_linenumber" name="309" href="#309">309</a>                                  problem2.getObjectiveFunctionGradient(),
+<a class="jxr_linenumber" name="310" href="#310">310</a>                                  GoalType.MINIMIZE,
+<a class="jxr_linenumber" name="311" href="#311">311</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 0, 1, 2, 3 }));
+<a class="jxr_linenumber" name="312" href="#312">312</a>         Assert.assertEquals(-81.0, optimum2.getPoint()[0], 1.0e-1);
+<a class="jxr_linenumber" name="313" href="#313">313</a>         Assert.assertEquals(137.0, optimum2.getPoint()[1], 1.0e-1);
+<a class="jxr_linenumber" name="314" href="#314">314</a>         Assert.assertEquals(-34.0, optimum2.getPoint()[2], 1.0e-1);
+<a class="jxr_linenumber" name="315" href="#315">315</a>         Assert.assertEquals( 22.0, optimum2.getPoint()[3], 1.0e-1);
 <a class="jxr_linenumber" name="316" href="#316">316</a> 
 <a class="jxr_linenumber" name="317" href="#317">317</a>     }
 <a class="jxr_linenumber" name="318" href="#318">318</a> 
 <a class="jxr_linenumber" name="319" href="#319">319</a>     @Test
-<a class="jxr_linenumber" name="320" href="#320">320</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testMoreEstimatedParametersUnsorted() {
+<a class="jxr_linenumber" name="320" href="#320">320</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testMoreEstimatedParametersSimple() {
 <a class="jxr_linenumber" name="321" href="#321">321</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
-<a class="jxr_linenumber" name="322" href="#322">322</a>                  { 1.0, 1.0,  0.0,  0.0, 0.0,  0.0 },
-<a class="jxr_linenumber" name="323" href="#323">323</a>                  { 0.0, 0.0,  1.0,  1.0, 1.0,  0.0 },
-<a class="jxr_linenumber" name="324" href="#324">324</a>                  { 0.0, 0.0,  0.0,  0.0, 1.0, -1.0 },
-<a class="jxr_linenumber" name="325" href="#325">325</a>                  { 0.0, 0.0, -1.0,  1.0, 0.0,  1.0 },
-<a class="jxr_linenumber" name="326" href="#326">326</a>                  { 0.0, 0.0,  0.0, -1.0, 1.0,  0.0 }
-<a class="jxr_linenumber" name="327" href="#327">327</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 3.0, 12.0, -1.0, 7.0, 1.0 });
-<a class="jxr_linenumber" name="328" href="#328">328</a>         NonLinearConjugateGradientOptimizer optimizer
-<a class="jxr_linenumber" name="329" href="#329">329</a>            = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
-<a class="jxr_linenumber" name="330" href="#330">330</a>                                                      <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-6, 1e-6));
-<a class="jxr_linenumber" name="331" href="#331">331</a>         PointValuePair optimum
-<a class="jxr_linenumber" name="332" href="#332">332</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(100),
-<a class="jxr_linenumber" name="333" href="#333">333</a>                                  problem.getObjectiveFunction(),
-<a class="jxr_linenumber" name="334" href="#334">334</a>                                  problem.getObjectiveFunctionGradient(),
-<a class="jxr_linenumber" name="335" href="#335">335</a>                                  GoalType.MINIMIZE,
-<a class="jxr_linenumber" name="336" href="#336">336</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 2, 2, 2, 2, 2, 2 }));
-<a class="jxr_linenumber" name="337" href="#337">337</a>         Assert.assertEquals(0, optimum.getValue(), 1.0e-10);
+<a class="jxr_linenumber" name="322" href="#322">322</a>                 { 3.0, 2.0,  0.0, 0.0 },
+<a class="jxr_linenumber" name="323" href="#323">323</a>                 { 0.0, 1.0, -1.0, 1.0 },
+<a class="jxr_linenumber" name="324" href="#324">324</a>                 { 2.0, 0.0,  1.0, 0.0 }
+<a class="jxr_linenumber" name="325" href="#325">325</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 7.0, 3.0, 5.0 });
+<a class="jxr_linenumber" name="326" href="#326">326</a> 
+<a class="jxr_linenumber" name="327" href="#327">327</a>         NonLinearConjugateGradientOptimizer optimizer
+<a class="jxr_linenumber" name="328" href="#328">328</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
+<a class="jxr_linenumber" name="329" href="#329">329</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-6, 1e-6));
+<a class="jxr_linenumber" name="330" href="#330">330</a>         PointValuePair optimum
+<a class="jxr_linenumber" name="331" href="#331">331</a>             = optimizer.optimize(<strong class="jxr_keyword">new</strong> MaxEval(100),
+<a class="jxr_linenumber" name="332" href="#332">332</a>                                  problem.getObjectiveFunction(),
+<a class="jxr_linenumber" name="333" href="#333">333</a>                                  problem.getObjectiveFunctionGradient(),
+<a class="jxr_linenumber" name="334" href="#334">334</a>                                  GoalType.MINIMIZE,
+<a class="jxr_linenumber" name="335" href="#335">335</a>                                  <strong class="jxr_keyword">new</strong> InitialGuess(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 7, 6, 5, 4 }));
+<a class="jxr_linenumber" name="336" href="#336">336</a>         Assert.assertEquals(0, optimum.getValue(), 1.0e-10);
+<a class="jxr_linenumber" name="337" href="#337">337</a> 
 <a class="jxr_linenumber" name="338" href="#338">338</a>     }
 <a class="jxr_linenumber" name="339" href="#339">339</a> 
 <a class="jxr_linenumber" name="340" href="#340">340</a>     @Test
-<a class="jxr_linenumber" name="341" href="#341">341</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testRedundantEquations() {
+<a class="jxr_linenumber" name="341" href="#341">341</a>     <strong class="jxr_keyword">public</strong> <strong class="jxr_keyword">void</strong> testMoreEstimatedParametersUnsorted() {
 <a class="jxr_linenumber" name="342" href="#342">342</a>         <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a> problem = <strong class="jxr_keyword">new</strong> <a href="../../../../../../../../org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html">LinearProblem</a>(<strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[][] {
-<a class="jxr_linenumber" name="343" href="#343">343</a>                 { 1.0,  1.0 },
-<a class="jxr_linenumber" name="344" href="#344">344</a>                 { 1.0, -1.0 },
-<a class="jxr_linenumber" name="345" href="#345">345</a>                 { 1.0,  3.0 }
-<a class="jxr_linenumber" name="346" href="#346">346</a>         }, <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">double</strong>[] { 3.0, 1.0, 5.0 });
-<a class="jxr_linenumber" name="347" href="#347">347</a> 
-<a class="jxr_linenumber" name="348" href="#348">348</a>         NonLinearConjugateGradientOptimizer optimizer
-<a class="jxr_linenumber" name="349" href="#349">349</a>             = <strong class="jxr_keyword">new</strong> NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,
-<a class="jxr_linenumber" name="350" href="#350">350</a>                                                       <strong class="jxr_keyword">new</strong> SimpleValueChecker(1e-6, 1e-6));

[... 222 lines stripped ...]


Mime
View raw message