Enum ConSocpMap 

pub enum ConSocpMap {
    Eq {
        a_row: usize,
    },
    Ineq {
        upper: Option<usize>,
        lower: Option<usize>,
    },
    Quad {
        z_row0: usize,
        z_row1: usize,
    },
}

Where each .nl constraint landed in the standard-form conic program, so the cone multipliers can be mapped back to a per-.nl-constraint dual. One entry per original constraint, in order. (Analogue of ConRowMap for the SOCP path produced by extract_socp_with_map.)

Variants

Eq

Linear equality → row a_row of A (multiplier y[a_row]).

Fields

a_row: usize

Ineq

Linear inequality / range → up to two rows of the nonnegative G block (row ≤ g_u and/or −row ≤ −g_l), multipliers z[..] ≥ 0.

Fields

upper: Option<usize>

lower: Option<usize>

Quad

Convex quadratic inequality g(x) ≤ g_u, reformulated to one second-order cone. The first two cone rows both carry the linear coefficient vector a = ∇(linear part), so the original constraint multiplier is recovered as z[r0] + z[r1] (see recover_socp_duals).

Fields

z_row0: usize

z_row1: usize

Trait Implementations

impl Clone for ConSocpMap

fn clone(&self) -> ConSocpMap

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ConSocpMap

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.