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

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

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

This is a preview. Log in through your library . Abstract We apply conjugate duality to establish the existence of optimal portfolios in an assetallocation problem, with the goal of minimizing the ...

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

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