  This paper discusses a special kind of convex constrained optimization
problem, whose constraints consist of box inequalities and linear equalities.
For this problem, in addition to general optimization algorithms such as exact
penalty algorithm and interior point algorithm, there is a simple iterative
algorithm that is simple to implement, which is favored by machine learning
practitioners.
