| Modifier and Type | Method and Description |
|---|---|
NelderMeadMinimizer.Solution |
NelderMeadMinimizer.solve(C2OptimProblem problem) |
IterativeC2Maximizer.Solution |
IterativeC2Maximizer.solve(C2OptimProblem problem) |
| Modifier and Type | Method and Description |
|---|---|
IterativeSolution<Vector> |
ZangwillMinimizer.solve(C2OptimProblem problem) |
IterativeSolution<Vector> |
FletcherReevesMinimizer.solve(C2OptimProblem problem) |
IterativeSolution<Vector> |
ConjugateGradientMinimizer.solve(C2OptimProblem problem) |
IterativeSolution<Vector> |
PowellMinimizer.solve(C2OptimProblem problem) |
| Constructor and Description |
|---|
PowellImpl(C2OptimProblem problem) |
ZangwillImpl(C2OptimProblem problem) |
| Modifier and Type | Method and Description |
|---|---|
LineSearch.Solution |
FletcherLineSearch.solve(C2OptimProblem problem) |
| Modifier and Type | Method and Description |
|---|---|
IterativeSolution<Vector> |
BFGSMinimizer.solve(C2OptimProblem problem) |
IterativeSolution<Vector> |
HuangMinimizer.solve(C2OptimProblem problem) |
| Constructor and Description |
|---|
BFGSImpl(C2OptimProblem problem) |
HuangImpl(C2OptimProblem problem) |
| Modifier and Type | Field and Description |
|---|---|
protected C2OptimProblem |
SteepestDescentMinimizer.SteepestDescentImpl.problem |
| Modifier and Type | Method and Description |
|---|---|
IterativeSolution<Vector> |
NewtonRaphsonMinimizer.solve(C2OptimProblem problem) |
IterativeSolution<Vector> |
GaussNewtonMinimizer.MySteepestDescent.solve(C2OptimProblem problem) |
IterativeSolution<Vector> |
FirstOrderMinimizer.solve(C2OptimProblem problem) |
abstract IterativeSolution<Vector> |
SteepestDescentMinimizer.solve(C2OptimProblem problem)
Solve a minimization problem with a C2 objective function.
|
| Constructor and Description |
|---|
GaussNewtonImpl(C2OptimProblem problem,
RntoMatrix J) |
NewtonRaphsonImpl(C2OptimProblem problem) |
SteepestDescentImpl(C2OptimProblem problem) |
| Modifier and Type | Class and Description |
|---|---|
class |
C2OptimProblemImpl
This is an optimization problem of a real valued function: \(\max_x f(x)\).
|
| Modifier and Type | Method and Description |
|---|---|
GridSearchMinimizer.Solution |
GridSearchMinimizer.solve(C2OptimProblem problem) |
| Modifier and Type | Method and Description |
|---|---|
GoldenMinimizer.Solution |
GoldenMinimizer.solve(C2OptimProblem problem) |
BrentMinimizer.Solution |
BrentMinimizer.solve(C2OptimProblem problem) |
FibonaccMinimizer.Solution |
FibonaccMinimizer.solve(C2OptimProblem problem) |
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.