IEMS 459: Convex Optimization VIEW ALL COURSE TIMES AND SESSIONS Prerequisites Linear Algebra, Calculus , Real Analysis Description The goal of this course is to investigate in-depth and to develop ...

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

Various non-convex optimization algorithms are thus designed to seek an optimal solution by introducing different constraints, frameworks, and initializations.

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 ...

Rice University computer scientist Anastasios Kyrillidis has won a National Science Foundation CAREER Award to explore the theory and design of non-convex optimization algorithms, an increasingly ...

IEMS 458: Convex Optimization VIEW ALL COURSE TIMES AND SESSIONS Prerequisites 450-2 is recommended but not required Description The course will take an in-depth look at the main concepts and ...

More information: Xiaomeng Sui et al, Non-convex optimization for inverse problem solving in computer-generated holography, Light: Science & Applications (2024). DOI: 10.1038/s41377-024-01446-w ...