| .cardinality_lagrangian | R Documentation |
Solves the node's network at a sequence of multipliers, each step one
.flow_solve() and one verify_flow(), and returns the largest certified
relaxed optimum it reached. Multipliers move along the projected subgradient
with step t_0 / (1 + k), warm-started from whatever lambda is handed in,
which is the parent's best set during a search.
.cardinality_lagrangian(
problem,
coefs = NULL,
lambda = NULL,
steps = 20L,
index = NULL,
edits = NULL,
incumbent = Inf,
step0 = NULL,
tol = 1e-09,
cost = NULL,
warm = NULL,
deadline = Inf
)
problem |
The node's network, or the pair |
coefs |
Moment coefficients, one per one-sided row. |
lambda |
Starting multipliers, one per row. |
steps |
How many multiplier updates to take. |
index |
The network's index, unless |
edits |
The node's arc-bound decisions. |
incumbent |
The best objective known, which sets the step scale. |
step0 |
An explicit |
tol |
Numeric tolerance for certification and for the row values. |
cost |
Optional distance matrix for the audit. |
warm |
Optional |
deadline |
Elapsed time, on |
Consecutive steps solve one network. The topology, the arc bounds and every
non-pair cost are the ones the previous step solved; only the pair costs
moved, by one multiplier step, so the previous step's flow and potentials are
a near-optimal starting point for this one and are carried across. warm
gives the first step the same footing, from whichever solve the caller has
to hand.
A list with bound, the multipliers that attained it, the relaxed
solve at those multipliers, any moment-feasible solutions the ascent
passed through, certified, whether the bound it reports came out of a
certified solve, and warm, the last complete solve's flow and potentials.
A status of "interrupted" means a solve ran out of time; the bound and
the solutions reported alongside it came from the steps that finished, and
are as valid as any others.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.