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

A Bregman function is a strictly convex, differentiable function that induces a well-behaved distance measure or D-function on Euclidean space. This paper shows that, for every Bregman function, there ...

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

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

Algorithms, Network and Optimization (ANO) Subplan Course Options CSCI 5114 - Practical Algorithmic Complexity CSCI 5254 - Convex Optimization CSCI 5352 - Network Analysis and Modeling CSCI 5434 - ...