Mercurial > hg > de.mpg.mpiwg.itgroup.digilib.plugin

comparison libs/commons-math-2.1/docs/apidocs/src-html/org/apache/commons/math/optimization/MultiStartUnivariateRealOptimizer.html @ 13:cbf34dd4d7e6

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
commons-math-2.1 added
author dwinter
date Tue, 04 Jan 2011 10:02:07 +0100
parents
children
comparison
equal deleted inserted replaced
12:970d26a94fb7 13:cbf34dd4d7e6
1 <HTML>
2 <BODY BGCOLOR="white">
3 <PRE>
4 <FONT color="green">001</FONT> /*<a name="line.1"></a>
5 <FONT color="green">002</FONT> * Licensed to the Apache Software Foundation (ASF) under one or more<a name="line.2"></a>
6 <FONT color="green">003</FONT> * contributor license agreements. See the NOTICE file distributed with<a name="line.3"></a>
7 <FONT color="green">004</FONT> * this work for additional information regarding copyright ownership.<a name="line.4"></a>
8 <FONT color="green">005</FONT> * The ASF licenses this file to You under the Apache License, Version 2.0<a name="line.5"></a>
9 <FONT color="green">006</FONT> * (the "License"); you may not use this file except in compliance with<a name="line.6"></a>
10 <FONT color="green">007</FONT> * the License. You may obtain a copy of the License at<a name="line.7"></a>
11 <FONT color="green">008</FONT> *<a name="line.8"></a>
12 <FONT color="green">009</FONT> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.9"></a>
13 <FONT color="green">010</FONT> *<a name="line.10"></a>
14 <FONT color="green">011</FONT> * Unless required by applicable law or agreed to in writing, software<a name="line.11"></a>
15 <FONT color="green">012</FONT> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.12"></a>
16 <FONT color="green">013</FONT> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.13"></a>
17 <FONT color="green">014</FONT> * See the License for the specific language governing permissions and<a name="line.14"></a>
18 <FONT color="green">015</FONT> * limitations under the License.<a name="line.15"></a>
19 <FONT color="green">016</FONT> */<a name="line.16"></a>
20 <FONT color="green">017</FONT> <a name="line.17"></a>
21 <FONT color="green">018</FONT> package org.apache.commons.math.optimization;<a name="line.18"></a>
22 <FONT color="green">019</FONT> <a name="line.19"></a>
23 <FONT color="green">020</FONT> import org.apache.commons.math.ConvergenceException;<a name="line.20"></a>
24 <FONT color="green">021</FONT> import org.apache.commons.math.FunctionEvaluationException;<a name="line.21"></a>
25 <FONT color="green">022</FONT> import org.apache.commons.math.MathRuntimeException;<a name="line.22"></a>
26 <FONT color="green">023</FONT> import org.apache.commons.math.analysis.UnivariateRealFunction;<a name="line.23"></a>
27 <FONT color="green">024</FONT> import org.apache.commons.math.random.RandomGenerator;<a name="line.24"></a>
28 <FONT color="green">025</FONT> <a name="line.25"></a>
29 <FONT color="green">026</FONT> /**<a name="line.26"></a>
30 <FONT color="green">027</FONT> * Special implementation of the {@link UnivariateRealOptimizer} interface adding<a name="line.27"></a>
31 <FONT color="green">028</FONT> * multi-start features to an existing optimizer.<a name="line.28"></a>
32 <FONT color="green">029</FONT> * &lt;p&gt;<a name="line.29"></a>
33 <FONT color="green">030</FONT> * This class wraps a classical optimizer to use it several times in<a name="line.30"></a>
34 <FONT color="green">031</FONT> * turn with different starting points in order to avoid being trapped<a name="line.31"></a>
35 <FONT color="green">032</FONT> * into a local extremum when looking for a global one.<a name="line.32"></a>
36 <FONT color="green">033</FONT> * &lt;/p&gt;<a name="line.33"></a>
37 <FONT color="green">034</FONT> * @version $Revision: 811685 $ $Date: 2009-09-05 13:36:48 -0400 (Sat, 05 Sep 2009) $<a name="line.34"></a>
38 <FONT color="green">035</FONT> * @since 2.0<a name="line.35"></a>
39 <FONT color="green">036</FONT> */<a name="line.36"></a>
40 <FONT color="green">037</FONT> public class MultiStartUnivariateRealOptimizer implements UnivariateRealOptimizer {<a name="line.37"></a>
41 <FONT color="green">038</FONT> <a name="line.38"></a>
42 <FONT color="green">039</FONT> /** Serializable version identifier. */<a name="line.39"></a>
43 <FONT color="green">040</FONT> private static final long serialVersionUID = 5983375963110961019L;<a name="line.40"></a>
44 <FONT color="green">041</FONT> <a name="line.41"></a>
45 <FONT color="green">042</FONT> /** Underlying classical optimizer. */<a name="line.42"></a>
46 <FONT color="green">043</FONT> private final UnivariateRealOptimizer optimizer;<a name="line.43"></a>
47 <FONT color="green">044</FONT> <a name="line.44"></a>
48 <FONT color="green">045</FONT> /** Maximal number of iterations allowed. */<a name="line.45"></a>
49 <FONT color="green">046</FONT> private int maxIterations;<a name="line.46"></a>
50 <FONT color="green">047</FONT> <a name="line.47"></a>
51 <FONT color="green">048</FONT> /** Maximal number of evaluations allowed. */<a name="line.48"></a>
52 <FONT color="green">049</FONT> private int maxEvaluations;<a name="line.49"></a>
53 <FONT color="green">050</FONT> <a name="line.50"></a>
54 <FONT color="green">051</FONT> /** Number of iterations already performed for all starts. */<a name="line.51"></a>
55 <FONT color="green">052</FONT> private int totalIterations;<a name="line.52"></a>
56 <FONT color="green">053</FONT> <a name="line.53"></a>
57 <FONT color="green">054</FONT> /** Number of evaluations already performed for all starts. */<a name="line.54"></a>
58 <FONT color="green">055</FONT> private int totalEvaluations;<a name="line.55"></a>
59 <FONT color="green">056</FONT> <a name="line.56"></a>
60 <FONT color="green">057</FONT> /** Number of starts to go. */<a name="line.57"></a>
61 <FONT color="green">058</FONT> private int starts;<a name="line.58"></a>
62 <FONT color="green">059</FONT> <a name="line.59"></a>
63 <FONT color="green">060</FONT> /** Random generator for multi-start. */<a name="line.60"></a>
64 <FONT color="green">061</FONT> private RandomGenerator generator;<a name="line.61"></a>
65 <FONT color="green">062</FONT> <a name="line.62"></a>
66 <FONT color="green">063</FONT> /** Found optima. */<a name="line.63"></a>
67 <FONT color="green">064</FONT> private double[] optima;<a name="line.64"></a>
68 <FONT color="green">065</FONT> <a name="line.65"></a>
69 <FONT color="green">066</FONT> /** Found function values at optima. */<a name="line.66"></a>
70 <FONT color="green">067</FONT> private double[] optimaValues;<a name="line.67"></a>
71 <FONT color="green">068</FONT> <a name="line.68"></a>
72 <FONT color="green">069</FONT> /**<a name="line.69"></a>
73 <FONT color="green">070</FONT> * Create a multi-start optimizer from a single-start optimizer<a name="line.70"></a>
74 <FONT color="green">071</FONT> * @param optimizer single-start optimizer to wrap<a name="line.71"></a>
75 <FONT color="green">072</FONT> * @param starts number of starts to perform (including the<a name="line.72"></a>
76 <FONT color="green">073</FONT> * first one), multi-start is disabled if value is less than or<a name="line.73"></a>
77 <FONT color="green">074</FONT> * equal to 1<a name="line.74"></a>
78 <FONT color="green">075</FONT> * @param generator random generator to use for restarts<a name="line.75"></a>
79 <FONT color="green">076</FONT> */<a name="line.76"></a>
80 <FONT color="green">077</FONT> public MultiStartUnivariateRealOptimizer(final UnivariateRealOptimizer optimizer,<a name="line.77"></a>
81 <FONT color="green">078</FONT> final int starts,<a name="line.78"></a>
82 <FONT color="green">079</FONT> final RandomGenerator generator) {<a name="line.79"></a>
83 <FONT color="green">080</FONT> this.optimizer = optimizer;<a name="line.80"></a>
84 <FONT color="green">081</FONT> this.totalIterations = 0;<a name="line.81"></a>
85 <FONT color="green">082</FONT> this.starts = starts;<a name="line.82"></a>
86 <FONT color="green">083</FONT> this.generator = generator;<a name="line.83"></a>
87 <FONT color="green">084</FONT> this.optima = null;<a name="line.84"></a>
88 <FONT color="green">085</FONT> setMaximalIterationCount(Integer.MAX_VALUE);<a name="line.85"></a>
89 <FONT color="green">086</FONT> setMaxEvaluations(Integer.MAX_VALUE);<a name="line.86"></a>
90 <FONT color="green">087</FONT> }<a name="line.87"></a>
91 <FONT color="green">088</FONT> <a name="line.88"></a>
92 <FONT color="green">089</FONT> /** {@inheritDoc} */<a name="line.89"></a>
93 <FONT color="green">090</FONT> public double getFunctionValue() {<a name="line.90"></a>
94 <FONT color="green">091</FONT> return optimizer.getFunctionValue();<a name="line.91"></a>
95 <FONT color="green">092</FONT> }<a name="line.92"></a>
96 <FONT color="green">093</FONT> <a name="line.93"></a>
97 <FONT color="green">094</FONT> /** {@inheritDoc} */<a name="line.94"></a>
98 <FONT color="green">095</FONT> public double getResult() {<a name="line.95"></a>
99 <FONT color="green">096</FONT> return optimizer.getResult();<a name="line.96"></a>
100 <FONT color="green">097</FONT> }<a name="line.97"></a>
101 <FONT color="green">098</FONT> <a name="line.98"></a>
102 <FONT color="green">099</FONT> /** {@inheritDoc} */<a name="line.99"></a>
103 <FONT color="green">100</FONT> public double getAbsoluteAccuracy() {<a name="line.100"></a>
104 <FONT color="green">101</FONT> return optimizer.getAbsoluteAccuracy();<a name="line.101"></a>
105 <FONT color="green">102</FONT> }<a name="line.102"></a>
106 <FONT color="green">103</FONT> <a name="line.103"></a>
107 <FONT color="green">104</FONT> /** {@inheritDoc} */<a name="line.104"></a>
108 <FONT color="green">105</FONT> public int getIterationCount() {<a name="line.105"></a>
109 <FONT color="green">106</FONT> return totalIterations;<a name="line.106"></a>
110 <FONT color="green">107</FONT> }<a name="line.107"></a>
111 <FONT color="green">108</FONT> <a name="line.108"></a>
112 <FONT color="green">109</FONT> /** {@inheritDoc} */<a name="line.109"></a>
113 <FONT color="green">110</FONT> public int getMaximalIterationCount() {<a name="line.110"></a>
114 <FONT color="green">111</FONT> return maxIterations;<a name="line.111"></a>
115 <FONT color="green">112</FONT> }<a name="line.112"></a>
116 <FONT color="green">113</FONT> <a name="line.113"></a>
117 <FONT color="green">114</FONT> /** {@inheritDoc} */<a name="line.114"></a>
118 <FONT color="green">115</FONT> public int getMaxEvaluations() {<a name="line.115"></a>
119 <FONT color="green">116</FONT> return maxEvaluations;<a name="line.116"></a>
120 <FONT color="green">117</FONT> }<a name="line.117"></a>
121 <FONT color="green">118</FONT> <a name="line.118"></a>
122 <FONT color="green">119</FONT> /** {@inheritDoc} */<a name="line.119"></a>
123 <FONT color="green">120</FONT> public int getEvaluations() {<a name="line.120"></a>
124 <FONT color="green">121</FONT> return totalEvaluations;<a name="line.121"></a>
125 <FONT color="green">122</FONT> }<a name="line.122"></a>
126 <FONT color="green">123</FONT> <a name="line.123"></a>
127 <FONT color="green">124</FONT> /** {@inheritDoc} */<a name="line.124"></a>
128 <FONT color="green">125</FONT> public double getRelativeAccuracy() {<a name="line.125"></a>
129 <FONT color="green">126</FONT> return optimizer.getRelativeAccuracy();<a name="line.126"></a>
130 <FONT color="green">127</FONT> }<a name="line.127"></a>
131 <FONT color="green">128</FONT> <a name="line.128"></a>
132 <FONT color="green">129</FONT> /** {@inheritDoc} */<a name="line.129"></a>
133 <FONT color="green">130</FONT> public void resetAbsoluteAccuracy() {<a name="line.130"></a>
134 <FONT color="green">131</FONT> optimizer.resetAbsoluteAccuracy();<a name="line.131"></a>
135 <FONT color="green">132</FONT> }<a name="line.132"></a>
136 <FONT color="green">133</FONT> <a name="line.133"></a>
137 <FONT color="green">134</FONT> /** {@inheritDoc} */<a name="line.134"></a>
138 <FONT color="green">135</FONT> public void resetMaximalIterationCount() {<a name="line.135"></a>
139 <FONT color="green">136</FONT> optimizer.resetMaximalIterationCount();<a name="line.136"></a>
140 <FONT color="green">137</FONT> }<a name="line.137"></a>
141 <FONT color="green">138</FONT> <a name="line.138"></a>
142 <FONT color="green">139</FONT> /** {@inheritDoc} */<a name="line.139"></a>
143 <FONT color="green">140</FONT> public void resetRelativeAccuracy() {<a name="line.140"></a>
144 <FONT color="green">141</FONT> optimizer.resetRelativeAccuracy();<a name="line.141"></a>
145 <FONT color="green">142</FONT> }<a name="line.142"></a>
146 <FONT color="green">143</FONT> <a name="line.143"></a>
147 <FONT color="green">144</FONT> /** {@inheritDoc} */<a name="line.144"></a>
148 <FONT color="green">145</FONT> public void setAbsoluteAccuracy(double accuracy) {<a name="line.145"></a>
149 <FONT color="green">146</FONT> optimizer.setAbsoluteAccuracy(accuracy);<a name="line.146"></a>
150 <FONT color="green">147</FONT> }<a name="line.147"></a>
151 <FONT color="green">148</FONT> <a name="line.148"></a>
152 <FONT color="green">149</FONT> /** {@inheritDoc} */<a name="line.149"></a>
153 <FONT color="green">150</FONT> public void setMaximalIterationCount(int count) {<a name="line.150"></a>
154 <FONT color="green">151</FONT> this.maxIterations = count;<a name="line.151"></a>
155 <FONT color="green">152</FONT> }<a name="line.152"></a>
156 <FONT color="green">153</FONT> <a name="line.153"></a>
157 <FONT color="green">154</FONT> /** {@inheritDoc} */<a name="line.154"></a>
158 <FONT color="green">155</FONT> public void setMaxEvaluations(int maxEvaluations) {<a name="line.155"></a>
159 <FONT color="green">156</FONT> this.maxEvaluations = maxEvaluations;<a name="line.156"></a>
160 <FONT color="green">157</FONT> }<a name="line.157"></a>
161 <FONT color="green">158</FONT> <a name="line.158"></a>
162 <FONT color="green">159</FONT> /** {@inheritDoc} */<a name="line.159"></a>
163 <FONT color="green">160</FONT> public void setRelativeAccuracy(double accuracy) {<a name="line.160"></a>
164 <FONT color="green">161</FONT> optimizer.setRelativeAccuracy(accuracy);<a name="line.161"></a>
165 <FONT color="green">162</FONT> }<a name="line.162"></a>
166 <FONT color="green">163</FONT> <a name="line.163"></a>
167 <FONT color="green">164</FONT> /** Get all the optima found during the last call to {@link<a name="line.164"></a>
168 <FONT color="green">165</FONT> * #optimize(UnivariateRealFunction, GoalType, double, double) optimize}.<a name="line.165"></a>
169 <FONT color="green">166</FONT> * &lt;p&gt;The optimizer stores all the optima found during a set of<a name="line.166"></a>
170 <FONT color="green">167</FONT> * restarts. The {@link #optimize(UnivariateRealFunction, GoalType,<a name="line.167"></a>
171 <FONT color="green">168</FONT> * double, double) optimize} method returns the best point only. This<a name="line.168"></a>
172 <FONT color="green">169</FONT> * method returns all the points found at the end of each starts,<a name="line.169"></a>
173 <FONT color="green">170</FONT> * including the best one already returned by the {@link<a name="line.170"></a>
174 <FONT color="green">171</FONT> * #optimize(UnivariateRealFunction, GoalType, double, double) optimize}<a name="line.171"></a>
175 <FONT color="green">172</FONT> * method.<a name="line.172"></a>
176 <FONT color="green">173</FONT> * &lt;/p&gt;<a name="line.173"></a>
177 <FONT color="green">174</FONT> * &lt;p&gt;<a name="line.174"></a>
178 <FONT color="green">175</FONT> * The returned array as one element for each start as specified<a name="line.175"></a>
179 <FONT color="green">176</FONT> * in the constructor. It is ordered with the results from the<a name="line.176"></a>
180 <FONT color="green">177</FONT> * runs that did converge first, sorted from best to worst<a name="line.177"></a>
181 <FONT color="green">178</FONT> * objective value (i.e in ascending order if minimizing and in<a name="line.178"></a>
182 <FONT color="green">179</FONT> * descending order if maximizing), followed by Double.NaN elements<a name="line.179"></a>
183 <FONT color="green">180</FONT> * corresponding to the runs that did not converge. This means all<a name="line.180"></a>
184 <FONT color="green">181</FONT> * elements will be NaN if the {@link #optimize(UnivariateRealFunction,<a name="line.181"></a>
185 <FONT color="green">182</FONT> * GoalType, double, double) optimize} method did throw a {@link<a name="line.182"></a>
186 <FONT color="green">183</FONT> * ConvergenceException ConvergenceException}). This also means that<a name="line.183"></a>
187 <FONT color="green">184</FONT> * if the first element is not NaN, it is the best point found across<a name="line.184"></a>
188 <FONT color="green">185</FONT> * all starts.&lt;/p&gt;<a name="line.185"></a>
189 <FONT color="green">186</FONT> * @return array containing the optima<a name="line.186"></a>
190 <FONT color="green">187</FONT> * @exception IllegalStateException if {@link #optimize(UnivariateRealFunction,<a name="line.187"></a>
191 <FONT color="green">188</FONT> * GoalType, double, double) optimize} has not been called<a name="line.188"></a>
192 <FONT color="green">189</FONT> * @see #getOptimaValues()<a name="line.189"></a>
193 <FONT color="green">190</FONT> */<a name="line.190"></a>
194 <FONT color="green">191</FONT> public double[] getOptima() throws IllegalStateException {<a name="line.191"></a>
195 <FONT color="green">192</FONT> if (optima == null) {<a name="line.192"></a>
196 <FONT color="green">193</FONT> throw MathRuntimeException.createIllegalStateException("no optimum computed yet");<a name="line.193"></a>
197 <FONT color="green">194</FONT> }<a name="line.194"></a>
198 <FONT color="green">195</FONT> return optima.clone();<a name="line.195"></a>
199 <FONT color="green">196</FONT> }<a name="line.196"></a>
200 <FONT color="green">197</FONT> <a name="line.197"></a>
201 <FONT color="green">198</FONT> /** Get all the function values at optima found during the last call to {@link<a name="line.198"></a>
202 <FONT color="green">199</FONT> * #optimize(UnivariateRealFunction, GoalType, double, double) optimize}.<a name="line.199"></a>
203 <FONT color="green">200</FONT> * &lt;p&gt;<a name="line.200"></a>
204 <FONT color="green">201</FONT> * The returned array as one element for each start as specified<a name="line.201"></a>
205 <FONT color="green">202</FONT> * in the constructor. It is ordered with the results from the<a name="line.202"></a>
206 <FONT color="green">203</FONT> * runs that did converge first, sorted from best to worst<a name="line.203"></a>
207 <FONT color="green">204</FONT> * objective value (i.e in ascending order if minimizing and in<a name="line.204"></a>
208 <FONT color="green">205</FONT> * descending order if maximizing), followed by Double.NaN elements<a name="line.205"></a>
209 <FONT color="green">206</FONT> * corresponding to the runs that did not converge. This means all<a name="line.206"></a>
210 <FONT color="green">207</FONT> * elements will be NaN if the {@link #optimize(UnivariateRealFunction,<a name="line.207"></a>
211 <FONT color="green">208</FONT> * GoalType, double, double) optimize} method did throw a {@link<a name="line.208"></a>
212 <FONT color="green">209</FONT> * ConvergenceException ConvergenceException}). This also means that<a name="line.209"></a>
213 <FONT color="green">210</FONT> * if the first element is not NaN, it is the best point found across<a name="line.210"></a>
214 <FONT color="green">211</FONT> * all starts.&lt;/p&gt;<a name="line.211"></a>
215 <FONT color="green">212</FONT> * @return array containing the optima<a name="line.212"></a>
216 <FONT color="green">213</FONT> * @exception IllegalStateException if {@link #optimize(UnivariateRealFunction,<a name="line.213"></a>
217 <FONT color="green">214</FONT> * GoalType, double, double) optimize} has not been called<a name="line.214"></a>
218 <FONT color="green">215</FONT> * @see #getOptima()<a name="line.215"></a>
219 <FONT color="green">216</FONT> */<a name="line.216"></a>
220 <FONT color="green">217</FONT> public double[] getOptimaValues() throws IllegalStateException {<a name="line.217"></a>
221 <FONT color="green">218</FONT> if (optimaValues == null) {<a name="line.218"></a>
222 <FONT color="green">219</FONT> throw MathRuntimeException.createIllegalStateException("no optimum computed yet");<a name="line.219"></a>
223 <FONT color="green">220</FONT> }<a name="line.220"></a>
224 <FONT color="green">221</FONT> return optimaValues.clone();<a name="line.221"></a>
225 <FONT color="green">222</FONT> }<a name="line.222"></a>
226 <FONT color="green">223</FONT> <a name="line.223"></a>
227 <FONT color="green">224</FONT> /** {@inheritDoc} */<a name="line.224"></a>
228 <FONT color="green">225</FONT> public double optimize(final UnivariateRealFunction f, final GoalType goalType,<a name="line.225"></a>
229 <FONT color="green">226</FONT> final double min, final double max)<a name="line.226"></a>
230 <FONT color="green">227</FONT> throws ConvergenceException,<a name="line.227"></a>
231 <FONT color="green">228</FONT> FunctionEvaluationException {<a name="line.228"></a>
232 <FONT color="green">229</FONT> <a name="line.229"></a>
233 <FONT color="green">230</FONT> optima = new double[starts];<a name="line.230"></a>
234 <FONT color="green">231</FONT> optimaValues = new double[starts];<a name="line.231"></a>
235 <FONT color="green">232</FONT> totalIterations = 0;<a name="line.232"></a>
236 <FONT color="green">233</FONT> totalEvaluations = 0;<a name="line.233"></a>
237 <FONT color="green">234</FONT> <a name="line.234"></a>
238 <FONT color="green">235</FONT> // multi-start loop<a name="line.235"></a>
239 <FONT color="green">236</FONT> for (int i = 0; i &lt; starts; ++i) {<a name="line.236"></a>
240 <FONT color="green">237</FONT> <a name="line.237"></a>
241 <FONT color="green">238</FONT> try {<a name="line.238"></a>
242 <FONT color="green">239</FONT> optimizer.setMaximalIterationCount(maxIterations - totalIterations);<a name="line.239"></a>
243 <FONT color="green">240</FONT> optimizer.setMaxEvaluations(maxEvaluations - totalEvaluations);<a name="line.240"></a>
244 <FONT color="green">241</FONT> final double bound1 = (i == 0) ? min : min + generator.nextDouble() * (max - min);<a name="line.241"></a>
245 <FONT color="green">242</FONT> final double bound2 = (i == 0) ? max : min + generator.nextDouble() * (max - min);<a name="line.242"></a>
246 <FONT color="green">243</FONT> optima[i] = optimizer.optimize(f, goalType,<a name="line.243"></a>
247 <FONT color="green">244</FONT> Math.min(bound1, bound2),<a name="line.244"></a>
248 <FONT color="green">245</FONT> Math.max(bound1, bound2));<a name="line.245"></a>
249 <FONT color="green">246</FONT> optimaValues[i] = optimizer.getFunctionValue();<a name="line.246"></a>
250 <FONT color="green">247</FONT> } catch (FunctionEvaluationException fee) {<a name="line.247"></a>
251 <FONT color="green">248</FONT> optima[i] = Double.NaN;<a name="line.248"></a>
252 <FONT color="green">249</FONT> optimaValues[i] = Double.NaN;<a name="line.249"></a>
253 <FONT color="green">250</FONT> } catch (ConvergenceException ce) {<a name="line.250"></a>
254 <FONT color="green">251</FONT> optima[i] = Double.NaN;<a name="line.251"></a>
255 <FONT color="green">252</FONT> optimaValues[i] = Double.NaN;<a name="line.252"></a>
256 <FONT color="green">253</FONT> }<a name="line.253"></a>
257 <FONT color="green">254</FONT> <a name="line.254"></a>
258 <FONT color="green">255</FONT> totalIterations += optimizer.getIterationCount();<a name="line.255"></a>
259 <FONT color="green">256</FONT> totalEvaluations += optimizer.getEvaluations();<a name="line.256"></a>
260 <FONT color="green">257</FONT> <a name="line.257"></a>
261 <FONT color="green">258</FONT> }<a name="line.258"></a>
262 <FONT color="green">259</FONT> <a name="line.259"></a>
263 <FONT color="green">260</FONT> // sort the optima from best to worst, followed by NaN elements<a name="line.260"></a>
264 <FONT color="green">261</FONT> int lastNaN = optima.length;<a name="line.261"></a>
265 <FONT color="green">262</FONT> for (int i = 0; i &lt; lastNaN; ++i) {<a name="line.262"></a>
266 <FONT color="green">263</FONT> if (Double.isNaN(optima[i])) {<a name="line.263"></a>
267 <FONT color="green">264</FONT> optima[i] = optima[--lastNaN];<a name="line.264"></a>
268 <FONT color="green">265</FONT> optima[lastNaN + 1] = Double.NaN;<a name="line.265"></a>
269 <FONT color="green">266</FONT> optimaValues[i] = optimaValues[--lastNaN];<a name="line.266"></a>
270 <FONT color="green">267</FONT> optimaValues[lastNaN + 1] = Double.NaN;<a name="line.267"></a>
271 <FONT color="green">268</FONT> }<a name="line.268"></a>
272 <FONT color="green">269</FONT> }<a name="line.269"></a>
273 <FONT color="green">270</FONT> <a name="line.270"></a>
274 <FONT color="green">271</FONT> double currX = optima[0];<a name="line.271"></a>
275 <FONT color="green">272</FONT> double currY = optimaValues[0];<a name="line.272"></a>
276 <FONT color="green">273</FONT> for (int j = 1; j &lt; lastNaN; ++j) {<a name="line.273"></a>
277 <FONT color="green">274</FONT> final double prevY = currY;<a name="line.274"></a>
278 <FONT color="green">275</FONT> currX = optima[j];<a name="line.275"></a>
279 <FONT color="green">276</FONT> currY = optimaValues[j];<a name="line.276"></a>
280 <FONT color="green">277</FONT> if ((goalType == GoalType.MAXIMIZE) ^ (currY &lt; prevY)) {<a name="line.277"></a>
281 <FONT color="green">278</FONT> // the current element should be inserted closer to the beginning<a name="line.278"></a>
282 <FONT color="green">279</FONT> int i = j - 1;<a name="line.279"></a>
283 <FONT color="green">280</FONT> double mIX = optima[i];<a name="line.280"></a>
284 <FONT color="green">281</FONT> double mIY = optimaValues[i];<a name="line.281"></a>
285 <FONT color="green">282</FONT> while ((i &gt;= 0) &amp;&amp; ((goalType == GoalType.MAXIMIZE) ^ (currY &lt; mIY))) {<a name="line.282"></a>
286 <FONT color="green">283</FONT> optima[i + 1] = mIX;<a name="line.283"></a>
287 <FONT color="green">284</FONT> optimaValues[i + 1] = mIY;<a name="line.284"></a>
288 <FONT color="green">285</FONT> if (i-- != 0) {<a name="line.285"></a>
289 <FONT color="green">286</FONT> mIX = optima[i];<a name="line.286"></a>
290 <FONT color="green">287</FONT> mIY = optimaValues[i];<a name="line.287"></a>
291 <FONT color="green">288</FONT> } else {<a name="line.288"></a>
292 <FONT color="green">289</FONT> mIX = Double.NaN;<a name="line.289"></a>
293 <FONT color="green">290</FONT> mIY = Double.NaN;<a name="line.290"></a>
294 <FONT color="green">291</FONT> }<a name="line.291"></a>
295 <FONT color="green">292</FONT> }<a name="line.292"></a>
296 <FONT color="green">293</FONT> optima[i + 1] = currX;<a name="line.293"></a>
297 <FONT color="green">294</FONT> optimaValues[i + 1] = currY;<a name="line.294"></a>
298 <FONT color="green">295</FONT> currX = optima[j];<a name="line.295"></a>
299 <FONT color="green">296</FONT> currY = optimaValues[j];<a name="line.296"></a>
300 <FONT color="green">297</FONT> }<a name="line.297"></a>
301 <FONT color="green">298</FONT> }<a name="line.298"></a>
302 <FONT color="green">299</FONT> <a name="line.299"></a>
303 <FONT color="green">300</FONT> if (Double.isNaN(optima[0])) {<a name="line.300"></a>
304 <FONT color="green">301</FONT> throw new OptimizationException(<a name="line.301"></a>
305 <FONT color="green">302</FONT> "none of the {0} start points lead to convergence",<a name="line.302"></a>
306 <FONT color="green">303</FONT> starts);<a name="line.303"></a>
307 <FONT color="green">304</FONT> }<a name="line.304"></a>
308 <FONT color="green">305</FONT> <a name="line.305"></a>
309 <FONT color="green">306</FONT> // return the found point given the best objective function value<a name="line.306"></a>
310 <FONT color="green">307</FONT> return optima[0];<a name="line.307"></a>
311 <FONT color="green">308</FONT> <a name="line.308"></a>
312 <FONT color="green">309</FONT> }<a name="line.309"></a>
313 <FONT color="green">310</FONT> <a name="line.310"></a>
314 <FONT color="green">311</FONT> /** {@inheritDoc} */<a name="line.311"></a>
315 <FONT color="green">312</FONT> public double optimize(final UnivariateRealFunction f, final GoalType goalType,<a name="line.312"></a>
316 <FONT color="green">313</FONT> final double min, final double max, final double startValue)<a name="line.313"></a>
317 <FONT color="green">314</FONT> throws ConvergenceException, FunctionEvaluationException {<a name="line.314"></a>
318 <FONT color="green">315</FONT> return optimize(f, goalType, min, max);<a name="line.315"></a>
319 <FONT color="green">316</FONT> }<a name="line.316"></a>
320 <FONT color="green">317</FONT> <a name="line.317"></a>
321 <FONT color="green">318</FONT> }<a name="line.318"></a>
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382 </PRE>
383 </BODY>
384 </HTML>