Rynkiewicz

Oskar Rynkiewicz is an IASD Master’s student at Paris Dauphine-PSL university. He takes an interest in optimization and machine learning. At Télécom Paris, he joined the S²A team from 30/03/2020 to 30/09/2020 to undertake his research internship under the supervision of Olivier Fercoq. He seeks to prove a lower complexity bound of primal-dual algorithms for convex affinely constrained optimization problems under metric sub-regularity. Once obtained, the lower bound will verify the optimality of the currently used methods with respect to metric sub-regularity. He holds an engineering degree from IMT Atlantique.

keywords : convex optimization, lower bound, rate of convergence, metric sub-regularity, machine learning