49 [[maybe_unused]]
crvec Σ, [[maybe_unused]]
real_t γ_0,
50 [[maybe_unused]]
crvec x_0, [[maybe_unused]]
crvec x̂_0,
51 [[maybe_unused]]
crvec p_0,
52 [[maybe_unused]]
crvec grad_ψx_0) {
62 [[maybe_unused]]
crvec grad_ψxₖ,
63 [[maybe_unused]]
crvec grad_ψxₙₑₓₜ) {
70 [[maybe_unused]]
crvec grad_ψxₖ,
rvec qₖ)
const {
72 return lbfgs.apply(qₖ, γₖ);
78 lbfgs.scale_y(γₖ / old_γₖ);
88 return "LBFGSDirection<" + std::string(config_t::get_name()) +
'>';
Limited memory Broyden–Fletcher–Goldfarb–Shanno (L-BFGS) algorithm.
LBFGSParams< config_t > Params
The main polymorphic minimization problem interface.
length_t get_num_variables() const
[Required] Number of decision variables.
#define USING_ALPAQA_CONFIG(Conf)
bool rescale_on_step_size_changes
Parameters for the LBFGSDirection class.
typename Conf::real_t real_t
typename Conf::crvec crvec
std::string get_name() const
LBFGSDirectionParams< config_t > DirectionParams
void changed_γ(real_t γₖ, real_t old_γₖ)
DirectionParams direction_params
DirectionParams direction
bool update(real_t γₖ, real_t γₙₑₓₜ, crvec xₖ, crvec xₙₑₓₜ, crvec pₖ, crvec pₙₑₓₜ, crvec grad_ψxₖ, crvec grad_ψxₙₑₓₜ)
LBFGSDirection(const LBFGS &lbfgs, const DirectionParams &directionparams={})
typename LBFGS::Params AcceleratorParams
LBFGSDirection(LBFGS &&lbfgs, const DirectionParams &directionparams={})
void initialize(const Problem &problem, crvec y, crvec Σ, real_t γ_0, crvec x_0, crvec x̂_0, crvec p_0, crvec grad_ψx_0)
bool apply(real_t γₖ, crvec xₖ, crvec x̂ₖ, crvec pₖ, crvec grad_ψxₖ, rvec qₖ) const
alpaqa::LBFGS< config_t > LBFGS
bool has_initial_direction() const
AcceleratorParams accelerator
LBFGSDirection(const Params ¶ms)
LBFGSDirection(const typename LBFGS::Params ¶ms, const DirectionParams &directionparams={})
TypeErasedProblem< config_t > Problem