Prefer a chat interface with context about you and your work?
Convex separable minimization with box constraints
Abstract A minimization problem with convex separable objective function subject to a convex separable inequality constraint of the form “less than or equal to” and bounds on the variables (box constraints) is considered. Necessary and sufficient condition is proved for a feasible solution to be an optimal solution to this …