Convex optimisation constitutes a fundamental area in applied mathematics where the objective is to identify the minimum of a convex function subject to a set of convex constraints. This framework ...

Abstract. We consider sensitivity functionals and Lagrange multiplier method for solving finite dimensional convex optimization problem.An analysis based on this property is also applied for ...

Numerical Continuation and Stationkeeping of Quasi-Periodic Quasi-Satellite Orbits around Phobos Quasi-satellite orbits (QSOs) have been under the research spotlight due to their linear stability and ...

The goal of this course is to give a modern introduction to mathematical methods for solving hard mathematics problems that arise in the sciences. The main focus will be to explain the process of ...

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

Field of expertise: Numerical analysis, machine learning and scientific computing Selected Projects • Mathematical Theory for Deep Learning It is the key goal of this project to provide a rigorous ...