Equality-constrained convex optimization
= Equality-constrained convex optimization
An equality-constrained convex optimization problem has the form
$$
\min_x f(x)\quad\text{subject to }Ax=b,
$$
where $f$ is <convex> and the constraint is <affine function>[affine]. Its stationarity and feasibility equations can be combined into a monotone primal-dual operator.