public class org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer extends org.apache.commons.math.optim.nonlinear.scalar.GradientMultivariateOptimizer
{
private final org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula updateFormula;
private final org.apache.commons.math.optim.nonlinear.scalar.gradient.Preconditioner preconditioner;
private final org.apache.commons.math.analysis.solvers.UnivariateSolver solver;
private double initialStep;
public void <init>(org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula, org.apache.commons.math.optim.ConvergenceChecker)
{
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula v;
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$IdentityPreconditioner v;
org.apache.commons.math.optim.ConvergenceChecker v;
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer v;
org.apache.commons.math.analysis.solvers.BrentSolver v;
v := @this: org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer;
v := @parameter: org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula;
v := @parameter: org.apache.commons.math.optim.ConvergenceChecker;
v = new org.apache.commons.math.analysis.solvers.BrentSolver;
specialinvoke v.<org.apache.commons.math.analysis.solvers.BrentSolver: void <init>()>();
v = new org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$IdentityPreconditioner;
specialinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$IdentityPreconditioner: void <init>()>();
specialinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: void <init>(org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula,org.apache.commons.math.optim.ConvergenceChecker,org.apache.commons.math.analysis.solvers.UnivariateSolver,org.apache.commons.math.optim.nonlinear.scalar.gradient.Preconditioner)>(v, v, v, v);
return;
}
public void <init>(org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula, org.apache.commons.math.optim.ConvergenceChecker, org.apache.commons.math.analysis.solvers.UnivariateSolver)
{
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula v;
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$IdentityPreconditioner v;
org.apache.commons.math.analysis.solvers.UnivariateSolver v;
org.apache.commons.math.optim.ConvergenceChecker v;
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer v;
v := @this: org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer;
v := @parameter: org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula;
v := @parameter: org.apache.commons.math.optim.ConvergenceChecker;
v := @parameter: org.apache.commons.math.analysis.solvers.UnivariateSolver;
v = new org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$IdentityPreconditioner;
specialinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$IdentityPreconditioner: void <init>()>();
specialinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: void <init>(org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula,org.apache.commons.math.optim.ConvergenceChecker,org.apache.commons.math.analysis.solvers.UnivariateSolver,org.apache.commons.math.optim.nonlinear.scalar.gradient.Preconditioner)>(v, v, v, v);
return;
}
public void <init>(org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula, org.apache.commons.math.optim.ConvergenceChecker, org.apache.commons.math.analysis.solvers.UnivariateSolver, org.apache.commons.math.optim.nonlinear.scalar.gradient.Preconditioner)
{
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula v;
org.apache.commons.math.analysis.solvers.UnivariateSolver v;
org.apache.commons.math.optim.ConvergenceChecker v;
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer v;
org.apache.commons.math.optim.nonlinear.scalar.gradient.Preconditioner v;
v := @this: org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer;
v := @parameter: org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula;
v := @parameter: org.apache.commons.math.optim.ConvergenceChecker;
v := @parameter: org.apache.commons.math.analysis.solvers.UnivariateSolver;
v := @parameter: org.apache.commons.math.optim.nonlinear.scalar.gradient.Preconditioner;
specialinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.GradientMultivariateOptimizer: void <init>(org.apache.commons.math.optim.ConvergenceChecker)>(v);
v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: double initialStep> = 1.0;
v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula updateFormula> = v;
v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: org.apache.commons.math.analysis.solvers.UnivariateSolver solver> = v;
v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: org.apache.commons.math.optim.nonlinear.scalar.gradient.Preconditioner preconditioner> = v;
v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: double initialStep> = 1.0;
return;
}
public transient org.apache.commons.math.optim.PointValuePair optimize(org.apache.commons.math.optim.OptimizationData[]) throws org.apache.commons.math.exception.TooManyEvaluationsException
{
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer v;
org.apache.commons.math.optim.PointValuePair v;
org.apache.commons.math.optim.OptimizationData[] v;
v := @this: org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer;
v := @parameter: org.apache.commons.math.optim.OptimizationData[];
v = specialinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.GradientMultivariateOptimizer: org.apache.commons.math.optim.PointValuePair optimize(org.apache.commons.math.optim.OptimizationData[])>(v);
return v;
}
protected org.apache.commons.math.optim.PointValuePair doOptimize()
{
byte v;
org.apache.commons.math.optim.nonlinear.scalar.GoalType v, v, v;
org.apache.commons.math.optim.nonlinear.scalar.gradient.Preconditioner v, v;
org.apache.commons.math.optim.PointValuePair v, v, v;
double[] v, v, v, v, v;
org.apache.commons.math.optim.ConvergenceChecker v;
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer v;
org.apache.commons.math.exception.MathInternalError v;
int[] v;
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$LineSearchFunction v;
boolean v;
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula v;
org.apache.commons.math.analysis.solvers.UnivariateSolver v, v;
int v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v;
double v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v;
java.lang.Object v;
v := @this: org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: org.apache.commons.math.optim.ConvergenceChecker getConvergenceChecker()>();
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: double[] getStartPoint()>();
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: org.apache.commons.math.optim.nonlinear.scalar.GoalType getGoalType()>();
v = lengthof v;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: double[] computeObjectiveGradient(double[])>(v);
v = <org.apache.commons.math.optim.nonlinear.scalar.GoalType: org.apache.commons.math.optim.nonlinear.scalar.GoalType MINIMIZE>;
if v != v goto label;
v = 0;
label:
if v >= v goto label;
v = v[v];
v = neg v;
v[v] = v;
v = v + 1;
goto label;
label:
v = v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: org.apache.commons.math.optim.nonlinear.scalar.gradient.Preconditioner preconditioner>;
v = interfaceinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.Preconditioner: double[] precondition(double[],double[])>(v, v);
v = virtualinvoke v.<java.lang.Object: java.lang.Object clone()>();
v = 0.0;
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v[v];
v = v * v;
v = v + v;
v = v + 1;
goto label;
label:
v = null;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: int getMaxEvaluations()>();
label:
virtualinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: void incrementIterationCount()>();
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: double computeObjectiveValue(double[])>(v);
v = v;
v = new org.apache.commons.math.optim.PointValuePair;
specialinvoke v.<org.apache.commons.math.optim.PointValuePair: void <init>(double[],double)>(v, v);
v = v;
if v == null goto label;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: int getIterations()>();
v = interfaceinvoke v.<org.apache.commons.math.optim.ConvergenceChecker: boolean converged(int,java.lang.Object,java.lang.Object)>(v, v, v);
if v == 0 goto label;
return v;
label:
v = new org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$LineSearchFunction;
specialinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$LineSearchFunction: void <init>(org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer,double[],double[])>(v, v, v);
v = v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: double initialStep>;
v = specialinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: double findUpperBound(org.apache.commons.math.analysis.UnivariateFunction,double,double)>(v, 0.0, v);
v = v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: org.apache.commons.math.analysis.solvers.UnivariateSolver solver>;
v = interfaceinvoke v.<org.apache.commons.math.analysis.solvers.UnivariateSolver: double solve(int,org.apache.commons.math.analysis.UnivariateFunction,double,double,double)>(v, v, 0.0, v, 1.0E-15);
v = v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: org.apache.commons.math.analysis.solvers.UnivariateSolver solver>;
v = interfaceinvoke v.<org.apache.commons.math.analysis.solvers.UnivariateSolver: int getEvaluations()>();
v = v - v;
v = 0;
label:
v = lengthof v;
if v >= v goto label;
v = v[v];
v = v[v];
v = v * v;
v = v + v;
v[v] = v;
v = v + 1;
goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: double[] computeObjectiveGradient(double[])>(v);
v = <org.apache.commons.math.optim.nonlinear.scalar.GoalType: org.apache.commons.math.optim.nonlinear.scalar.GoalType MINIMIZE>;
if v != v goto label;
v = 0;
label:
if v >= v goto label;
v = v[v];
v = neg v;
v[v] = v;
v = v + 1;
goto label;
label:
v = v;
v = v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: org.apache.commons.math.optim.nonlinear.scalar.gradient.Preconditioner preconditioner>;
v = interfaceinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.Preconditioner: double[] precondition(double[],double[])>(v, v);
v = 0.0;
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v[v];
v = v * v;
v = v + v;
v = v + 1;
goto label;
label:
v = <org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$1: int[] $SwitchMap$org$apache$commons$math3$optim$nonlinear$scalar$gradient$NonLinearConjugateGradientOptimizer$Formula>;
v = v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula updateFormula>;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$Formula: int ordinal()>();
v = v[v];
lookupswitch(v)
{
case 1: goto label;
case 2: goto label;
default: goto label;
};
label:
v = v / v;
goto label;
label:
v = 0.0;
v = 0;
label:
v = lengthof v;
if v >= v goto label;
v = v[v];
v = v[v];
v = v * v;
v = v + v;
v = v + 1;
goto label;
label:
v = v - v;
v = v / v;
goto label;
label:
v = new org.apache.commons.math.exception.MathInternalError;
specialinvoke v.<org.apache.commons.math.exception.MathInternalError: void <init>()>();
throw v;
label:
v = v;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: int getIterations()>();
v = v % v;
if v == 0 goto label;
v = v cmpg 0.0;
if v >= 0 goto label;
label:
virtualinvoke v.<java.lang.Object: java.lang.Object clone()>();
goto label;
label:
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v[v];
v = v * v;
v = v + v;
v[v] = v;
v = v + 1;
goto label;
}
protected transient void parseOptimizationData(org.apache.commons.math.optim.OptimizationData[])
{
org.apache.commons.math.optim.OptimizationData v;
org.apache.commons.math.optim.OptimizationData[] v;
int v, v;
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer v;
boolean v;
double v;
v := @this: org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer;
v := @parameter: org.apache.commons.math.optim.OptimizationData[];
specialinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.GradientMultivariateOptimizer: void parseOptimizationData(org.apache.commons.math.optim.OptimizationData[])>(v);
v = lengthof v;
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v instanceof org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$BracketingStep;
if v == 0 goto label;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer$BracketingStep: double getBracketingStep()>();
v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: double initialStep> = v;
goto label;
label:
v = v + 1;
goto label;
label:
specialinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: void checkParameters()>();
return;
}
private double findUpperBound(org.apache.commons.math.analysis.UnivariateFunction, double, double)
{
java.lang.Object[] v;
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer v;
byte v, v;
org.apache.commons.math.exception.MathIllegalStateException v;
double v, v, v, v, v, v, v, v, v;
org.apache.commons.math.exception.util.LocalizedFormats v;
org.apache.commons.math.analysis.UnivariateFunction v;
v := @this: org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer;
v := @parameter: org.apache.commons.math.analysis.UnivariateFunction;
v := @parameter: double;
v := @parameter: double;
v = interfaceinvoke v.<org.apache.commons.math.analysis.UnivariateFunction: double value(double)>(v);
v = v;
label:
v = v cmpg 1.7976931348623157E308;
if v >= 0 goto label;
v = v + v;
v = interfaceinvoke v.<org.apache.commons.math.analysis.UnivariateFunction: double value(double)>(v);
v = v * v;
v = v cmpg 0.0;
if v > 0 goto label;
return v;
label:
v = v / v;
v = staticinvoke <org.apache.commons.math.util.FastMath: double max(double,double)>(2.0, v);
v = v * v;
goto label;
label:
v = new org.apache.commons.math.exception.MathIllegalStateException;
v = <org.apache.commons.math.exception.util.LocalizedFormats: org.apache.commons.math.exception.util.LocalizedFormats UNABLE_TO_BRACKET_OPTIMUM_IN_LINE_SEARCH>;
v = newarray (java.lang.Object)[0];
specialinvoke v.<org.apache.commons.math.exception.MathIllegalStateException: void <init>(org.apache.commons.math.exception.util.Localizable,java.lang.Object[])>(v, v);
throw v;
}
private void checkParameters()
{
java.lang.Object[] v;
org.apache.commons.math.exception.util.LocalizedFormats v;
double[] v, v;
org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer v;
org.apache.commons.math.exception.MathUnsupportedOperationException v;
v := @this: org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: double[] getLowerBound()>();
if v != null goto label;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.scalar.gradient.NonLinearConjugateGradientOptimizer: double[] getUpperBound()>();
if v == null goto label;
label:
v = new org.apache.commons.math.exception.MathUnsupportedOperationException;
v = <org.apache.commons.math.exception.util.LocalizedFormats: org.apache.commons.math.exception.util.LocalizedFormats CONSTRAINT>;
v = newarray (java.lang.Object)[0];
specialinvoke v.<org.apache.commons.math.exception.MathUnsupportedOperationException: void <init>(org.apache.commons.math.exception.util.Localizable,java.lang.Object[])>(v, v);
throw v;
label:
return;
}
}