|
Pipal
1.2.0
Penalty Interior-Point ALgorithm
|
This is the complete list of members for Pipal::Problem< Real >, including all inherited members.
| constraints(Vector< Real > const &x, Vector< Real > &out) const =0 | Pipal::Problem< Real > | pure virtual |
| constraints_jacobian(Vector< Real > const &x, SparseMatrix< Real > &out) const =0 | Pipal::Problem< Real > | pure virtual |
| constraints_lower_bounds(Vector< Real > &out) const =0 | Pipal::Problem< Real > | pure virtual |
| constraints_upper_bounds(Vector< Real > &out) const =0 | Pipal::Problem< Real > | pure virtual |
| lagrangian_hessian(Vector< Real > const &x, Vector< Real > const &l, SparseMatrix< Real > &out) const =0 | Pipal::Problem< Real > | pure virtual |
| m_name | Pipal::Problem< Real > | private |
| name() const | Pipal::Problem< Real > | inline |
| name(std::string const &t_name) | Pipal::Problem< Real > | inline |
| objective(Vector< Real > const &x, Real &out) const =0 | Pipal::Problem< Real > | pure virtual |
| objective_gradient(Vector< Real > const &x, Vector< Real > &out) const =0 | Pipal::Problem< Real > | pure virtual |
| operator=(Problem const &)=delete | Pipal::Problem< Real > | |
| operator=(Problem &&)=delete | Pipal::Problem< Real > | |
| primal_lower_bounds(Vector< Real > &out) const =0 | Pipal::Problem< Real > | pure virtual |
| primal_upper_bounds(Vector< Real > &out) const =0 | Pipal::Problem< Real > | pure virtual |
| Problem()=default | Pipal::Problem< Real > | |
| Problem(std::string t_name) | Pipal::Problem< Real > | inline |
| Problem(Problem const &)=delete | Pipal::Problem< Real > | |
| Problem(Problem &&)=delete | Pipal::Problem< Real > | |
| UniquePtr typedef | Pipal::Problem< Real > | |
| ~Problem()=default | Pipal::Problem< Real > | virtual |