pub trait AugSystemSolver {
Show 13 methods
// Required methods
fn provides_inertia(&self) -> bool;
fn number_of_neg_evals(&self) -> Index;
fn increase_quality(&mut self) -> bool;
fn last_solve_status(&self) -> ESymSolverStatus;
fn solve(
&mut self,
coeffs: &AugSysCoeffs<'_>,
rhs: &AugSysRhs<'_>,
sol: &mut AugSysSol<'_>,
check_neg_evals: bool,
num_neg_evals: Index,
) -> ESymSolverStatus;
// Provided methods
fn system_dim(&self) -> Index { ... }
fn kkt_triplets(
&self,
) -> Option<(Index, Vec<Index>, Vec<Index>, Vec<Number>)> { ... }
fn l_factor(&self, _want_values: bool) -> Option<FactorPattern> { ... }
fn set_timing_stats(&mut self, _timing: Rc<TimingStatistics>) { ... }
fn set_diagnostics(&mut self, _diag: Rc<DiagnosticsState>) { ... }
fn resolve(
&mut self,
coeffs: &AugSysCoeffs<'_>,
rhs: &AugSysRhs<'_>,
sol: &mut AugSysSol<'_>,
) -> ESymSolverStatus { ... }
fn multi_solve(
&mut self,
coeffs: &AugSysCoeffs<'_>,
rhs_list: &[&AugSysRhs<'_>],
sol_list: &mut [&mut AugSysSol<'_>],
check_neg_evals: bool,
num_neg_evals: Index,
) -> ESymSolverStatus { ... }
fn try_resolve_many_flat(
&mut self,
_coeffs: &AugSysCoeffs<'_>,
_packed_rhs: &mut [Number],
_nrhs: usize,
) -> Option<ESymSolverStatus> { ... }
}Expand description
Trait surface mirroring Ipopt::AugSystemSolver.
Required Methods§
Sourcefn provides_inertia(&self) -> bool
fn provides_inertia(&self) -> bool
Whether the underlying linear solver reports inertia.
Sourcefn number_of_neg_evals(&self) -> Index
fn number_of_neg_evals(&self) -> Index
Number of negative eigenvalues observed in the most recent
factorization. Caller checks provides_inertia() first.
Sourcefn increase_quality(&mut self) -> bool
fn increase_quality(&mut self) -> bool
Ask the underlying solver for higher-quality pivoting.
Sourcefn last_solve_status(&self) -> ESymSolverStatus
fn last_solve_status(&self) -> ESymSolverStatus
Status of the most recent solve call.
Sourcefn solve(
&mut self,
coeffs: &AugSysCoeffs<'_>,
rhs: &AugSysRhs<'_>,
sol: &mut AugSysSol<'_>,
check_neg_evals: bool,
num_neg_evals: Index,
) -> ESymSolverStatus
fn solve( &mut self, coeffs: &AugSysCoeffs<'_>, rhs: &AugSysRhs<'_>, sol: &mut AugSysSol<'_>, check_neg_evals: bool, num_neg_evals: Index, ) -> ESymSolverStatus
One factor + back-substitution for the full 4×4 block system.
check_neg_evals=true asks the linsol to verify that the
observed inertia equals num_neg_evals; on mismatch the
status is WrongInertia and the solution is left untouched.
Provided Methods§
Sourcefn system_dim(&self) -> Index
fn system_dim(&self) -> Index
Dimension of the assembled augmented (KKT) system. Used by the interactive debugger to report inertia; default 0 for backends that don’t track it.
Sourcefn kkt_triplets(&self) -> Option<(Index, Vec<Index>, Vec<Index>, Vec<Number>)>
fn kkt_triplets(&self) -> Option<(Index, Vec<Index>, Vec<Index>, Vec<Number>)>
Triplets of the assembled KKT matrix (dim, irn, jcn, vals)
(1-based lower triangle), for the debugger’s viz kkt. Default
None for backends that don’t expose them.
Sourcefn l_factor(&self, _want_values: bool) -> Option<FactorPattern>
fn l_factor(&self, _want_values: bool) -> Option<FactorPattern>
The LDLᵀ factor pattern (and optionally values) of the most
recent factorization, for the debugger’s viz L. Default None.
Sourcefn set_timing_stats(&mut self, _timing: Rc<TimingStatistics>)
fn set_timing_stats(&mut self, _timing: Rc<TimingStatistics>)
Install the shared per-solve TimingStatistics so the
linear-system factor/back-solve calls are attributed to
linear_system_factorization / linear_system_back_solve.
Default impl is a no-op (timing disabled); the standard
solver overrides to record both fields, and composite solvers
(LowRank) forward to their inner solver.
Sourcefn set_diagnostics(&mut self, _diag: Rc<DiagnosticsState>)
fn set_diagnostics(&mut self, _diag: Rc<DiagnosticsState>)
Install the shared per-solve diagnostics state so KKT-dump sites can consult per-iter gating. Default impl is a no-op (diagnostics disabled); the standard solver overrides to wire in the dump path.
Sourcefn resolve(
&mut self,
coeffs: &AugSysCoeffs<'_>,
rhs: &AugSysRhs<'_>,
sol: &mut AugSysSol<'_>,
) -> ESymSolverStatus
fn resolve( &mut self, coeffs: &AugSysCoeffs<'_>, rhs: &AugSysRhs<'_>, sol: &mut AugSysSol<'_>, ) -> ESymSolverStatus
Back-substitution only, reusing the factorization from the most
recent successful solve. Caller must guarantee the augmented
matrix is byte-identical to that solve (same W, J_c, J_d, all
diagonals, all perturbations, same pivot tolerance). Used by
PdFullSpaceSolver’s iterative-refinement loop and same-matrix
fast path to avoid the per-iter MA57BD refactor that dominates
pounce-ma57 wall time on long-iter problems (e.g. cont5_2_4_l
drops from 97s → ~30s once refactor-per-refinement is gone).
Default impl falls through to solve (correct but slow);
StdAugSystemSolver overrides to skip refill_values and pass
new_matrix=false to the linear solver.
Sourcefn multi_solve(
&mut self,
coeffs: &AugSysCoeffs<'_>,
rhs_list: &[&AugSysRhs<'_>],
sol_list: &mut [&mut AugSysSol<'_>],
check_neg_evals: bool,
num_neg_evals: Index,
) -> ESymSolverStatus
fn multi_solve( &mut self, coeffs: &AugSysCoeffs<'_>, rhs_list: &[&AugSysRhs<'_>], sol_list: &mut [&mut AugSysSol<'_>], check_neg_evals: bool, num_neg_evals: Index, ) -> ESymSolverStatus
Solve the same KKT system for nrhs right-hand sides. Default
impl loops [solve]; concrete backends override only when they
can amortize factorization across calls. Mirrors upstream’s
AugSystemSolver::MultiSolve (IpAugSystemSolver.hpp:113-150).
rhs_list and sol_list must have the same length; each pair
describes one independent solve. The same coeffs are used for
every column.
Sourcefn try_resolve_many_flat(
&mut self,
_coeffs: &AugSysCoeffs<'_>,
_packed_rhs: &mut [Number],
_nrhs: usize,
) -> Option<ESymSolverStatus>
fn try_resolve_many_flat( &mut self, _coeffs: &AugSysCoeffs<'_>, _packed_rhs: &mut [Number], _nrhs: usize, ) -> Option<ESymSolverStatus>
Back-substitution only against the cached factor for
nrhs right-hand sides, packed in column-major layout in
packed_rhs. Each column has length dim = n_x + n_s + n_y_c + n_y_d (the aug-system dim — z/v blocks are not part of this
path; callers expand them via expand_bound_multipliers after
the fact). Solutions overwrite packed_rhs in place.
Returns None when the backend does not support this fast
path; the caller should then fall back to a per-RHS loop over
[resolve]. The contract on coeffs and have_factor matches
[resolve]’s.
StdAugSystemSolver overrides this to forward to
pounce_linsol::TSymLinearSolver::multi_solve with nrhs > 1,
which lets the underlying backend (FERAL / MA57 / LAPACK)
amortize per-call setup and, where supported, block the
triangular solves. Used by pounce-sensitivity for the JaxProblem
jacrev backward, where every cotangent re-solves against the
same converged factor (pounce#77 follow-up).
Dyn Compatibility§
This trait is dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety".