Skip to content

Commit 36cfae4

Browse files
checking for flow
1 parent 2b6576f commit 36cfae4

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

docs/solver/background.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -35,7 +35,7 @@ The indicator function says simply that there is infinite additional cost when $
3535

3636
We modify the generic optimization problem to include the indicator function by adding it to the cost. We introduce a new state variable $z$, called the slack variable, to describe the constrained version of the original state variable $x$, which we will now call the primal variable.
3737

38-
Since both the state and input constraints are convex ($\mathcal{X}$ and $\mathcal{U}$), ADMM naturally decomposes the problem by projecting the primal variables ($x, u$) onto these convex constraint sets through the slack updates. This projection ensures constraint satisfaction and accelerates convergence by leveraging the separability of the constraint structure. The reduction via ADMM works by alternating between solving smaller subproblems for the primal and slack variables, significantly reducing the complexity of the original constrained optimization problem.
38+
Since both the state constraints ($\mathcal{X}$) and input constraints ($\mathcal{U}$) are convex, ADMM naturally decomposes the problem by projecting the primal variables ($x, u$) onto these convex constraint sets through the slack updates. This projection ensures constraint satisfaction and accelerates convergence by leveraging the separability of the constraint structure. The reduction via ADMM works by alternating between solving smaller subproblems for the primal and slack variables, significantly reducing the complexity of the original constrained optimization problem.
3939

4040

4141

0 commit comments

Comments
 (0)