66 std::iota(J.begin(), J.end(),
index_t{0});
Implements common problem functions for minimization problems without constraints.
UnconstrProblem(const UnconstrProblem &)=default
UnconstrProblem(length_t n)
UnconstrProblem & operator=(const UnconstrProblem &)=default
length_t get_m() const
Number of constraints (always zero)
void eval_proj_multipliers(rvec, real_t) const
void eval_grad_gi(crvec, index_t, rvec grad_gi) const
Constraint gradient is always zero.
length_t n
Number of decision variables, dimension of x.
void eval_proj_diff_g(crvec, rvec) const
UnconstrProblem(UnconstrProblem &&) noexcept=default
void eval_g(crvec, rvec) const
No-op, no constraints.
index_t eval_inactive_indices_res_lna(real_t, crvec, crvec, rindexvec J) const
void resize(length_t n)
Change the number of decision variables.
real_t eval_prox_grad_step(real_t γ, crvec x, crvec grad_ψ, rvec x̂, rvec p) const
No proximal mapping, just a forward (gradient) step.
void eval_jac_g(crvec, rindexvec, rindexvec, rvec) const
Constraint Jacobian is always empty.
length_t get_n() const
Number of decision variables, n.
void eval_grad_g_prod(crvec, crvec, rvec grad) const
Constraint gradient is always zero.
#define USING_ALPAQA_CONFIG(Conf)
typename Conf::real_t real_t
typename Conf::rindexvec rindexvec
typename Conf::index_t index_t
typename Conf::length_t length_t
typename Conf::crvec crvec