slsqp_jax.inner

Pluggable inner equality-constrained QP solvers and the Krylov primitives that back them. The active-set loop in slsqp_jax.qp is agnostic to which strategy is used: every solver implements the AbstractInnerSolver interface and returns an InnerSolveResult(d, multipliers, converged).

Modules

• slsqp_jax.inner.base
• slsqp_jax.inner.masking
• slsqp_jax.inner.krylov
• slsqp_jax.inner.projected_cg
• slsqp_jax.inner.cholesky
• slsqp_jax.inner.craig
• slsqp_jax.inner.minres_qlp
• slsqp_jax.inner.hr_stcg