The following pages link to Marc Teboulle (Q170029):
Displaying 10 items.
- Interior Gradient and Proximal Methods for Convex and Conic Optimization (Q5470216) (← links)
- Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization (Q5704156) (← links)
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications (Q5739143) (← links)
- A probabilistic result for the max-cut problem on random graphs (Q5929142) (← links)
- Entropic proximal decomposition methods for convex programs and variational inequalities (Q5955559) (← links)
- An Adaptive Lagrangian-Based Scheme for Nonconvex Composite Optimization (Q6122587) (← links)
- An elementary approach to tight worst case complexity analysis of gradient based methods (Q6165581) (← links)
- A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis (Q6497038) (← links)
- Exact Lipschitz regularization of convex optimization problems (Q6655789) (← links)
- A Fast Algorithm for Convex Composite Bi-Level Optimization (Q6738661) (← links)
