Abstract: This article presents a prediction-correction proximal method (PCPM) for the general nonsmooth convex optimization problem with linear equality and inequality constraints. The proposed ...

Abstract: In this article, we introduce a convex combination-based distributed momentum method (CDM) for solving distributed optimization to minimize a sum of smooth and strongly convex local ...

This course discusses basic convex analysis (convex sets, functions, and optimization problems), optimization theory (linear, quadratic, semidefinite, and geometric programming; optimality conditions ...

where \(\mathsf{G}(\cdot)\) is some convex operator and \(\mathcal{F}\) is as set of feasible input distributions. Examples of such an optimization problem include finding capacity in information ...