In this paper, we establish hardness and approximation results for various Lp-ball constrained homogeneous polynomial optimization problems, where p ∈ [2, ∞]. Specifically, we prove that for any given ...

Optimization problems with partial differential equations as constraints arise widely in many areas of science and engineering, in particular in problems of the design. The solution of such class of ...

On Monday the 2nd of December 2019, M.Sc. Paul Saikko will defend his doctoral thesis on Implicit Hitting Set Algorithms for Constraint Optimization. The thesis is a part of research done in the ...

Students will learn about the most common numerical optimization algorithms for solving smooth unconstrained and constrained optimization problems. They will understand the theoretical foundation and ...

On December 2, 2019 Saikko successfully defended his doctoral thesis Im­pli­cit Hit­ting Set Algorithms for Con­straint Op­tim­iz­a­tion M.Sc. Paul Saikko succesfully defended his doctoral ...

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