2000 character limit reached
A short note on solving box inequality and linear equality constrained optimization problem (2004.08666v1)
Published 18 Apr 2020 in math.OC, cs.SY, and eess.SY
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.