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

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

where \(\mathsf{G}(\cdot)\) is some convex operator and \(\mathcal{F}\) is as set of feasible input distributions. Examples of such an optimization problem include finding capacity in information ...

Quantum process tomography is often used to completely characterize an unknown quantum process. However, it may lead to an unphysical process matrix, which will cause the loss of information with ...

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