use argmin::core::observers::{ObserverMode, SlogLogger};
use argmin::core::{CostFunction, Error, Executor, Gradient, Hessian};
use argmin::solver::quasinewton::SR1TrustRegion;
#[allow(unused_imports)]
use argmin::solver::trustregion::{CauchyPoint, Dogleg, Steihaug, TrustRegion};
use argmin_testfunctions::rosenbrock;
use finitediff::FiniteDiff;
use ndarray::{array, Array1, Array2};
struct Rosenbrock {
a: f64,
b: f64,
}
impl CostFunction for Rosenbrock {
type Param = Array1<f64>;
type Output = f64;
fn cost(&self, p: &Self::Param) -> Result<Self::Output, Error> {
Ok(rosenbrock(&p.to_vec(), self.a, self.b))
}
}
impl Gradient for Rosenbrock {
type Param = Array1<f64>;
type Gradient = Array1<f64>;
fn gradient(&self, p: &Self::Param) -> Result<Self::Gradient, Error> {
Ok((*p).forward_diff(&|x| rosenbrock(&x.to_vec(), self.a, self.b)))
}
}
impl Hessian for Rosenbrock {
type Param = Array1<f64>;
type Hessian = Array2<f64>;
fn hessian(&self, p: &Self::Param) -> Result<Self::Hessian, Error> {
Ok((*p).forward_hessian(&|x| self.gradient(x).unwrap()))
}
}
fn run() -> Result<(), Error> {
let cost = Rosenbrock { a: 1.0, b: 100.0 };
let init_param: Array1<f64> = array![-1.2, 1.0];
let init_hessian: Array2<f64> = Array2::eye(2);
let subproblem = Steihaug::new().with_max_iters(20);
let solver = SR1TrustRegion::new(subproblem);
let res = Executor::new(cost, solver)
.configure(|state| {
state
.param(init_param)
.hessian(init_hessian)
.max_iters(1000)
})
.add_observer(SlogLogger::term(), ObserverMode::Always)
.run()?;
std::thread::sleep(std::time::Duration::from_secs(1));
println!("{res}");
Ok(())
}
fn main() {
if let Err(ref e) = run() {
println!("{e}");
std::process::exit(1);
}
}