A short note on solving box inequality and linear equality constrained optimization problem
Optimization and Control
2020-04-21 v1 Systems and Control
Systems and Control
Abstract
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.
Cite
@article{arxiv.2004.08666,
title = {A short note on solving box inequality and linear equality constrained optimization problem},
author = {Yue Sun},
journal= {arXiv preprint arXiv:2004.08666},
year = {2020}
}