Convex optimisation constitutes a fundamental area in applied mathematics where the objective is to identify the minimum of a convex function subject to a set of convex constraints. This framework ...

In this note, we extend the algorithms Extra [13] and subgradient-push [10] to a new algorithm ExtraPush for consensus optimization with convex differentiable objective functions over a directed ...

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: This letter presents an effective optimization synthesis approach for orbital angular momentum (OAM) beams with low sidelobe and high mode purity through antenna array complex excitation ...

This paper deals with the packing problem of circles and non-convex polygons, which can be both translated and rotated into a strip with prohibited regions. Using the Ф-function technique, a ...