You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by lu...@apache.org on 2013/04/07 01:42:02 UTC
svn commit: r857558 [18/39] - in
/websites/production/commons/content/proper/commons-math/testapidocs/src-html/org/apache/commons/math3:
./ analysis/ analysis/differentiation/ analysis/interpolation/ complex/
dfp/ distribution/ distribution/fitting/ ex...
Modified: websites/production/commons/content/proper/commons-math/testapidocs/src-html/org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html
==============================================================================
--- websites/production/commons/content/proper/commons-math/testapidocs/src-html/org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html (original)
+++ websites/production/commons/content/proper/commons-math/testapidocs/src-html/org/apache/commons/math3/optim/nonlinear/scalar/gradient/NonLinearConjugateGradientOptimizerTest.html Sat Apr 6 23:42:01 2013
@@ -30,151 +30,151 @@
<FONT color="green">027</FONT> import org.apache.commons.math3.analysis.solvers.BrentSolver;<a name="line.27"></a>
<FONT color="green">028</FONT> import org.apache.commons.math3.exception.DimensionMismatchException;<a name="line.28"></a>
<FONT color="green">029</FONT> import org.apache.commons.math3.exception.MathIllegalArgumentException;<a name="line.29"></a>
-<FONT color="green">030</FONT> import org.apache.commons.math3.geometry.euclidean.twod.Vector2D;<a name="line.30"></a>
-<FONT color="green">031</FONT> import org.apache.commons.math3.linear.BlockRealMatrix;<a name="line.31"></a>
-<FONT color="green">032</FONT> import org.apache.commons.math3.linear.RealMatrix;<a name="line.32"></a>
-<FONT color="green">033</FONT> import org.apache.commons.math3.optim.nonlinear.scalar.GoalType;<a name="line.33"></a>
+<FONT color="green">030</FONT> import org.apache.commons.math3.exception.MathUnsupportedOperationException;<a name="line.30"></a>
+<FONT color="green">031</FONT> import org.apache.commons.math3.geometry.euclidean.twod.Vector2D;<a name="line.31"></a>
+<FONT color="green">032</FONT> import org.apache.commons.math3.linear.BlockRealMatrix;<a name="line.32"></a>
+<FONT color="green">033</FONT> import org.apache.commons.math3.linear.RealMatrix;<a name="line.33"></a>
<FONT color="green">034</FONT> import org.apache.commons.math3.optim.PointValuePair;<a name="line.34"></a>
<FONT color="green">035</FONT> import org.apache.commons.math3.optim.SimpleValueChecker;<a name="line.35"></a>
<FONT color="green">036</FONT> import org.apache.commons.math3.optim.InitialGuess;<a name="line.36"></a>
<FONT color="green">037</FONT> import org.apache.commons.math3.optim.MaxEval;<a name="line.37"></a>
-<FONT color="green">038</FONT> import org.apache.commons.math3.optim.nonlinear.scalar.ObjectiveFunction;<a name="line.38"></a>
-<FONT color="green">039</FONT> import org.apache.commons.math3.optim.nonlinear.scalar.ObjectiveFunctionGradient;<a name="line.39"></a>
-<FONT color="green">040</FONT> import org.junit.Assert;<a name="line.40"></a>
-<FONT color="green">041</FONT> import org.junit.Test;<a name="line.41"></a>
-<FONT color="green">042</FONT> <a name="line.42"></a>
-<FONT color="green">043</FONT> /**<a name="line.43"></a>
-<FONT color="green">044</FONT> * <p>Some of the unit tests are re-implementations of the MINPACK <a<a name="line.44"></a>
-<FONT color="green">045</FONT> * href="http://www.netlib.org/minpack/ex/file17">file17</a> and <a<a name="line.45"></a>
-<FONT color="green">046</FONT> * href="http://www.netlib.org/minpack/ex/file22">file22</a> test files.<a name="line.46"></a>
-<FONT color="green">047</FONT> * The redistribution policy for MINPACK is available <a<a name="line.47"></a>
-<FONT color="green">048</FONT> * href="http://www.netlib.org/minpack/disclaimer">here</a>, for<a name="line.48"></a>
-<FONT color="green">049</FONT> * convenience, it is reproduced below.</p><a name="line.49"></a>
-<FONT color="green">050</FONT> *<a name="line.50"></a>
-<FONT color="green">051</FONT> * <table border="0" width="80%" cellpadding="10" align="center" bgcolor="#E0E0E0"><a name="line.51"></a>
-<FONT color="green">052</FONT> * <tr><td><a name="line.52"></a>
-<FONT color="green">053</FONT> * Minpack Copyright Notice (1999) University of Chicago.<a name="line.53"></a>
-<FONT color="green">054</FONT> * All rights reserved<a name="line.54"></a>
-<FONT color="green">055</FONT> * </td></tr><a name="line.55"></a>
-<FONT color="green">056</FONT> * <tr><td><a name="line.56"></a>
-<FONT color="green">057</FONT> * Redistribution and use in source and binary forms, with or without<a name="line.57"></a>
-<FONT color="green">058</FONT> * modification, are permitted provided that the following conditions<a name="line.58"></a>
-<FONT color="green">059</FONT> * are met:<a name="line.59"></a>
-<FONT color="green">060</FONT> * <ol><a name="line.60"></a>
-<FONT color="green">061</FONT> * <li>Redistributions of source code must retain the above copyright<a name="line.61"></a>
-<FONT color="green">062</FONT> * notice, this list of conditions and the following disclaimer.</li><a name="line.62"></a>
-<FONT color="green">063</FONT> * <li>Redistributions in binary form must reproduce the above<a name="line.63"></a>
-<FONT color="green">064</FONT> * copyright notice, this list of conditions and the following<a name="line.64"></a>
-<FONT color="green">065</FONT> * disclaimer in the documentation and/or other materials provided<a name="line.65"></a>
-<FONT color="green">066</FONT> * with the distribution.</li><a name="line.66"></a>
-<FONT color="green">067</FONT> * <li>The end-user documentation included with the redistribution, if any,<a name="line.67"></a>
-<FONT color="green">068</FONT> * must include the following acknowledgment:<a name="line.68"></a>
-<FONT color="green">069</FONT> * <code>This product includes software developed by the University of<a name="line.69"></a>
-<FONT color="green">070</FONT> * Chicago, as Operator of Argonne National Laboratory.</code><a name="line.70"></a>
-<FONT color="green">071</FONT> * Alternately, this acknowledgment may appear in the software itself,<a name="line.71"></a>
-<FONT color="green">072</FONT> * if and wherever such third-party acknowledgments normally appear.</li><a name="line.72"></a>
-<FONT color="green">073</FONT> * <li><strong>WARRANTY DISCLAIMER. THE SOFTWARE IS SUPPLIED "AS IS"<a name="line.73"></a>
-<FONT color="green">074</FONT> * WITHOUT WARRANTY OF ANY KIND. THE COPYRIGHT HOLDER, THE<a name="line.74"></a>
-<FONT color="green">075</FONT> * UNITED STATES, THE UNITED STATES DEPARTMENT OF ENERGY, AND<a name="line.75"></a>
-<FONT color="green">076</FONT> * THEIR EMPLOYEES: (1) DISCLAIM ANY WARRANTIES, EXPRESS OR<a name="line.76"></a>
-<FONT color="green">077</FONT> * IMPLIED, INCLUDING BUT NOT LIMITED TO ANY IMPLIED WARRANTIES<a name="line.77"></a>
-<FONT color="green">078</FONT> * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE<a name="line.78"></a>
-<FONT color="green">079</FONT> * OR NON-INFRINGEMENT, (2) DO NOT ASSUME ANY LEGAL LIABILITY<a name="line.79"></a>
-<FONT color="green">080</FONT> * OR RESPONSIBILITY FOR THE ACCURACY, COMPLETENESS, OR<a name="line.80"></a>
-<FONT color="green">081</FONT> * USEFULNESS OF THE SOFTWARE, (3) DO NOT REPRESENT THAT USE OF<a name="line.81"></a>
-<FONT color="green">082</FONT> * THE SOFTWARE WOULD NOT INFRINGE PRIVATELY OWNED RIGHTS, (4)<a name="line.82"></a>
-<FONT color="green">083</FONT> * DO NOT WARRANT THAT THE SOFTWARE WILL FUNCTION<a name="line.83"></a>
-<FONT color="green">084</FONT> * UNINTERRUPTED, THAT IT IS ERROR-FREE OR THAT ANY ERRORS WILL<a name="line.84"></a>
-<FONT color="green">085</FONT> * BE CORRECTED.</strong></li><a name="line.85"></a>
-<FONT color="green">086</FONT> * <li><strong>LIMITATION OF LIABILITY. IN NO EVENT WILL THE COPYRIGHT<a name="line.86"></a>
-<FONT color="green">087</FONT> * HOLDER, THE UNITED STATES, THE UNITED STATES DEPARTMENT OF<a name="line.87"></a>
-<FONT color="green">088</FONT> * ENERGY, OR THEIR EMPLOYEES: BE LIABLE FOR ANY INDIRECT,<a name="line.88"></a>
-<FONT color="green">089</FONT> * INCIDENTAL, CONSEQUENTIAL, SPECIAL OR PUNITIVE DAMAGES OF<a name="line.89"></a>
-<FONT color="green">090</FONT> * ANY KIND OR NATURE, INCLUDING BUT NOT LIMITED TO LOSS OF<a name="line.90"></a>
-<FONT color="green">091</FONT> * PROFITS OR LOSS OF DATA, FOR ANY REASON WHATSOEVER, WHETHER<a name="line.91"></a>
-<FONT color="green">092</FONT> * SUCH LIABILITY IS ASSERTED ON THE BASIS OF CONTRACT, TORT<a name="line.92"></a>
-<FONT color="green">093</FONT> * (INCLUDING NEGLIGENCE OR STRICT LIABILITY), OR OTHERWISE,<a name="line.93"></a>
-<FONT color="green">094</FONT> * EVEN IF ANY OF SAID PARTIES HAS BEEN WARNED OF THE<a name="line.94"></a>
-<FONT color="green">095</FONT> * POSSIBILITY OF SUCH LOSS OR DAMAGES.</strong></li><a name="line.95"></a>
-<FONT color="green">096</FONT> * <ol></td></tr><a name="line.96"></a>
-<FONT color="green">097</FONT> * </table><a name="line.97"></a>
-<FONT color="green">098</FONT> *<a name="line.98"></a>
-<FONT color="green">099</FONT> * @author Argonne National Laboratory. MINPACK project. March 1980 (original fortran minpack tests)<a name="line.99"></a>
-<FONT color="green">100</FONT> * @author Burton S. Garbow (original fortran minpack tests)<a name="line.100"></a>
-<FONT color="green">101</FONT> * @author Kenneth E. Hillstrom (original fortran minpack tests)<a name="line.101"></a>
-<FONT color="green">102</FONT> * @author Jorge J. More (original fortran minpack tests)<a name="line.102"></a>
-<FONT color="green">103</FONT> * @author Luc Maisonobe (non-minpack tests and minpack tests Java translation)<a name="line.103"></a>
-<FONT color="green">104</FONT> */<a name="line.104"></a>
-<FONT color="green">105</FONT> public class NonLinearConjugateGradientOptimizerTest {<a name="line.105"></a>
-<FONT color="green">106</FONT> @Test<a name="line.106"></a>
-<FONT color="green">107</FONT> public void testTrivial() {<a name="line.107"></a>
-<FONT color="green">108</FONT> LinearProblem problem<a name="line.108"></a>
-<FONT color="green">109</FONT> = new LinearProblem(new double[][] { { 2 } }, new double[] { 3 });<a name="line.109"></a>
-<FONT color="green">110</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.110"></a>
-<FONT color="green">111</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.111"></a>
-<FONT color="green">112</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.112"></a>
-<FONT color="green">113</FONT> PointValuePair optimum<a name="line.113"></a>
-<FONT color="green">114</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.114"></a>
-<FONT color="green">115</FONT> problem.getObjectiveFunction(),<a name="line.115"></a>
-<FONT color="green">116</FONT> problem.getObjectiveFunctionGradient(),<a name="line.116"></a>
-<FONT color="green">117</FONT> GoalType.MINIMIZE,<a name="line.117"></a>
-<FONT color="green">118</FONT> new InitialGuess(new double[] { 0 }));<a name="line.118"></a>
-<FONT color="green">119</FONT> Assert.assertEquals(1.5, optimum.getPoint()[0], 1.0e-10);<a name="line.119"></a>
-<FONT color="green">120</FONT> Assert.assertEquals(0.0, optimum.getValue(), 1.0e-10);<a name="line.120"></a>
-<FONT color="green">121</FONT> }<a name="line.121"></a>
-<FONT color="green">122</FONT> <a name="line.122"></a>
-<FONT color="green">123</FONT> @Test<a name="line.123"></a>
-<FONT color="green">124</FONT> public void testColumnsPermutation() {<a name="line.124"></a>
-<FONT color="green">125</FONT> LinearProblem problem<a name="line.125"></a>
-<FONT color="green">126</FONT> = new LinearProblem(new double[][] { { 1.0, -1.0 }, { 0.0, 2.0 }, { 1.0, -2.0 } },<a name="line.126"></a>
-<FONT color="green">127</FONT> new double[] { 4.0, 6.0, 1.0 });<a name="line.127"></a>
-<FONT color="green">128</FONT> <a name="line.128"></a>
-<FONT color="green">129</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.129"></a>
-<FONT color="green">130</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.130"></a>
-<FONT color="green">131</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.131"></a>
-<FONT color="green">132</FONT> PointValuePair optimum<a name="line.132"></a>
-<FONT color="green">133</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.133"></a>
-<FONT color="green">134</FONT> problem.getObjectiveFunction(),<a name="line.134"></a>
-<FONT color="green">135</FONT> problem.getObjectiveFunctionGradient(),<a name="line.135"></a>
-<FONT color="green">136</FONT> GoalType.MINIMIZE,<a name="line.136"></a>
-<FONT color="green">137</FONT> new InitialGuess(new double[] { 0, 0 }));<a name="line.137"></a>
-<FONT color="green">138</FONT> Assert.assertEquals(7.0, optimum.getPoint()[0], 1.0e-10);<a name="line.138"></a>
-<FONT color="green">139</FONT> Assert.assertEquals(3.0, optimum.getPoint()[1], 1.0e-10);<a name="line.139"></a>
-<FONT color="green">140</FONT> Assert.assertEquals(0.0, optimum.getValue(), 1.0e-10);<a name="line.140"></a>
-<FONT color="green">141</FONT> <a name="line.141"></a>
+<FONT color="green">038</FONT> import org.apache.commons.math3.optim.SimpleBounds;<a name="line.38"></a>
+<FONT color="green">039</FONT> import org.apache.commons.math3.optim.nonlinear.scalar.ObjectiveFunction;<a name="line.39"></a>
+<FONT color="green">040</FONT> import org.apache.commons.math3.optim.nonlinear.scalar.GoalType;<a name="line.40"></a>
+<FONT color="green">041</FONT> import org.apache.commons.math3.optim.nonlinear.scalar.ObjectiveFunctionGradient;<a name="line.41"></a>
+<FONT color="green">042</FONT> import org.junit.Assert;<a name="line.42"></a>
+<FONT color="green">043</FONT> import org.junit.Test;<a name="line.43"></a>
+<FONT color="green">044</FONT> <a name="line.44"></a>
+<FONT color="green">045</FONT> /**<a name="line.45"></a>
+<FONT color="green">046</FONT> * <p>Some of the unit tests are re-implementations of the MINPACK <a<a name="line.46"></a>
+<FONT color="green">047</FONT> * href="http://www.netlib.org/minpack/ex/file17">file17</a> and <a<a name="line.47"></a>
+<FONT color="green">048</FONT> * href="http://www.netlib.org/minpack/ex/file22">file22</a> test files.<a name="line.48"></a>
+<FONT color="green">049</FONT> * The redistribution policy for MINPACK is available <a<a name="line.49"></a>
+<FONT color="green">050</FONT> * href="http://www.netlib.org/minpack/disclaimer">here</a>, for<a name="line.50"></a>
+<FONT color="green">051</FONT> * convenience, it is reproduced below.</p><a name="line.51"></a>
+<FONT color="green">052</FONT> *<a name="line.52"></a>
+<FONT color="green">053</FONT> * <table border="0" width="80%" cellpadding="10" align="center" bgcolor="#E0E0E0"><a name="line.53"></a>
+<FONT color="green">054</FONT> * <tr><td><a name="line.54"></a>
+<FONT color="green">055</FONT> * Minpack Copyright Notice (1999) University of Chicago.<a name="line.55"></a>
+<FONT color="green">056</FONT> * All rights reserved<a name="line.56"></a>
+<FONT color="green">057</FONT> * </td></tr><a name="line.57"></a>
+<FONT color="green">058</FONT> * <tr><td><a name="line.58"></a>
+<FONT color="green">059</FONT> * Redistribution and use in source and binary forms, with or without<a name="line.59"></a>
+<FONT color="green">060</FONT> * modification, are permitted provided that the following conditions<a name="line.60"></a>
+<FONT color="green">061</FONT> * are met:<a name="line.61"></a>
+<FONT color="green">062</FONT> * <ol><a name="line.62"></a>
+<FONT color="green">063</FONT> * <li>Redistributions of source code must retain the above copyright<a name="line.63"></a>
+<FONT color="green">064</FONT> * notice, this list of conditions and the following disclaimer.</li><a name="line.64"></a>
+<FONT color="green">065</FONT> * <li>Redistributions in binary form must reproduce the above<a name="line.65"></a>
+<FONT color="green">066</FONT> * copyright notice, this list of conditions and the following<a name="line.66"></a>
+<FONT color="green">067</FONT> * disclaimer in the documentation and/or other materials provided<a name="line.67"></a>
+<FONT color="green">068</FONT> * with the distribution.</li><a name="line.68"></a>
+<FONT color="green">069</FONT> * <li>The end-user documentation included with the redistribution, if any,<a name="line.69"></a>
+<FONT color="green">070</FONT> * must include the following acknowledgment:<a name="line.70"></a>
+<FONT color="green">071</FONT> * <code>This product includes software developed by the University of<a name="line.71"></a>
+<FONT color="green">072</FONT> * Chicago, as Operator of Argonne National Laboratory.</code><a name="line.72"></a>
+<FONT color="green">073</FONT> * Alternately, this acknowledgment may appear in the software itself,<a name="line.73"></a>
+<FONT color="green">074</FONT> * if and wherever such third-party acknowledgments normally appear.</li><a name="line.74"></a>
+<FONT color="green">075</FONT> * <li><strong>WARRANTY DISCLAIMER. THE SOFTWARE IS SUPPLIED "AS IS"<a name="line.75"></a>
+<FONT color="green">076</FONT> * WITHOUT WARRANTY OF ANY KIND. THE COPYRIGHT HOLDER, THE<a name="line.76"></a>
+<FONT color="green">077</FONT> * UNITED STATES, THE UNITED STATES DEPARTMENT OF ENERGY, AND<a name="line.77"></a>
+<FONT color="green">078</FONT> * THEIR EMPLOYEES: (1) DISCLAIM ANY WARRANTIES, EXPRESS OR<a name="line.78"></a>
+<FONT color="green">079</FONT> * IMPLIED, INCLUDING BUT NOT LIMITED TO ANY IMPLIED WARRANTIES<a name="line.79"></a>
+<FONT color="green">080</FONT> * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE<a name="line.80"></a>
+<FONT color="green">081</FONT> * OR NON-INFRINGEMENT, (2) DO NOT ASSUME ANY LEGAL LIABILITY<a name="line.81"></a>
+<FONT color="green">082</FONT> * OR RESPONSIBILITY FOR THE ACCURACY, COMPLETENESS, OR<a name="line.82"></a>
+<FONT color="green">083</FONT> * USEFULNESS OF THE SOFTWARE, (3) DO NOT REPRESENT THAT USE OF<a name="line.83"></a>
+<FONT color="green">084</FONT> * THE SOFTWARE WOULD NOT INFRINGE PRIVATELY OWNED RIGHTS, (4)<a name="line.84"></a>
+<FONT color="green">085</FONT> * DO NOT WARRANT THAT THE SOFTWARE WILL FUNCTION<a name="line.85"></a>
+<FONT color="green">086</FONT> * UNINTERRUPTED, THAT IT IS ERROR-FREE OR THAT ANY ERRORS WILL<a name="line.86"></a>
+<FONT color="green">087</FONT> * BE CORRECTED.</strong></li><a name="line.87"></a>
+<FONT color="green">088</FONT> * <li><strong>LIMITATION OF LIABILITY. IN NO EVENT WILL THE COPYRIGHT<a name="line.88"></a>
+<FONT color="green">089</FONT> * HOLDER, THE UNITED STATES, THE UNITED STATES DEPARTMENT OF<a name="line.89"></a>
+<FONT color="green">090</FONT> * ENERGY, OR THEIR EMPLOYEES: BE LIABLE FOR ANY INDIRECT,<a name="line.90"></a>
+<FONT color="green">091</FONT> * INCIDENTAL, CONSEQUENTIAL, SPECIAL OR PUNITIVE DAMAGES OF<a name="line.91"></a>
+<FONT color="green">092</FONT> * ANY KIND OR NATURE, INCLUDING BUT NOT LIMITED TO LOSS OF<a name="line.92"></a>
+<FONT color="green">093</FONT> * PROFITS OR LOSS OF DATA, FOR ANY REASON WHATSOEVER, WHETHER<a name="line.93"></a>
+<FONT color="green">094</FONT> * SUCH LIABILITY IS ASSERTED ON THE BASIS OF CONTRACT, TORT<a name="line.94"></a>
+<FONT color="green">095</FONT> * (INCLUDING NEGLIGENCE OR STRICT LIABILITY), OR OTHERWISE,<a name="line.95"></a>
+<FONT color="green">096</FONT> * EVEN IF ANY OF SAID PARTIES HAS BEEN WARNED OF THE<a name="line.96"></a>
+<FONT color="green">097</FONT> * POSSIBILITY OF SUCH LOSS OR DAMAGES.</strong></li><a name="line.97"></a>
+<FONT color="green">098</FONT> * <ol></td></tr><a name="line.98"></a>
+<FONT color="green">099</FONT> * </table><a name="line.99"></a>
+<FONT color="green">100</FONT> *<a name="line.100"></a>
+<FONT color="green">101</FONT> * @author Argonne National Laboratory. MINPACK project. March 1980 (original fortran minpack tests)<a name="line.101"></a>
+<FONT color="green">102</FONT> * @author Burton S. Garbow (original fortran minpack tests)<a name="line.102"></a>
+<FONT color="green">103</FONT> * @author Kenneth E. Hillstrom (original fortran minpack tests)<a name="line.103"></a>
+<FONT color="green">104</FONT> * @author Jorge J. More (original fortran minpack tests)<a name="line.104"></a>
+<FONT color="green">105</FONT> * @author Luc Maisonobe (non-minpack tests and minpack tests Java translation)<a name="line.105"></a>
+<FONT color="green">106</FONT> */<a name="line.106"></a>
+<FONT color="green">107</FONT> public class NonLinearConjugateGradientOptimizerTest {<a name="line.107"></a>
+<FONT color="green">108</FONT> @Test(expected=MathUnsupportedOperationException.class)<a name="line.108"></a>
+<FONT color="green">109</FONT> public void testBoundsUnsupported() {<a name="line.109"></a>
+<FONT color="green">110</FONT> LinearProblem problem<a name="line.110"></a>
+<FONT color="green">111</FONT> = new LinearProblem(new double[][] { { 2 } }, new double[] { 3 });<a name="line.111"></a>
+<FONT color="green">112</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.112"></a>
+<FONT color="green">113</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.113"></a>
+<FONT color="green">114</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.114"></a>
+<FONT color="green">115</FONT> optimizer.optimize(new MaxEval(100),<a name="line.115"></a>
+<FONT color="green">116</FONT> problem.getObjectiveFunction(),<a name="line.116"></a>
+<FONT color="green">117</FONT> problem.getObjectiveFunctionGradient(),<a name="line.117"></a>
+<FONT color="green">118</FONT> GoalType.MINIMIZE,<a name="line.118"></a>
+<FONT color="green">119</FONT> new InitialGuess(new double[] { 0 }),<a name="line.119"></a>
+<FONT color="green">120</FONT> new SimpleBounds(new double[] { -1 },<a name="line.120"></a>
+<FONT color="green">121</FONT> new double[] { 1 }));<a name="line.121"></a>
+<FONT color="green">122</FONT> }<a name="line.122"></a>
+<FONT color="green">123</FONT> <a name="line.123"></a>
+<FONT color="green">124</FONT> @Test<a name="line.124"></a>
+<FONT color="green">125</FONT> public void testTrivial() {<a name="line.125"></a>
+<FONT color="green">126</FONT> LinearProblem problem<a name="line.126"></a>
+<FONT color="green">127</FONT> = new LinearProblem(new double[][] { { 2 } }, new double[] { 3 });<a name="line.127"></a>
+<FONT color="green">128</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.128"></a>
+<FONT color="green">129</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.129"></a>
+<FONT color="green">130</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.130"></a>
+<FONT color="green">131</FONT> PointValuePair optimum<a name="line.131"></a>
+<FONT color="green">132</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.132"></a>
+<FONT color="green">133</FONT> problem.getObjectiveFunction(),<a name="line.133"></a>
+<FONT color="green">134</FONT> problem.getObjectiveFunctionGradient(),<a name="line.134"></a>
+<FONT color="green">135</FONT> GoalType.MINIMIZE,<a name="line.135"></a>
+<FONT color="green">136</FONT> new InitialGuess(new double[] { 0 }));<a name="line.136"></a>
+<FONT color="green">137</FONT> Assert.assertEquals(1.5, optimum.getPoint()[0], 1.0e-10);<a name="line.137"></a>
+<FONT color="green">138</FONT> Assert.assertEquals(0.0, optimum.getValue(), 1.0e-10);<a name="line.138"></a>
+<FONT color="green">139</FONT> <a name="line.139"></a>
+<FONT color="green">140</FONT> // Check that the number of iterations is updated (MATH-949).<a name="line.140"></a>
+<FONT color="green">141</FONT> Assert.assertTrue(optimizer.getIterations() > 0);<a name="line.141"></a>
<FONT color="green">142</FONT> }<a name="line.142"></a>
<FONT color="green">143</FONT> <a name="line.143"></a>
<FONT color="green">144</FONT> @Test<a name="line.144"></a>
-<FONT color="green">145</FONT> public void testNoDependency() {<a name="line.145"></a>
-<FONT color="green">146</FONT> LinearProblem problem = new LinearProblem(new double[][] {<a name="line.146"></a>
-<FONT color="green">147</FONT> { 2, 0, 0, 0, 0, 0 },<a name="line.147"></a>
-<FONT color="green">148</FONT> { 0, 2, 0, 0, 0, 0 },<a name="line.148"></a>
-<FONT color="green">149</FONT> { 0, 0, 2, 0, 0, 0 },<a name="line.149"></a>
-<FONT color="green">150</FONT> { 0, 0, 0, 2, 0, 0 },<a name="line.150"></a>
-<FONT color="green">151</FONT> { 0, 0, 0, 0, 2, 0 },<a name="line.151"></a>
-<FONT color="green">152</FONT> { 0, 0, 0, 0, 0, 2 }<a name="line.152"></a>
-<FONT color="green">153</FONT> }, new double[] { 0.0, 1.1, 2.2, 3.3, 4.4, 5.5 });<a name="line.153"></a>
-<FONT color="green">154</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.154"></a>
-<FONT color="green">155</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.155"></a>
-<FONT color="green">156</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.156"></a>
-<FONT color="green">157</FONT> PointValuePair optimum<a name="line.157"></a>
-<FONT color="green">158</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.158"></a>
-<FONT color="green">159</FONT> problem.getObjectiveFunction(),<a name="line.159"></a>
-<FONT color="green">160</FONT> problem.getObjectiveFunctionGradient(),<a name="line.160"></a>
-<FONT color="green">161</FONT> GoalType.MINIMIZE,<a name="line.161"></a>
-<FONT color="green">162</FONT> new InitialGuess(new double[] { 0, 0, 0, 0, 0, 0 }));<a name="line.162"></a>
-<FONT color="green">163</FONT> for (int i = 0; i < problem.target.length; ++i) {<a name="line.163"></a>
-<FONT color="green">164</FONT> Assert.assertEquals(0.55 * i, optimum.getPoint()[i], 1.0e-10);<a name="line.164"></a>
-<FONT color="green">165</FONT> }<a name="line.165"></a>
-<FONT color="green">166</FONT> }<a name="line.166"></a>
-<FONT color="green">167</FONT> <a name="line.167"></a>
-<FONT color="green">168</FONT> @Test<a name="line.168"></a>
-<FONT color="green">169</FONT> public void testOneSet() {<a name="line.169"></a>
-<FONT color="green">170</FONT> LinearProblem problem = new LinearProblem(new double[][] {<a name="line.170"></a>
-<FONT color="green">171</FONT> { 1, 0, 0 },<a name="line.171"></a>
-<FONT color="green">172</FONT> { -1, 1, 0 },<a name="line.172"></a>
-<FONT color="green">173</FONT> { 0, -1, 1 }<a name="line.173"></a>
-<FONT color="green">174</FONT> }, new double[] { 1, 1, 1});<a name="line.174"></a>
+<FONT color="green">145</FONT> public void testColumnsPermutation() {<a name="line.145"></a>
+<FONT color="green">146</FONT> LinearProblem problem<a name="line.146"></a>
+<FONT color="green">147</FONT> = new LinearProblem(new double[][] { { 1.0, -1.0 }, { 0.0, 2.0 }, { 1.0, -2.0 } },<a name="line.147"></a>
+<FONT color="green">148</FONT> new double[] { 4.0, 6.0, 1.0 });<a name="line.148"></a>
+<FONT color="green">149</FONT> <a name="line.149"></a>
+<FONT color="green">150</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.150"></a>
+<FONT color="green">151</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.151"></a>
+<FONT color="green">152</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.152"></a>
+<FONT color="green">153</FONT> PointValuePair optimum<a name="line.153"></a>
+<FONT color="green">154</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.154"></a>
+<FONT color="green">155</FONT> problem.getObjectiveFunction(),<a name="line.155"></a>
+<FONT color="green">156</FONT> problem.getObjectiveFunctionGradient(),<a name="line.156"></a>
+<FONT color="green">157</FONT> GoalType.MINIMIZE,<a name="line.157"></a>
+<FONT color="green">158</FONT> new InitialGuess(new double[] { 0, 0 }));<a name="line.158"></a>
+<FONT color="green">159</FONT> Assert.assertEquals(7.0, optimum.getPoint()[0], 1.0e-10);<a name="line.159"></a>
+<FONT color="green">160</FONT> Assert.assertEquals(3.0, optimum.getPoint()[1], 1.0e-10);<a name="line.160"></a>
+<FONT color="green">161</FONT> Assert.assertEquals(0.0, optimum.getValue(), 1.0e-10);<a name="line.161"></a>
+<FONT color="green">162</FONT> <a name="line.162"></a>
+<FONT color="green">163</FONT> }<a name="line.163"></a>
+<FONT color="green">164</FONT> <a name="line.164"></a>
+<FONT color="green">165</FONT> @Test<a name="line.165"></a>
+<FONT color="green">166</FONT> public void testNoDependency() {<a name="line.166"></a>
+<FONT color="green">167</FONT> LinearProblem problem = new LinearProblem(new double[][] {<a name="line.167"></a>
+<FONT color="green">168</FONT> { 2, 0, 0, 0, 0, 0 },<a name="line.168"></a>
+<FONT color="green">169</FONT> { 0, 2, 0, 0, 0, 0 },<a name="line.169"></a>
+<FONT color="green">170</FONT> { 0, 0, 2, 0, 0, 0 },<a name="line.170"></a>
+<FONT color="green">171</FONT> { 0, 0, 0, 2, 0, 0 },<a name="line.171"></a>
+<FONT color="green">172</FONT> { 0, 0, 0, 0, 2, 0 },<a name="line.172"></a>
+<FONT color="green">173</FONT> { 0, 0, 0, 0, 0, 2 }<a name="line.173"></a>
+<FONT color="green">174</FONT> }, new double[] { 0.0, 1.1, 2.2, 3.3, 4.4, 5.5 });<a name="line.174"></a>
<FONT color="green">175</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.175"></a>
<FONT color="green">176</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.176"></a>
<FONT color="green">177</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.177"></a>
@@ -183,271 +183,292 @@
<FONT color="green">180</FONT> problem.getObjectiveFunction(),<a name="line.180"></a>
<FONT color="green">181</FONT> problem.getObjectiveFunctionGradient(),<a name="line.181"></a>
<FONT color="green">182</FONT> GoalType.MINIMIZE,<a name="line.182"></a>
-<FONT color="green">183</FONT> new InitialGuess(new double[] { 0, 0, 0 }));<a name="line.183"></a>
-<FONT color="green">184</FONT> Assert.assertEquals(1.0, optimum.getPoint()[0], 1.0e-10);<a name="line.184"></a>
-<FONT color="green">185</FONT> Assert.assertEquals(2.0, optimum.getPoint()[1], 1.0e-10);<a name="line.185"></a>
-<FONT color="green">186</FONT> Assert.assertEquals(3.0, optimum.getPoint()[2], 1.0e-10);<a name="line.186"></a>
-<FONT color="green">187</FONT> <a name="line.187"></a>
-<FONT color="green">188</FONT> }<a name="line.188"></a>
-<FONT color="green">189</FONT> <a name="line.189"></a>
-<FONT color="green">190</FONT> @Test<a name="line.190"></a>
-<FONT color="green">191</FONT> public void testTwoSets() {<a name="line.191"></a>
-<FONT color="green">192</FONT> final double epsilon = 1.0e-7;<a name="line.192"></a>
-<FONT color="green">193</FONT> LinearProblem problem = new LinearProblem(new double[][] {<a name="line.193"></a>
-<FONT color="green">194</FONT> { 2, 1, 0, 4, 0, 0 },<a name="line.194"></a>
-<FONT color="green">195</FONT> { -4, -2, 3, -7, 0, 0 },<a name="line.195"></a>
-<FONT color="green">196</FONT> { 4, 1, -2, 8, 0, 0 },<a name="line.196"></a>
-<FONT color="green">197</FONT> { 0, -3, -12, -1, 0, 0 },<a name="line.197"></a>
-<FONT color="green">198</FONT> { 0, 0, 0, 0, epsilon, 1 },<a name="line.198"></a>
-<FONT color="green">199</FONT> { 0, 0, 0, 0, 1, 1 }<a name="line.199"></a>
-<FONT color="green">200</FONT> }, new double[] { 2, -9, 2, 2, 1 + epsilon * epsilon, 2});<a name="line.200"></a>
-<FONT color="green">201</FONT> <a name="line.201"></a>
-<FONT color="green">202</FONT> final Preconditioner preconditioner<a name="line.202"></a>
-<FONT color="green">203</FONT> = new Preconditioner() {<a name="line.203"></a>
-<FONT color="green">204</FONT> public double[] precondition(double[] point, double[] r) {<a name="line.204"></a>
-<FONT color="green">205</FONT> double[] d = r.clone();<a name="line.205"></a>
-<FONT color="green">206</FONT> d[0] /= 72.0;<a name="line.206"></a>
-<FONT color="green">207</FONT> d[1] /= 30.0;<a name="line.207"></a>
-<FONT color="green">208</FONT> d[2] /= 314.0;<a name="line.208"></a>
-<FONT color="green">209</FONT> d[3] /= 260.0;<a name="line.209"></a>
-<FONT color="green">210</FONT> d[4] /= 2 * (1 + epsilon * epsilon);<a name="line.210"></a>
-<FONT color="green">211</FONT> d[5] /= 4.0;<a name="line.211"></a>
-<FONT color="green">212</FONT> return d;<a name="line.212"></a>
-<FONT color="green">213</FONT> }<a name="line.213"></a>
-<FONT color="green">214</FONT> };<a name="line.214"></a>
-<FONT color="green">215</FONT> <a name="line.215"></a>
-<FONT color="green">216</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.216"></a>
-<FONT color="green">217</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.217"></a>
-<FONT color="green">218</FONT> new SimpleValueChecker(1e-13, 1e-13),<a name="line.218"></a>
-<FONT color="green">219</FONT> new BrentSolver(),<a name="line.219"></a>
-<FONT color="green">220</FONT> preconditioner);<a name="line.220"></a>
-<FONT color="green">221</FONT> <a name="line.221"></a>
-<FONT color="green">222</FONT> PointValuePair optimum<a name="line.222"></a>
-<FONT color="green">223</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.223"></a>
-<FONT color="green">224</FONT> problem.getObjectiveFunction(),<a name="line.224"></a>
-<FONT color="green">225</FONT> problem.getObjectiveFunctionGradient(),<a name="line.225"></a>
-<FONT color="green">226</FONT> GoalType.MINIMIZE,<a name="line.226"></a>
-<FONT color="green">227</FONT> new InitialGuess(new double[] { 0, 0, 0, 0, 0, 0 }));<a name="line.227"></a>
-<FONT color="green">228</FONT> Assert.assertEquals( 3.0, optimum.getPoint()[0], 1.0e-10);<a name="line.228"></a>
-<FONT color="green">229</FONT> Assert.assertEquals( 4.0, optimum.getPoint()[1], 1.0e-10);<a name="line.229"></a>
-<FONT color="green">230</FONT> Assert.assertEquals(-1.0, optimum.getPoint()[2], 1.0e-10);<a name="line.230"></a>
-<FONT color="green">231</FONT> Assert.assertEquals(-2.0, optimum.getPoint()[3], 1.0e-10);<a name="line.231"></a>
-<FONT color="green">232</FONT> Assert.assertEquals( 1.0 + epsilon, optimum.getPoint()[4], 1.0e-10);<a name="line.232"></a>
-<FONT color="green">233</FONT> Assert.assertEquals( 1.0 - epsilon, optimum.getPoint()[5], 1.0e-10);<a name="line.233"></a>
-<FONT color="green">234</FONT> <a name="line.234"></a>
-<FONT color="green">235</FONT> }<a name="line.235"></a>
+<FONT color="green">183</FONT> new InitialGuess(new double[] { 0, 0, 0, 0, 0, 0 }));<a name="line.183"></a>
+<FONT color="green">184</FONT> for (int i = 0; i < problem.target.length; ++i) {<a name="line.184"></a>
+<FONT color="green">185</FONT> Assert.assertEquals(0.55 * i, optimum.getPoint()[i], 1.0e-10);<a name="line.185"></a>
+<FONT color="green">186</FONT> }<a name="line.186"></a>
+<FONT color="green">187</FONT> }<a name="line.187"></a>
+<FONT color="green">188</FONT> <a name="line.188"></a>
+<FONT color="green">189</FONT> @Test<a name="line.189"></a>
+<FONT color="green">190</FONT> public void testOneSet() {<a name="line.190"></a>
+<FONT color="green">191</FONT> LinearProblem problem = new LinearProblem(new double[][] {<a name="line.191"></a>
+<FONT color="green">192</FONT> { 1, 0, 0 },<a name="line.192"></a>
+<FONT color="green">193</FONT> { -1, 1, 0 },<a name="line.193"></a>
+<FONT color="green">194</FONT> { 0, -1, 1 }<a name="line.194"></a>
+<FONT color="green">195</FONT> }, new double[] { 1, 1, 1});<a name="line.195"></a>
+<FONT color="green">196</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.196"></a>
+<FONT color="green">197</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.197"></a>
+<FONT color="green">198</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.198"></a>
+<FONT color="green">199</FONT> PointValuePair optimum<a name="line.199"></a>
+<FONT color="green">200</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.200"></a>
+<FONT color="green">201</FONT> problem.getObjectiveFunction(),<a name="line.201"></a>
+<FONT color="green">202</FONT> problem.getObjectiveFunctionGradient(),<a name="line.202"></a>
+<FONT color="green">203</FONT> GoalType.MINIMIZE,<a name="line.203"></a>
+<FONT color="green">204</FONT> new InitialGuess(new double[] { 0, 0, 0 }));<a name="line.204"></a>
+<FONT color="green">205</FONT> Assert.assertEquals(1.0, optimum.getPoint()[0], 1.0e-10);<a name="line.205"></a>
+<FONT color="green">206</FONT> Assert.assertEquals(2.0, optimum.getPoint()[1], 1.0e-10);<a name="line.206"></a>
+<FONT color="green">207</FONT> Assert.assertEquals(3.0, optimum.getPoint()[2], 1.0e-10);<a name="line.207"></a>
+<FONT color="green">208</FONT> <a name="line.208"></a>
+<FONT color="green">209</FONT> }<a name="line.209"></a>
+<FONT color="green">210</FONT> <a name="line.210"></a>
+<FONT color="green">211</FONT> @Test<a name="line.211"></a>
+<FONT color="green">212</FONT> public void testTwoSets() {<a name="line.212"></a>
+<FONT color="green">213</FONT> final double epsilon = 1.0e-7;<a name="line.213"></a>
+<FONT color="green">214</FONT> LinearProblem problem = new LinearProblem(new double[][] {<a name="line.214"></a>
+<FONT color="green">215</FONT> { 2, 1, 0, 4, 0, 0 },<a name="line.215"></a>
+<FONT color="green">216</FONT> { -4, -2, 3, -7, 0, 0 },<a name="line.216"></a>
+<FONT color="green">217</FONT> { 4, 1, -2, 8, 0, 0 },<a name="line.217"></a>
+<FONT color="green">218</FONT> { 0, -3, -12, -1, 0, 0 },<a name="line.218"></a>
+<FONT color="green">219</FONT> { 0, 0, 0, 0, epsilon, 1 },<a name="line.219"></a>
+<FONT color="green">220</FONT> { 0, 0, 0, 0, 1, 1 }<a name="line.220"></a>
+<FONT color="green">221</FONT> }, new double[] { 2, -9, 2, 2, 1 + epsilon * epsilon, 2});<a name="line.221"></a>
+<FONT color="green">222</FONT> <a name="line.222"></a>
+<FONT color="green">223</FONT> final Preconditioner preconditioner<a name="line.223"></a>
+<FONT color="green">224</FONT> = new Preconditioner() {<a name="line.224"></a>
+<FONT color="green">225</FONT> public double[] precondition(double[] point, double[] r) {<a name="line.225"></a>
+<FONT color="green">226</FONT> double[] d = r.clone();<a name="line.226"></a>
+<FONT color="green">227</FONT> d[0] /= 72.0;<a name="line.227"></a>
+<FONT color="green">228</FONT> d[1] /= 30.0;<a name="line.228"></a>
+<FONT color="green">229</FONT> d[2] /= 314.0;<a name="line.229"></a>
+<FONT color="green">230</FONT> d[3] /= 260.0;<a name="line.230"></a>
+<FONT color="green">231</FONT> d[4] /= 2 * (1 + epsilon * epsilon);<a name="line.231"></a>
+<FONT color="green">232</FONT> d[5] /= 4.0;<a name="line.232"></a>
+<FONT color="green">233</FONT> return d;<a name="line.233"></a>
+<FONT color="green">234</FONT> }<a name="line.234"></a>
+<FONT color="green">235</FONT> };<a name="line.235"></a>
<FONT color="green">236</FONT> <a name="line.236"></a>
-<FONT color="green">237</FONT> @Test<a name="line.237"></a>
-<FONT color="green">238</FONT> public void testNonInversible() {<a name="line.238"></a>
-<FONT color="green">239</FONT> LinearProblem problem = new LinearProblem(new double[][] {<a name="line.239"></a>
-<FONT color="green">240</FONT> { 1, 2, -3 },<a name="line.240"></a>
-<FONT color="green">241</FONT> { 2, 1, 3 },<a name="line.241"></a>
-<FONT color="green">242</FONT> { -3, 0, -9 }<a name="line.242"></a>
-<FONT color="green">243</FONT> }, new double[] { 1, 1, 1 });<a name="line.243"></a>
-<FONT color="green">244</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.244"></a>
-<FONT color="green">245</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.245"></a>
-<FONT color="green">246</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.246"></a>
-<FONT color="green">247</FONT> PointValuePair optimum<a name="line.247"></a>
-<FONT color="green">248</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.248"></a>
-<FONT color="green">249</FONT> problem.getObjectiveFunction(),<a name="line.249"></a>
-<FONT color="green">250</FONT> problem.getObjectiveFunctionGradient(),<a name="line.250"></a>
-<FONT color="green">251</FONT> GoalType.MINIMIZE,<a name="line.251"></a>
-<FONT color="green">252</FONT> new InitialGuess(new double[] { 0, 0, 0 }));<a name="line.252"></a>
-<FONT color="green">253</FONT> Assert.assertTrue(optimum.getValue() > 0.5);<a name="line.253"></a>
-<FONT color="green">254</FONT> }<a name="line.254"></a>
+<FONT color="green">237</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.237"></a>
+<FONT color="green">238</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.238"></a>
+<FONT color="green">239</FONT> new SimpleValueChecker(1e-13, 1e-13),<a name="line.239"></a>
+<FONT color="green">240</FONT> new BrentSolver(),<a name="line.240"></a>
+<FONT color="green">241</FONT> preconditioner);<a name="line.241"></a>
+<FONT color="green">242</FONT> <a name="line.242"></a>
+<FONT color="green">243</FONT> PointValuePair optimum<a name="line.243"></a>
+<FONT color="green">244</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.244"></a>
+<FONT color="green">245</FONT> problem.getObjectiveFunction(),<a name="line.245"></a>
+<FONT color="green">246</FONT> problem.getObjectiveFunctionGradient(),<a name="line.246"></a>
+<FONT color="green">247</FONT> GoalType.MINIMIZE,<a name="line.247"></a>
+<FONT color="green">248</FONT> new InitialGuess(new double[] { 0, 0, 0, 0, 0, 0 }));<a name="line.248"></a>
+<FONT color="green">249</FONT> Assert.assertEquals( 3.0, optimum.getPoint()[0], 1.0e-10);<a name="line.249"></a>
+<FONT color="green">250</FONT> Assert.assertEquals( 4.0, optimum.getPoint()[1], 1.0e-10);<a name="line.250"></a>
+<FONT color="green">251</FONT> Assert.assertEquals(-1.0, optimum.getPoint()[2], 1.0e-10);<a name="line.251"></a>
+<FONT color="green">252</FONT> Assert.assertEquals(-2.0, optimum.getPoint()[3], 1.0e-10);<a name="line.252"></a>
+<FONT color="green">253</FONT> Assert.assertEquals( 1.0 + epsilon, optimum.getPoint()[4], 1.0e-10);<a name="line.253"></a>
+<FONT color="green">254</FONT> Assert.assertEquals( 1.0 - epsilon, optimum.getPoint()[5], 1.0e-10);<a name="line.254"></a>
<FONT color="green">255</FONT> <a name="line.255"></a>
-<FONT color="green">256</FONT> @Test<a name="line.256"></a>
-<FONT color="green">257</FONT> public void testIllConditioned() {<a name="line.257"></a>
-<FONT color="green">258</FONT> LinearProblem problem1 = new LinearProblem(new double[][] {<a name="line.258"></a>
-<FONT color="green">259</FONT> { 10.0, 7.0, 8.0, 7.0 },<a name="line.259"></a>
-<FONT color="green">260</FONT> { 7.0, 5.0, 6.0, 5.0 },<a name="line.260"></a>
-<FONT color="green">261</FONT> { 8.0, 6.0, 10.0, 9.0 },<a name="line.261"></a>
-<FONT color="green">262</FONT> { 7.0, 5.0, 9.0, 10.0 }<a name="line.262"></a>
-<FONT color="green">263</FONT> }, new double[] { 32, 23, 33, 31 });<a name="line.263"></a>
-<FONT color="green">264</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.264"></a>
-<FONT color="green">265</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.265"></a>
-<FONT color="green">266</FONT> new SimpleValueChecker(1e-13, 1e-13),<a name="line.266"></a>
-<FONT color="green">267</FONT> new BrentSolver(1e-15, 1e-15));<a name="line.267"></a>
-<FONT color="green">268</FONT> PointValuePair optimum1<a name="line.268"></a>
-<FONT color="green">269</FONT> = optimizer.optimize(new MaxEval(200),<a name="line.269"></a>
-<FONT color="green">270</FONT> problem1.getObjectiveFunction(),<a name="line.270"></a>
-<FONT color="green">271</FONT> problem1.getObjectiveFunctionGradient(),<a name="line.271"></a>
+<FONT color="green">256</FONT> }<a name="line.256"></a>
+<FONT color="green">257</FONT> <a name="line.257"></a>
+<FONT color="green">258</FONT> @Test<a name="line.258"></a>
+<FONT color="green">259</FONT> public void testNonInversible() {<a name="line.259"></a>
+<FONT color="green">260</FONT> LinearProblem problem = new LinearProblem(new double[][] {<a name="line.260"></a>
+<FONT color="green">261</FONT> { 1, 2, -3 },<a name="line.261"></a>
+<FONT color="green">262</FONT> { 2, 1, 3 },<a name="line.262"></a>
+<FONT color="green">263</FONT> { -3, 0, -9 }<a name="line.263"></a>
+<FONT color="green">264</FONT> }, new double[] { 1, 1, 1 });<a name="line.264"></a>
+<FONT color="green">265</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.265"></a>
+<FONT color="green">266</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.266"></a>
+<FONT color="green">267</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.267"></a>
+<FONT color="green">268</FONT> PointValuePair optimum<a name="line.268"></a>
+<FONT color="green">269</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.269"></a>
+<FONT color="green">270</FONT> problem.getObjectiveFunction(),<a name="line.270"></a>
+<FONT color="green">271</FONT> problem.getObjectiveFunctionGradient(),<a name="line.271"></a>
<FONT color="green">272</FONT> GoalType.MINIMIZE,<a name="line.272"></a>
-<FONT color="green">273</FONT> new InitialGuess(new double[] { 0, 1, 2, 3 }));<a name="line.273"></a>
-<FONT color="green">274</FONT> Assert.assertEquals(1.0, optimum1.getPoint()[0], 1.0e-4);<a name="line.274"></a>
-<FONT color="green">275</FONT> Assert.assertEquals(1.0, optimum1.getPoint()[1], 1.0e-4);<a name="line.275"></a>
-<FONT color="green">276</FONT> Assert.assertEquals(1.0, optimum1.getPoint()[2], 1.0e-4);<a name="line.276"></a>
-<FONT color="green">277</FONT> Assert.assertEquals(1.0, optimum1.getPoint()[3], 1.0e-4);<a name="line.277"></a>
-<FONT color="green">278</FONT> <a name="line.278"></a>
-<FONT color="green">279</FONT> LinearProblem problem2 = new LinearProblem(new double[][] {<a name="line.279"></a>
-<FONT color="green">280</FONT> { 10.00, 7.00, 8.10, 7.20 },<a name="line.280"></a>
-<FONT color="green">281</FONT> { 7.08, 5.04, 6.00, 5.00 },<a name="line.281"></a>
-<FONT color="green">282</FONT> { 8.00, 5.98, 9.89, 9.00 },<a name="line.282"></a>
-<FONT color="green">283</FONT> { 6.99, 4.99, 9.00, 9.98 }<a name="line.283"></a>
+<FONT color="green">273</FONT> new InitialGuess(new double[] { 0, 0, 0 }));<a name="line.273"></a>
+<FONT color="green">274</FONT> Assert.assertTrue(optimum.getValue() > 0.5);<a name="line.274"></a>
+<FONT color="green">275</FONT> }<a name="line.275"></a>
+<FONT color="green">276</FONT> <a name="line.276"></a>
+<FONT color="green">277</FONT> @Test<a name="line.277"></a>
+<FONT color="green">278</FONT> public void testIllConditioned() {<a name="line.278"></a>
+<FONT color="green">279</FONT> LinearProblem problem1 = new LinearProblem(new double[][] {<a name="line.279"></a>
+<FONT color="green">280</FONT> { 10.0, 7.0, 8.0, 7.0 },<a name="line.280"></a>
+<FONT color="green">281</FONT> { 7.0, 5.0, 6.0, 5.0 },<a name="line.281"></a>
+<FONT color="green">282</FONT> { 8.0, 6.0, 10.0, 9.0 },<a name="line.282"></a>
+<FONT color="green">283</FONT> { 7.0, 5.0, 9.0, 10.0 }<a name="line.283"></a>
<FONT color="green">284</FONT> }, new double[] { 32, 23, 33, 31 });<a name="line.284"></a>
-<FONT color="green">285</FONT> PointValuePair optimum2<a name="line.285"></a>
-<FONT color="green">286</FONT> = optimizer.optimize(new MaxEval(200),<a name="line.286"></a>
-<FONT color="green">287</FONT> problem2.getObjectiveFunction(),<a name="line.287"></a>
-<FONT color="green">288</FONT> problem2.getObjectiveFunctionGradient(),<a name="line.288"></a>
-<FONT color="green">289</FONT> GoalType.MINIMIZE,<a name="line.289"></a>
-<FONT color="green">290</FONT> new InitialGuess(new double[] { 0, 1, 2, 3 }));<a name="line.290"></a>
-<FONT color="green">291</FONT> Assert.assertEquals(-81.0, optimum2.getPoint()[0], 1.0e-1);<a name="line.291"></a>
-<FONT color="green">292</FONT> Assert.assertEquals(137.0, optimum2.getPoint()[1], 1.0e-1);<a name="line.292"></a>
-<FONT color="green">293</FONT> Assert.assertEquals(-34.0, optimum2.getPoint()[2], 1.0e-1);<a name="line.293"></a>
-<FONT color="green">294</FONT> Assert.assertEquals( 22.0, optimum2.getPoint()[3], 1.0e-1);<a name="line.294"></a>
-<FONT color="green">295</FONT> <a name="line.295"></a>
-<FONT color="green">296</FONT> }<a name="line.296"></a>
-<FONT color="green">297</FONT> <a name="line.297"></a>
-<FONT color="green">298</FONT> @Test<a name="line.298"></a>
-<FONT color="green">299</FONT> public void testMoreEstimatedParametersSimple() {<a name="line.299"></a>
-<FONT color="green">300</FONT> LinearProblem problem = new LinearProblem(new double[][] {<a name="line.300"></a>
-<FONT color="green">301</FONT> { 3.0, 2.0, 0.0, 0.0 },<a name="line.301"></a>
-<FONT color="green">302</FONT> { 0.0, 1.0, -1.0, 1.0 },<a name="line.302"></a>
-<FONT color="green">303</FONT> { 2.0, 0.0, 1.0, 0.0 }<a name="line.303"></a>
-<FONT color="green">304</FONT> }, new double[] { 7.0, 3.0, 5.0 });<a name="line.304"></a>
-<FONT color="green">305</FONT> <a name="line.305"></a>
-<FONT color="green">306</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.306"></a>
-<FONT color="green">307</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.307"></a>
-<FONT color="green">308</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.308"></a>
-<FONT color="green">309</FONT> PointValuePair optimum<a name="line.309"></a>
-<FONT color="green">310</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.310"></a>
-<FONT color="green">311</FONT> problem.getObjectiveFunction(),<a name="line.311"></a>
-<FONT color="green">312</FONT> problem.getObjectiveFunctionGradient(),<a name="line.312"></a>
-<FONT color="green">313</FONT> GoalType.MINIMIZE,<a name="line.313"></a>
-<FONT color="green">314</FONT> new InitialGuess(new double[] { 7, 6, 5, 4 }));<a name="line.314"></a>
-<FONT color="green">315</FONT> Assert.assertEquals(0, optimum.getValue(), 1.0e-10);<a name="line.315"></a>
+<FONT color="green">285</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.285"></a>
+<FONT color="green">286</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.286"></a>
+<FONT color="green">287</FONT> new SimpleValueChecker(1e-13, 1e-13),<a name="line.287"></a>
+<FONT color="green">288</FONT> new BrentSolver(1e-15, 1e-15));<a name="line.288"></a>
+<FONT color="green">289</FONT> PointValuePair optimum1<a name="line.289"></a>
+<FONT color="green">290</FONT> = optimizer.optimize(new MaxEval(200),<a name="line.290"></a>
+<FONT color="green">291</FONT> problem1.getObjectiveFunction(),<a name="line.291"></a>
+<FONT color="green">292</FONT> problem1.getObjectiveFunctionGradient(),<a name="line.292"></a>
+<FONT color="green">293</FONT> GoalType.MINIMIZE,<a name="line.293"></a>
+<FONT color="green">294</FONT> new InitialGuess(new double[] { 0, 1, 2, 3 }));<a name="line.294"></a>
+<FONT color="green">295</FONT> Assert.assertEquals(1.0, optimum1.getPoint()[0], 1.0e-4);<a name="line.295"></a>
+<FONT color="green">296</FONT> Assert.assertEquals(1.0, optimum1.getPoint()[1], 1.0e-4);<a name="line.296"></a>
+<FONT color="green">297</FONT> Assert.assertEquals(1.0, optimum1.getPoint()[2], 1.0e-4);<a name="line.297"></a>
+<FONT color="green">298</FONT> Assert.assertEquals(1.0, optimum1.getPoint()[3], 1.0e-4);<a name="line.298"></a>
+<FONT color="green">299</FONT> <a name="line.299"></a>
+<FONT color="green">300</FONT> LinearProblem problem2 = new LinearProblem(new double[][] {<a name="line.300"></a>
+<FONT color="green">301</FONT> { 10.00, 7.00, 8.10, 7.20 },<a name="line.301"></a>
+<FONT color="green">302</FONT> { 7.08, 5.04, 6.00, 5.00 },<a name="line.302"></a>
+<FONT color="green">303</FONT> { 8.00, 5.98, 9.89, 9.00 },<a name="line.303"></a>
+<FONT color="green">304</FONT> { 6.99, 4.99, 9.00, 9.98 }<a name="line.304"></a>
+<FONT color="green">305</FONT> }, new double[] { 32, 23, 33, 31 });<a name="line.305"></a>
+<FONT color="green">306</FONT> PointValuePair optimum2<a name="line.306"></a>
+<FONT color="green">307</FONT> = optimizer.optimize(new MaxEval(200),<a name="line.307"></a>
+<FONT color="green">308</FONT> problem2.getObjectiveFunction(),<a name="line.308"></a>
+<FONT color="green">309</FONT> problem2.getObjectiveFunctionGradient(),<a name="line.309"></a>
+<FONT color="green">310</FONT> GoalType.MINIMIZE,<a name="line.310"></a>
+<FONT color="green">311</FONT> new InitialGuess(new double[] { 0, 1, 2, 3 }));<a name="line.311"></a>
+<FONT color="green">312</FONT> Assert.assertEquals(-81.0, optimum2.getPoint()[0], 1.0e-1);<a name="line.312"></a>
+<FONT color="green">313</FONT> Assert.assertEquals(137.0, optimum2.getPoint()[1], 1.0e-1);<a name="line.313"></a>
+<FONT color="green">314</FONT> Assert.assertEquals(-34.0, optimum2.getPoint()[2], 1.0e-1);<a name="line.314"></a>
+<FONT color="green">315</FONT> Assert.assertEquals( 22.0, optimum2.getPoint()[3], 1.0e-1);<a name="line.315"></a>
<FONT color="green">316</FONT> <a name="line.316"></a>
<FONT color="green">317</FONT> }<a name="line.317"></a>
<FONT color="green">318</FONT> <a name="line.318"></a>
<FONT color="green">319</FONT> @Test<a name="line.319"></a>
-<FONT color="green">320</FONT> public void testMoreEstimatedParametersUnsorted() {<a name="line.320"></a>
+<FONT color="green">320</FONT> public void testMoreEstimatedParametersSimple() {<a name="line.320"></a>
<FONT color="green">321</FONT> LinearProblem problem = new LinearProblem(new double[][] {<a name="line.321"></a>
-<FONT color="green">322</FONT> { 1.0, 1.0, 0.0, 0.0, 0.0, 0.0 },<a name="line.322"></a>
-<FONT color="green">323</FONT> { 0.0, 0.0, 1.0, 1.0, 1.0, 0.0 },<a name="line.323"></a>
-<FONT color="green">324</FONT> { 0.0, 0.0, 0.0, 0.0, 1.0, -1.0 },<a name="line.324"></a>
-<FONT color="green">325</FONT> { 0.0, 0.0, -1.0, 1.0, 0.0, 1.0 },<a name="line.325"></a>
-<FONT color="green">326</FONT> { 0.0, 0.0, 0.0, -1.0, 1.0, 0.0 }<a name="line.326"></a>
-<FONT color="green">327</FONT> }, new double[] { 3.0, 12.0, -1.0, 7.0, 1.0 });<a name="line.327"></a>
-<FONT color="green">328</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.328"></a>
-<FONT color="green">329</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.329"></a>
-<FONT color="green">330</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.330"></a>
-<FONT color="green">331</FONT> PointValuePair optimum<a name="line.331"></a>
-<FONT color="green">332</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.332"></a>
-<FONT color="green">333</FONT> problem.getObjectiveFunction(),<a name="line.333"></a>
-<FONT color="green">334</FONT> problem.getObjectiveFunctionGradient(),<a name="line.334"></a>
-<FONT color="green">335</FONT> GoalType.MINIMIZE,<a name="line.335"></a>
-<FONT color="green">336</FONT> new InitialGuess(new double[] { 2, 2, 2, 2, 2, 2 }));<a name="line.336"></a>
-<FONT color="green">337</FONT> Assert.assertEquals(0, optimum.getValue(), 1.0e-10);<a name="line.337"></a>
+<FONT color="green">322</FONT> { 3.0, 2.0, 0.0, 0.0 },<a name="line.322"></a>
+<FONT color="green">323</FONT> { 0.0, 1.0, -1.0, 1.0 },<a name="line.323"></a>
+<FONT color="green">324</FONT> { 2.0, 0.0, 1.0, 0.0 }<a name="line.324"></a>
+<FONT color="green">325</FONT> }, new double[] { 7.0, 3.0, 5.0 });<a name="line.325"></a>
+<FONT color="green">326</FONT> <a name="line.326"></a>
+<FONT color="green">327</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.327"></a>
+<FONT color="green">328</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.328"></a>
+<FONT color="green">329</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.329"></a>
+<FONT color="green">330</FONT> PointValuePair optimum<a name="line.330"></a>
+<FONT color="green">331</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.331"></a>
+<FONT color="green">332</FONT> problem.getObjectiveFunction(),<a name="line.332"></a>
+<FONT color="green">333</FONT> problem.getObjectiveFunctionGradient(),<a name="line.333"></a>
+<FONT color="green">334</FONT> GoalType.MINIMIZE,<a name="line.334"></a>
+<FONT color="green">335</FONT> new InitialGuess(new double[] { 7, 6, 5, 4 }));<a name="line.335"></a>
+<FONT color="green">336</FONT> Assert.assertEquals(0, optimum.getValue(), 1.0e-10);<a name="line.336"></a>
+<FONT color="green">337</FONT> <a name="line.337"></a>
<FONT color="green">338</FONT> }<a name="line.338"></a>
<FONT color="green">339</FONT> <a name="line.339"></a>
<FONT color="green">340</FONT> @Test<a name="line.340"></a>
-<FONT color="green">341</FONT> public void testRedundantEquations() {<a name="line.341"></a>
+<FONT color="green">341</FONT> public void testMoreEstimatedParametersUnsorted() {<a name="line.341"></a>
<FONT color="green">342</FONT> LinearProblem problem = new LinearProblem(new double[][] {<a name="line.342"></a>
-<FONT color="green">343</FONT> { 1.0, 1.0 },<a name="line.343"></a>
-<FONT color="green">344</FONT> { 1.0, -1.0 },<a name="line.344"></a>
-<FONT color="green">345</FONT> { 1.0, 3.0 }<a name="line.345"></a>
-<FONT color="green">346</FONT> }, new double[] { 3.0, 1.0, 5.0 });<a name="line.346"></a>
-<FONT color="green">347</FONT> <a name="line.347"></a>
-<FONT color="green">348</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.348"></a>
-<FONT color="green">349</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.349"></a>
-<FONT color="green">350</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.350"></a>
-<FONT color="green">351</FONT> PointValuePair optimum<a name="line.351"></a>
-<FONT color="green">352</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.352"></a>
-<FONT color="green">353</FONT> problem.getObjectiveFunction(),<a name="line.353"></a>
-<FONT color="green">354</FONT> problem.getObjectiveFunctionGradient(),<a name="line.354"></a>
-<FONT color="green">355</FONT> GoalType.MINIMIZE,<a name="line.355"></a>
-<FONT color="green">356</FONT> new InitialGuess(new double[] { 1, 1 }));<a name="line.356"></a>
-<FONT color="green">357</FONT> Assert.assertEquals(2.0, optimum.getPoint()[0], 1.0e-8);<a name="line.357"></a>
-<FONT color="green">358</FONT> Assert.assertEquals(1.0, optimum.getPoint()[1], 1.0e-8);<a name="line.358"></a>
-<FONT color="green">359</FONT> <a name="line.359"></a>
-<FONT color="green">360</FONT> }<a name="line.360"></a>
-<FONT color="green">361</FONT> <a name="line.361"></a>
-<FONT color="green">362</FONT> @Test<a name="line.362"></a>
-<FONT color="green">363</FONT> public void testInconsistentEquations() {<a name="line.363"></a>
-<FONT color="green">364</FONT> LinearProblem problem = new LinearProblem(new double[][] {<a name="line.364"></a>
-<FONT color="green">365</FONT> { 1.0, 1.0 },<a name="line.365"></a>
-<FONT color="green">366</FONT> { 1.0, -1.0 },<a name="line.366"></a>
-<FONT color="green">367</FONT> { 1.0, 3.0 }<a name="line.367"></a>
-<FONT color="green">368</FONT> }, new double[] { 3.0, 1.0, 4.0 });<a name="line.368"></a>
-<FONT color="green">369</FONT> <a name="line.369"></a>
-<FONT color="green">370</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.370"></a>
-<FONT color="green">371</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.371"></a>
-<FONT color="green">372</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.372"></a>
-<FONT color="green">373</FONT> PointValuePair optimum<a name="line.373"></a>
-<FONT color="green">374</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.374"></a>
-<FONT color="green">375</FONT> problem.getObjectiveFunction(),<a name="line.375"></a>
-<FONT color="green">376</FONT> problem.getObjectiveFunctionGradient(),<a name="line.376"></a>
-<FONT color="green">377</FONT> GoalType.MINIMIZE,<a name="line.377"></a>
-<FONT color="green">378</FONT> new InitialGuess(new double[] { 1, 1 }));<a name="line.378"></a>
-<FONT color="green">379</FONT> Assert.assertTrue(optimum.getValue() > 0.1);<a name="line.379"></a>
+<FONT color="green">343</FONT> { 1.0, 1.0, 0.0, 0.0, 0.0, 0.0 },<a name="line.343"></a>
+<FONT color="green">344</FONT> { 0.0, 0.0, 1.0, 1.0, 1.0, 0.0 },<a name="line.344"></a>
+<FONT color="green">345</FONT> { 0.0, 0.0, 0.0, 0.0, 1.0, -1.0 },<a name="line.345"></a>
+<FONT color="green">346</FONT> { 0.0, 0.0, -1.0, 1.0, 0.0, 1.0 },<a name="line.346"></a>
+<FONT color="green">347</FONT> { 0.0, 0.0, 0.0, -1.0, 1.0, 0.0 }<a name="line.347"></a>
+<FONT color="green">348</FONT> }, new double[] { 3.0, 12.0, -1.0, 7.0, 1.0 });<a name="line.348"></a>
+<FONT color="green">349</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.349"></a>
+<FONT color="green">350</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.350"></a>
+<FONT color="green">351</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.351"></a>
+<FONT color="green">352</FONT> PointValuePair optimum<a name="line.352"></a>
+<FONT color="green">353</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.353"></a>
+<FONT color="green">354</FONT> problem.getObjectiveFunction(),<a name="line.354"></a>
+<FONT color="green">355</FONT> problem.getObjectiveFunctionGradient(),<a name="line.355"></a>
+<FONT color="green">356</FONT> GoalType.MINIMIZE,<a name="line.356"></a>
+<FONT color="green">357</FONT> new InitialGuess(new double[] { 2, 2, 2, 2, 2, 2 }));<a name="line.357"></a>
+<FONT color="green">358</FONT> Assert.assertEquals(0, optimum.getValue(), 1.0e-10);<a name="line.358"></a>
+<FONT color="green">359</FONT> }<a name="line.359"></a>
+<FONT color="green">360</FONT> <a name="line.360"></a>
+<FONT color="green">361</FONT> @Test<a name="line.361"></a>
+<FONT color="green">362</FONT> public void testRedundantEquations() {<a name="line.362"></a>
+<FONT color="green">363</FONT> LinearProblem problem = new LinearProblem(new double[][] {<a name="line.363"></a>
+<FONT color="green">364</FONT> { 1.0, 1.0 },<a name="line.364"></a>
+<FONT color="green">365</FONT> { 1.0, -1.0 },<a name="line.365"></a>
+<FONT color="green">366</FONT> { 1.0, 3.0 }<a name="line.366"></a>
+<FONT color="green">367</FONT> }, new double[] { 3.0, 1.0, 5.0 });<a name="line.367"></a>
+<FONT color="green">368</FONT> <a name="line.368"></a>
+<FONT color="green">369</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.369"></a>
+<FONT color="green">370</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.370"></a>
+<FONT color="green">371</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.371"></a>
+<FONT color="green">372</FONT> PointValuePair optimum<a name="line.372"></a>
+<FONT color="green">373</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.373"></a>
+<FONT color="green">374</FONT> problem.getObjectiveFunction(),<a name="line.374"></a>
+<FONT color="green">375</FONT> problem.getObjectiveFunctionGradient(),<a name="line.375"></a>
+<FONT color="green">376</FONT> GoalType.MINIMIZE,<a name="line.376"></a>
+<FONT color="green">377</FONT> new InitialGuess(new double[] { 1, 1 }));<a name="line.377"></a>
+<FONT color="green">378</FONT> Assert.assertEquals(2.0, optimum.getPoint()[0], 1.0e-8);<a name="line.378"></a>
+<FONT color="green">379</FONT> Assert.assertEquals(1.0, optimum.getPoint()[1], 1.0e-8);<a name="line.379"></a>
<FONT color="green">380</FONT> <a name="line.380"></a>
<FONT color="green">381</FONT> }<a name="line.381"></a>
<FONT color="green">382</FONT> <a name="line.382"></a>
<FONT color="green">383</FONT> @Test<a name="line.383"></a>
-<FONT color="green">384</FONT> public void testCircleFitting() {<a name="line.384"></a>
-<FONT color="green">385</FONT> CircleScalar problem = new CircleScalar();<a name="line.385"></a>
-<FONT color="green">386</FONT> problem.addPoint( 30.0, 68.0);<a name="line.386"></a>
-<FONT color="green">387</FONT> problem.addPoint( 50.0, -6.0);<a name="line.387"></a>
-<FONT color="green">388</FONT> problem.addPoint(110.0, -20.0);<a name="line.388"></a>
-<FONT color="green">389</FONT> problem.addPoint( 35.0, 15.0);<a name="line.389"></a>
-<FONT color="green">390</FONT> problem.addPoint( 45.0, 97.0);<a name="line.390"></a>
+<FONT color="green">384</FONT> public void testInconsistentEquations() {<a name="line.384"></a>
+<FONT color="green">385</FONT> LinearProblem problem = new LinearProblem(new double[][] {<a name="line.385"></a>
+<FONT color="green">386</FONT> { 1.0, 1.0 },<a name="line.386"></a>
+<FONT color="green">387</FONT> { 1.0, -1.0 },<a name="line.387"></a>
+<FONT color="green">388</FONT> { 1.0, 3.0 }<a name="line.388"></a>
+<FONT color="green">389</FONT> }, new double[] { 3.0, 1.0, 4.0 });<a name="line.389"></a>
+<FONT color="green">390</FONT> <a name="line.390"></a>
<FONT color="green">391</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.391"></a>
-<FONT color="green">392</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.392"></a>
-<FONT color="green">393</FONT> new SimpleValueChecker(1e-30, 1e-30),<a name="line.393"></a>
-<FONT color="green">394</FONT> new BrentSolver(1e-15, 1e-13));<a name="line.394"></a>
-<FONT color="green">395</FONT> PointValuePair optimum<a name="line.395"></a>
-<FONT color="green">396</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.396"></a>
-<FONT color="green">397</FONT> problem.getObjectiveFunction(),<a name="line.397"></a>
-<FONT color="green">398</FONT> problem.getObjectiveFunctionGradient(),<a name="line.398"></a>
-<FONT color="green">399</FONT> GoalType.MINIMIZE,<a name="line.399"></a>
-<FONT color="green">400</FONT> new InitialGuess(new double[] { 98.680, 47.345 }));<a name="line.400"></a>
-<FONT color="green">401</FONT> Vector2D center = new Vector2D(optimum.getPointRef()[0], optimum.getPointRef()[1]);<a name="line.401"></a>
-<FONT color="green">402</FONT> Assert.assertEquals(69.960161753, problem.getRadius(center), 1.0e-8);<a name="line.402"></a>
-<FONT color="green">403</FONT> Assert.assertEquals(96.075902096, center.getX(), 1.0e-8);<a name="line.403"></a>
-<FONT color="green">404</FONT> Assert.assertEquals(48.135167894, center.getY(), 1.0e-8);<a name="line.404"></a>
-<FONT color="green">405</FONT> }<a name="line.405"></a>
-<FONT color="green">406</FONT> <a name="line.406"></a>
-<FONT color="green">407</FONT> private static class LinearProblem {<a name="line.407"></a>
-<FONT color="green">408</FONT> final RealMatrix factors;<a name="line.408"></a>
-<FONT color="green">409</FONT> final double[] target;<a name="line.409"></a>
-<FONT color="green">410</FONT> <a name="line.410"></a>
-<FONT color="green">411</FONT> public LinearProblem(double[][] factors,<a name="line.411"></a>
-<FONT color="green">412</FONT> double[] target) {<a name="line.412"></a>
-<FONT color="green">413</FONT> this.factors = new BlockRealMatrix(factors);<a name="line.413"></a>
-<FONT color="green">414</FONT> this.target = target;<a name="line.414"></a>
-<FONT color="green">415</FONT> }<a name="line.415"></a>
-<FONT color="green">416</FONT> <a name="line.416"></a>
-<FONT color="green">417</FONT> public ObjectiveFunction getObjectiveFunction() {<a name="line.417"></a>
-<FONT color="green">418</FONT> return new ObjectiveFunction(new MultivariateFunction() {<a name="line.418"></a>
-<FONT color="green">419</FONT> public double value(double[] point) {<a name="line.419"></a>
-<FONT color="green">420</FONT> double[] y = factors.operate(point);<a name="line.420"></a>
-<FONT color="green">421</FONT> double sum = 0;<a name="line.421"></a>
-<FONT color="green">422</FONT> for (int i = 0; i < y.length; ++i) {<a name="line.422"></a>
-<FONT color="green">423</FONT> double ri = y[i] - target[i];<a name="line.423"></a>
-<FONT color="green">424</FONT> sum += ri * ri;<a name="line.424"></a>
-<FONT color="green">425</FONT> }<a name="line.425"></a>
-<FONT color="green">426</FONT> return sum;<a name="line.426"></a>
-<FONT color="green">427</FONT> }<a name="line.427"></a>
-<FONT color="green">428</FONT> });<a name="line.428"></a>
-<FONT color="green">429</FONT> }<a name="line.429"></a>
-<FONT color="green">430</FONT> <a name="line.430"></a>
-<FONT color="green">431</FONT> public ObjectiveFunctionGradient getObjectiveFunctionGradient() {<a name="line.431"></a>
-<FONT color="green">432</FONT> return new ObjectiveFunctionGradient(new MultivariateVectorFunction() {<a name="line.432"></a>
-<FONT color="green">433</FONT> public double[] value(double[] point) {<a name="line.433"></a>
-<FONT color="green">434</FONT> double[] r = factors.operate(point);<a name="line.434"></a>
-<FONT color="green">435</FONT> for (int i = 0; i < r.length; ++i) {<a name="line.435"></a>
-<FONT color="green">436</FONT> r[i] -= target[i];<a name="line.436"></a>
-<FONT color="green">437</FONT> }<a name="line.437"></a>
-<FONT color="green">438</FONT> double[] p = factors.transpose().operate(r);<a name="line.438"></a>
-<FONT color="green">439</FONT> for (int i = 0; i < p.length; ++i) {<a name="line.439"></a>
-<FONT color="green">440</FONT> p[i] *= 2;<a name="line.440"></a>
-<FONT color="green">441</FONT> }<a name="line.441"></a>
-<FONT color="green">442</FONT> return p;<a name="line.442"></a>
-<FONT color="green">443</FONT> }<a name="line.443"></a>
-<FONT color="green">444</FONT> });<a name="line.444"></a>
-<FONT color="green">445</FONT> }<a name="line.445"></a>
-<FONT color="green">446</FONT> }<a name="line.446"></a>
-<FONT color="green">447</FONT> }<a name="line.447"></a>
+<FONT color="green">392</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.392"></a>
+<FONT color="green">393</FONT> new SimpleValueChecker(1e-6, 1e-6));<a name="line.393"></a>
+<FONT color="green">394</FONT> PointValuePair optimum<a name="line.394"></a>
+<FONT color="green">395</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.395"></a>
+<FONT color="green">396</FONT> problem.getObjectiveFunction(),<a name="line.396"></a>
+<FONT color="green">397</FONT> problem.getObjectiveFunctionGradient(),<a name="line.397"></a>
+<FONT color="green">398</FONT> GoalType.MINIMIZE,<a name="line.398"></a>
+<FONT color="green">399</FONT> new InitialGuess(new double[] { 1, 1 }));<a name="line.399"></a>
+<FONT color="green">400</FONT> Assert.assertTrue(optimum.getValue() > 0.1);<a name="line.400"></a>
+<FONT color="green">401</FONT> <a name="line.401"></a>
+<FONT color="green">402</FONT> }<a name="line.402"></a>
+<FONT color="green">403</FONT> <a name="line.403"></a>
+<FONT color="green">404</FONT> @Test<a name="line.404"></a>
+<FONT color="green">405</FONT> public void testCircleFitting() {<a name="line.405"></a>
+<FONT color="green">406</FONT> CircleScalar problem = new CircleScalar();<a name="line.406"></a>
+<FONT color="green">407</FONT> problem.addPoint( 30.0, 68.0);<a name="line.407"></a>
+<FONT color="green">408</FONT> problem.addPoint( 50.0, -6.0);<a name="line.408"></a>
+<FONT color="green">409</FONT> problem.addPoint(110.0, -20.0);<a name="line.409"></a>
+<FONT color="green">410</FONT> problem.addPoint( 35.0, 15.0);<a name="line.410"></a>
+<FONT color="green">411</FONT> problem.addPoint( 45.0, 97.0);<a name="line.411"></a>
+<FONT color="green">412</FONT> NonLinearConjugateGradientOptimizer optimizer<a name="line.412"></a>
+<FONT color="green">413</FONT> = new NonLinearConjugateGradientOptimizer(NonLinearConjugateGradientOptimizer.Formula.POLAK_RIBIERE,<a name="line.413"></a>
+<FONT color="green">414</FONT> new SimpleValueChecker(1e-30, 1e-30),<a name="line.414"></a>
+<FONT color="green">415</FONT> new BrentSolver(1e-15, 1e-13));<a name="line.415"></a>
+<FONT color="green">416</FONT> PointValuePair optimum<a name="line.416"></a>
+<FONT color="green">417</FONT> = optimizer.optimize(new MaxEval(100),<a name="line.417"></a>
+<FONT color="green">418</FONT> problem.getObjectiveFunction(),<a name="line.418"></a>
+<FONT color="green">419</FONT> problem.getObjectiveFunctionGradient(),<a name="line.419"></a>
+<FONT color="green">420</FONT> GoalType.MINIMIZE,<a name="line.420"></a>
+<FONT color="green">421</FONT> new InitialGuess(new double[] { 98.680, 47.345 }));<a name="line.421"></a>
+<FONT color="green">422</FONT> Vector2D center = new Vector2D(optimum.getPointRef()[0], optimum.getPointRef()[1]);<a name="line.422"></a>
+<FONT color="green">423</FONT> Assert.assertEquals(69.960161753, problem.getRadius(center), 1.0e-8);<a name="line.423"></a>
+<FONT color="green">424</FONT> Assert.assertEquals(96.075902096, center.getX(), 1.0e-8);<a name="line.424"></a>
+<FONT color="green">425</FONT> Assert.assertEquals(48.135167894, center.getY(), 1.0e-8);<a name="line.425"></a>
+<FONT color="green">426</FONT> }<a name="line.426"></a>
+<FONT color="green">427</FONT> <a name="line.427"></a>
+<FONT color="green">428</FONT> private static class LinearProblem {<a name="line.428"></a>
+<FONT color="green">429</FONT> final RealMatrix factors;<a name="line.429"></a>
+<FONT color="green">430</FONT> final double[] target;<a name="line.430"></a>
+<FONT color="green">431</FONT> <a name="line.431"></a>
+<FONT color="green">432</FONT> public LinearProblem(double[][] factors,<a name="line.432"></a>
+<FONT color="green">433</FONT> double[] target) {<a name="line.433"></a>
+<FONT color="green">434</FONT> this.factors = new BlockRealMatrix(factors);<a name="line.434"></a>
+<FONT color="green">435</FONT> this.target = target;<a name="line.435"></a>
+<FONT color="green">436</FONT> }<a name="line.436"></a>
+<FONT color="green">437</FONT> <a name="line.437"></a>
+<FONT color="green">438</FONT> public ObjectiveFunction getObjectiveFunction() {<a name="line.438"></a>
+<FONT color="green">439</FONT> return new ObjectiveFunction(new MultivariateFunction() {<a name="line.439"></a>
+<FONT color="green">440</FONT> public double value(double[] point) {<a name="line.440"></a>
+<FONT color="green">441</FONT> double[] y = factors.operate(point);<a name="line.441"></a>
+<FONT color="green">442</FONT> double sum = 0;<a name="line.442"></a>
+<FONT color="green">443</FONT> for (int i = 0; i < y.length; ++i) {<a name="line.443"></a>
+<FONT color="green">444</FONT> double ri = y[i] - target[i];<a name="line.444"></a>
+<FONT color="green">445</FONT> sum += ri * ri;<a name="line.445"></a>
+<FONT color="green">446</FONT> }<a name="line.446"></a>
+<FONT color="green">447</FONT> return sum;<a name="line.447"></a>
+<FONT color="green">448</FONT> }<a name="line.448"></a>
+<FONT color="green">449</FONT> });<a name="line.449"></a>
+<FONT color="green">450</FONT> }<a name="line.450"></a>
+<FONT color="green">451</FONT> <a name="line.451"></a>
+<FONT color="green">452</FONT> public ObjectiveFunctionGradient getObjectiveFunctionGradient() {<a name="line.452"></a>
+<FONT color="green">453</FONT> return new ObjectiveFunctionGradient(new MultivariateVectorFunction() {<a name="line.453"></a>
+<FONT color="green">454</FONT> public double[] value(double[] point) {<a name="line.454"></a>
+<FONT color="green">455</FONT> double[] r = factors.operate(point);<a name="line.455"></a>
+<FONT color="green">456</FONT> for (int i = 0; i < r.length; ++i) {<a name="line.456"></a>
+<FONT color="green">457</FONT> r[i] -= target[i];<a name="line.457"></a>
+<FONT color="green">458</FONT> }<a name="line.458"></a>
+<FONT color="green">459</FONT> double[] p = factors.transpose().operate(r);<a name="line.459"></a>
+<FONT color="green">460</FONT> for (int i = 0; i < p.length; ++i) {<a name="line.460"></a>
+<FONT color="green">461</FONT> p[i] *= 2;<a name="line.461"></a>
+<FONT color="green">462</FONT> }<a name="line.462"></a>
+<FONT color="green">463</FONT> return p;<a name="line.463"></a>
+<FONT color="green">464</FONT> }<a name="line.464"></a>
[... 8 lines stripped ...]