API reference¶
Problem types¶
Defines an MPCC in the form. |
|
MPCC with explicitly separated linear and nonlinear constraint layers. |
|
JAX-traceable MPCC parameterised by an external vector |
Solving¶
Solve an MPCC problem — convenience wrapper around |
|
Solver for Mathematical Programs with Complementarity Constraints (MPCC). |
|
Solve a parametric MPCC; returns |
|
Solve problem from n_starts perturbed initial points. |
Result types¶
Result returned by |
|
Diagnostic snapshot for one NLP solve in an iterative strategy. |
|
IPOPT solver return codes (integer values match cyipopt's status field). |
|
Aggregate result of a multi-start solve. |
|
Result of a TNLP active-set refinement re-solve (§2.6). |
|
Result of a parametric sensitivity solve. |
Diagnostics¶
Partition constraint indices into active subsets at |
|
Classify the strongest MPCC constraint qualification at |
|
Combined degeneracy summary at |
|
Replicate PATH's |
|
Row- and column-norm summary of the active-constraint Jacobian. |
|
Cross-check three independent MPCC merit functions at |
|
Check MPCC second-order sufficient conditions at |
|
Classify the MPCC stationarity type of a solved result. |
|
MPCC stationarity residual: |
|
Test B-stationarity of an MPCC solution by enumerating linearised-MPCC tangent-cone branches and solving an LP per branch. |
Sensitivity¶
Compute |
|
Return active-row labels in the order |
Presolve and scaling¶
Reduce problem by FBBT, pinned-var elimination and dead-pair pruning. |
|
Mapping between an original |
|
Return per-pair diagonal scales that equilibrate the comp block. |
|
Module-level alias for |
Bilevel¶
Emit an |
I/O¶
Read an AMPL text-format |