The goal of this course is to investigate in-depth and to develop expert knowledge in the theory and algorithms for convex optimization. This course will provide a rigorous introduction to the rich ...

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

Algorithms developed by Professor Brokoslaw Laschowski (MIE) and his lab are being used to decode the brain and interface ...

HOUSTON – (Feb. 9, 2022) – Rice University computer scientist Anastasios Kyrillidis has won a National Science Foundation CAREER Award to explore the theory and design of non-convex optimization ...

Predictor-corrector algorithm for linear programming, proposed by Mizuno et al. becomes the best well known in the interior point methods. The purpose of this paper is to extend these results in two ...

The course will take an in-depth look at the main concepts and algorithms in convex optimization. The goal is to develop expert knowledge in duality and in the design and analysis of algorithms for ...