#include <alpaqa/problem/unconstr-problem.hpp>
Implements common problem functions for minimization problems without constraints.
Meant to be used as a base class for custom problem implementations.
Definition at line 14 of file unconstr-problem.hpp.
Public Member Functions | |
UnconstrProblem (length_t n) | |
void | resize (length_t n) |
Change the number of decision variables. | |
UnconstrProblem (const UnconstrProblem &)=default | |
UnconstrProblem & | operator= (const UnconstrProblem &)=default |
UnconstrProblem (UnconstrProblem &&) noexcept=default | |
UnconstrProblem & | operator= (UnconstrProblem &&) noexcept=default |
length_t | get_n () const |
Number of decision variables, n. | |
length_t | get_m () const |
Number of constraints (always zero) | |
void | eval_g (crvec, rvec) const |
No-op, no constraints. | |
void | eval_grad_g_prod (crvec, crvec, rvec grad) const |
Constraint gradient is always zero. | |
void | eval_jac_g (crvec, rindexvec, rindexvec, rvec) const |
Constraint Jacobian is always empty. | |
void | eval_grad_gi (crvec, index_t, rvec grad_gi) const |
Constraint gradient is always zero. | |
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_proj_diff_g (crvec, rvec) const |
void | eval_proj_multipliers (rvec, real_t) const |
index_t | eval_inactive_indices_res_lna (real_t, crvec, crvec, rindexvec J) const |
Public Attributes | |
length_t | n |
Number of decision variables, dimension of x. | |
|
inline |
n | Number of decision variables |
Definition at line 22 of file unconstr-problem.hpp.
|
default |
|
defaultnoexcept |
|
inline |
Change the number of decision variables.
Definition at line 25 of file unconstr-problem.hpp.
|
default |
|
defaultnoexcept |
|
inline |
Number of decision variables, n.
Definition at line 33 of file unconstr-problem.hpp.
|
inline |
Number of constraints (always zero)
Definition at line 35 of file unconstr-problem.hpp.
No-op, no constraints.
Definition at line 39 of file unconstr-problem.hpp.
Constraint gradient is always zero.
Definition at line 42 of file unconstr-problem.hpp.
Constraint Jacobian is always empty.
Definition at line 45 of file unconstr-problem.hpp.
Constraint gradient is always zero.
Definition at line 48 of file unconstr-problem.hpp.
No proximal mapping, just a forward (gradient) step.
Definition at line 52 of file unconstr-problem.hpp.
Definition at line 59 of file unconstr-problem.hpp.
Definition at line 62 of file unconstr-problem.hpp.
Definition at line 65 of file unconstr-problem.hpp.
length_t n |
Number of decision variables, dimension of x.
Definition at line 19 of file unconstr-problem.hpp.