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

Customer preferences may not be rational, so we focus on quantifying the limit of rationality (LoR) in choice modeling applications. We define LoR as the cost of approximating the observed choice ...

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

Computer-generated holography (CGH) provides an approach to digitally modulate a given wavefront. This technology, partly inherited from optical holography and partly advanced by the progress of ...

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