|
akreon-convex
Typed convex modeling, conic canonicalization, and primal-dual optimization in C++26.
|
#include "akreon/convex/convex_problem.hpp"#include "akreon/convex/solver_traits.hpp"#include "equality_coupling.hpp"#include "newton_step.hpp"#include "pd_info.hpp"#include "pd_ipm_result.hpp"#include "pred_corr.hpp"#include "residual_state.hpp"Go to the source code of this file.
Classes | |
| struct | convex::PrimalDualIPM< Problem > |
| Primal Dual Interior Point Method Solver. More... | |
Namespaces | |
| namespace | convex |
Functions | |
| template<linalg::VectorContainer ConeVar> | |
| constexpr auto | convex::mu (const ConeVar &x, const ConeVar &y, const linalg::vector_element_t< ConeVar > &nu) |
| mu - normalized duality gap | |
| template<linalg::SquareMatrix Mat, linalg::MatrixContainer EqMat> | |
| constexpr auto | convex::regularize (Mat M, const EqMat &A, const config::RegularizationConfig< linalg::matrix_scalar_t< EqMat > > ®) |
| regularize | |