Faster Convex Optimization: Simulated Annealing with an Efficient Universal Barrier, Proceedings of The 33rd International Conference on Machine Learning, 2016. ,
An Extension Theorem for convex functions of class C 1,1 on Hilbert spaces, Journal of Mathematical Analysis and Applications, vol.446, pp.1167-1182, 2017. ,
Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles, Journal of the AMS, vol.23, issue.2, pp.535-561, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00793769
Complexity analysis of a sampling-based interior point method for convex optimization, 2018. ,
, Pauwels Curiosities and counterexamples in smooth convex optimization, 2018.
The entropic barrier: a simple and optimal universal self-concordant barrier, Conference on Learning Theory, pp.279-279, 2015. ,
A relationship between the second derivatives of a convex function and of its conjugate, Mathematical Programming, vol.13, pp.364-365, 1977. ,
A Robust Accelerated Optimization Algorithm for Strongly Convex Functions, Proceedings of the 2018 Annual American Control Conference (ACC), pp.1376-1381, 2018. ,
Smooth optimization with approximate gradient, SIAM Journal on Optimization, vol.19, issue.3, pp.1171-1183, 2008. ,
First-order methods of smooth convex optimization with inexact oracle, Mathematical Programming, vol.146, issue.1-2, pp.37-75, 2014. ,
An optimal variant of Kelley's cutting-plane method, Mathematical Programming, vol.160, issue.1-2, pp.321-351, 2016. ,
, On the Properties of Convex Functions over Open Sets, 2018.
Efficient first-order methods for convex minimization: a constructive approach, Mathematical Programming ,
URL : https://hal.archives-ouvertes.fr/hal-01902048
Contributions to the Complexity Analysis of Optimization Algorithms, 2014. ,
Performance of first-order methods for smooth convex minimization: a novel approach, Mathematical Programming, vol.145, issue.1-2, pp.451-482, 2014. ,
Optimal nonergodic sublinear convergence rate of proximal point algorithm for maximal monotone inclusion problems, 2019. ,
On the optimal ergodic sublinear convergence rate of the relaxed proximal point algorithm for variational inequalities, 2019. ,
Simulated annealing for convex optimization, Mathematics of Operations Research, vol.31, issue.2, pp.253-266, 2006. ,
Optimized first-order methods for smooth convex minimization, Mathematical Programming, vol.159, issue.1-2, pp.81-107, 2016. ,
Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions, 2018. ,
Accelerated proximal point method for maximally monotone operators, 2019. ,
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions, Optimization Letters, vol.11, issue.7, pp.1185-1199, 2017. ,
Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints, SIAM Journal on Optimization, vol.26, issue.1, pp.57-95, 2016. ,
Inexact proximal Newton methods for self-concordant functions, Mathematical Methods of Operations Research, vol.85, pp.19-41, 2017. ,
On the convergence rate of the Halpern-iteration, 2017. ,
The geometry of logconcave functions and sampling algorithms, Random Structures & Algorithms, vol.30, issue.3, pp.307-358, 2007. ,
, Lectures on convex optimization, vol.137, 2018.
Interior point polynomial algorithms in convex programming, 1994. ,
Convergence of methods of feasible directions in extremal problems, USSR Computational Mathematics and Mathematical Physics, vol.11, issue.4, pp.53-70, 1971. ,
A Mathematical View of Interior-Point Methods in Convex Optimization, 2001. ,
Operator splitting performance estimation: Tight contraction factors and optimal parameter selection, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02956361
Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions, Operations Research, vol.32, issue.6, pp.1296-1308, 1984. ,
Convergence rates of inexact proximal-gradient methods for convex optimization, Advances in neural information processing systems, pp.1458-1466, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00618152
Exact worst-case convergence rates of the proximal gradient method for composite convex minimization, Journal of Optimization Theory and Applications, vol.178, issue.2, pp.455-476, 2018. ,
Smooth strongly convex interpolation and exact worst-case performance of first-order methods, Mathematical Programming, pp.307-345, 2017. ,
Exact worst-case performance of first-order methods for composite convex optimization, SIAM Journal on Optimization, vol.27, issue.3, pp.1283-1313, 2017. ,
Lyapunov functions for first-order methods: Tight automated convergence guarantees, Proceedings of the 35th International Conference on Machine Learning (ICML), pp.4897-4906, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01902068
The fastest known globally convergent first-order method for minimizing strongly convex functions, IEEE Control Systems Letters, vol.2, issue.1, pp.49-54, 2018. ,