|
akreon-convex
Typed convex modeling, conic canonicalization, and primal-dual optimization in C++26.
|
#include <solver_config.hpp>
Public Attributes | |
| std::size_t | steps {PD_IPM_STEPS} |
| total number of iter | |
| std::size_t | backtrack_steps {64} |
| total number of backtracking steps | |
| T | primal_feas_tol {1e-5} |
| tolerance for primal feasbility | |
| T | dual_feas_tol {1e-5} |
| tolerance for dual feasbility | |
| T | duality_gap_tol {1e-5} |
| tolerance for complementarity | |
| T | Delta {2 * linalg::ln2_v<T>} |
| relative neighborhood around F(Beta) | |
| FactorConfig< T > | schur |
| Schur Factor Config. | |
| RegularizationConfig< T > | reg |
| Regularization config. | |
Definition at line 33 of file solver_config.hpp.
| std::size_t config::PrimalDualIPMConfig< T >::backtrack_steps {64} |
total number of backtracking steps
Definition at line 35 of file solver_config.hpp.
| T config::PrimalDualIPMConfig< T >::Delta {2 * linalg::ln2_v<T>} |
relative neighborhood around F(Beta)
Definition at line 39 of file solver_config.hpp.
| T config::PrimalDualIPMConfig< T >::dual_feas_tol {1e-5} |
tolerance for dual feasbility
Definition at line 37 of file solver_config.hpp.
| T config::PrimalDualIPMConfig< T >::duality_gap_tol {1e-5} |
tolerance for complementarity
Definition at line 38 of file solver_config.hpp.
| T config::PrimalDualIPMConfig< T >::primal_feas_tol {1e-5} |
tolerance for primal feasbility
Definition at line 36 of file solver_config.hpp.
| RegularizationConfig<T> config::PrimalDualIPMConfig< T >::reg |
Regularization config.
Definition at line 42 of file solver_config.hpp.
| FactorConfig<T> config::PrimalDualIPMConfig< T >::schur |
Schur Factor Config.
Definition at line 40 of file solver_config.hpp.
| std::size_t config::PrimalDualIPMConfig< T >::steps {PD_IPM_STEPS} |
total number of iter
Definition at line 34 of file solver_config.hpp.