pounce_algorithm/sqp/
result.rs

1//! `SqpResult` / `SqpStatus` / `SqpError` — return types for
2//! `SqpAlgorithm::optimize`.
3
4use pounce_common::Number;
5use pounce_qp::{QpError, WorkingSet};
6use std::fmt;
7
8#[derive(Debug, Clone, Copy, PartialEq, Eq)]
9pub enum SqpStatus {
10    /// KKT residuals all below their tolerances.
11    Optimal,
12    /// `max_iter` reached without convergence.
13    MaxIter,
14    /// QP subproblem returned an `Infeasible` status (elastic
15    /// mode certified the QP infeasible).
16    InfeasibleSubproblem,
17    /// Line search failed to find an acceptable step (Phase 5b
18    /// commit 5+; not produced by the c3 always-full-step loop).
19    LineSearchFailed,
20    /// The QP subproblem solver neither produced a usable step nor
21    /// certified infeasibility — it hit its own iteration limit or a
22    /// numerical breakdown (e.g. the extreme m/n ≫ 1 degenerate phase-1
23    /// of #282). This is an HONEST non-committal failure: the SQP could
24    /// not compute a search direction, but — unlike `InfeasibleSubproblem`
25    /// — it makes no infeasibility claim it cannot back with a
26    /// certificate. Maps to `Search_Direction_Becomes_Too_Small`.
27    QpStepFailed,
28    /// The QP subproblem exhausted its own iteration budget
29    /// ([`QpOptions::max_iter`], the `sqp_qp_max_iter` option) without
30    /// converging or certifying anything.
31    ///
32    /// Split out from [`QpStepFailed`](Self::QpStepFailed) because the two
33    /// call for opposite remedies and the merged status actively misled.
34    /// A budget exhaustion is *actionable* — raise the limit — whereas
35    /// `Search_Direction_Becomes_Too_Small` reads as a numerical stall with
36    /// nothing to turn. On the Maros-Mészáros set the merged mapping hid the
37    /// single largest failure class: the cold-start active-set method needs
38    /// roughly one iteration per active-set change, so the flat default of
39    /// 200 is below what a few hundred constraints require, and dozens of
40    /// problems reported a step-size failure when they had simply run out of
41    /// budget. `DUALC1` (n=9, m=215) is the type case — it exits here at the
42    /// default and solves exactly, in one outer iteration, at a larger limit.
43    ///
44    /// Maps to `Maximum_Iterations_Exceeded`.
45    QpIterationLimit,
46    /// The problem is unbounded below: the step QP returned a certified
47    /// recession ray (zero curvature, feasible for every step length,
48    /// strict descent) *and* that ray was re-verified against the true
49    /// NLP — feasible points along it drive `f` toward `−∞` at (at
50    /// least) half the linear rate out to `1e12·‖d‖`. Maps to
51    /// `Diverging_Iterates`, POUNCE's (Ipopt's) unboundedness verdict,
52    /// the same status the IPM paths report on an unbounded model
53    /// (gh #388). An *unverified* unbounded step QP is a statement about
54    /// the local model only and falls back to
55    /// [`QpStepFailed`](Self::QpStepFailed).
56    Unbounded,
57}
58
59impl fmt::Display for SqpStatus {
60    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
61        match self {
62            SqpStatus::Optimal => write!(f, "optimal"),
63            SqpStatus::MaxIter => write!(f, "max-iter"),
64            SqpStatus::InfeasibleSubproblem => write!(f, "infeasible-subproblem"),
65            SqpStatus::LineSearchFailed => write!(f, "line-search-failed"),
66            SqpStatus::QpStepFailed => write!(f, "qp-step-failed"),
67            SqpStatus::QpIterationLimit => write!(f, "qp-iteration-limit"),
68            SqpStatus::Unbounded => write!(f, "unbounded"),
69        }
70    }
71}
72
73#[derive(Debug)]
74pub enum SqpError {
75    /// Hard QP-solver failure (singular, dimension mismatch, etc.).
76    QpFailure(QpError),
77    /// Caller-supplied dimensions disagree.
78    DimensionMismatch(String),
79}
80
81impl fmt::Display for SqpError {
82    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
83        match self {
84            SqpError::QpFailure(e) => write!(f, "QP subproblem failure: {e}"),
85            SqpError::DimensionMismatch(s) => write!(f, "dimension mismatch: {s}"),
86        }
87    }
88}
89
90impl From<QpError> for SqpError {
91    fn from(e: QpError) -> Self {
92        SqpError::QpFailure(e)
93    }
94}
95
96#[derive(Debug, Clone)]
97pub struct SqpResult {
98    pub x: Vec<Number>,
99    pub lambda_g: Vec<Number>,
100    pub lambda_x: Vec<Number>,
101    pub obj: Number,
102    pub status: SqpStatus,
103    pub n_iter: u32,
104    pub n_qp_solves: u32,
105    /// Active-set changes (adds + drops) summed over every step QP
106    /// solved during this call — the inner work a working-set warm
107    /// start exists to avoid. Reported separately from `n_iter`
108    /// because the two move independently: on a QP-shaped NLP the
109    /// outer loop always terminates in one iteration, so the entire
110    /// warm-start effect shows up here and nowhere else.
111    ///
112    /// Excludes second-order-correction QPs, whose stats the line
113    /// search does not surface.
114    pub n_qp_working_set_changes: u32,
115    /// Final stationarity residual (max-norm of `∇f + Jᵀ λ_g + λ_x`).
116    pub final_stationarity: Number,
117    /// Final constraint violation (max-norm of `c(x*)` for
118    /// equalities plus bound-violation slack).
119    pub final_constr_viol: Number,
120    /// Final QP working set, suitable for warm-starting the next
121    /// `optimize_with_warm_start` call (§6 design-note contract).
122    /// `None` only when no QP was solved (e.g. cold-start declared
123    /// the iterate optimal at the very first KKT check).
124    pub working_set: Option<WorkingSet>,
125}
pounce_algorithm/sqp/result.rs

pounce_algorithm/sqp/
result.rs
