Marc Teboulle
Computational Theory and Mathematics · 1990–2017
A researcher in the Science corpus: 16 papers; trusts 38 researchers and is trusted by 527 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 77 citations into it; #113 of 12,489 by trust here, #291 by citations
- Numerical Analysis — 65 citations into it; #36 of 3,703 by trust here, #60 by citations
- Computational Mechanics — 46 citations into it; #44 of 10,021 by trust here, #77 by citations
- Optimization & Training — 40 citations into it; #1,862 of 2,605 by trust here, #1,869 by citations
- Mathematical Optimization — 32 citations into it; #24 of 422 by trust here, #8 by citations
- Computer Vision and Pattern Recognition — 27 citations into it; #2,848 of 21,973 by trust here, #2,077 by citations
- Artificial Intelligence — 25 citations into it; #15,574 of 36,961 by trust here, #31,837 by citations
- Mathematical Physics — 20 citations into it; #49 of 8,596 by trust here, #19 by citations
Whom Marc Teboulle trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Yurii E. Nesterov
- R. Tyrrell Rockafellar
- Amir Beck
- Alfred Auslender
- Dimitri P. Bertsekas
- Antonin Chambolle
- J. Moreau
- Boris Polyak
- Patrick L. Combettes
- Hans Föllmer
Who trusts Marc Teboulle overall
- Guanghui Lan
- Amir Beck
- Paul Tseng
- Antonin Chambolle
- Francis R. Bach
- John C. Duchi
- Shai Shalev-Shwartz
- Julien Mairal
- Weisheng Dong
- Laurent Condat
Papers from Marc Teboulle's perspective
Ordered by how strongly the researchers Marc Teboulle trusts endorse each paper. Same corpus, a different order for every researcher.
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Monotone Operators and the Proximal Point Algorithm
- Mirror descent and nonlinear projected subgradient methods for convex optimization
- Interior-point polynomial algorithms in convex programming
- Sparse Reconstruction by Separable Approximation
- Regression Shrinkage and Selection via the Lasso
- Proximité et dualité dans un espace hilbertien
- Smooth minimization of non-smooth functions
- Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper
- Problem Complexity and Method Efficiency in Optimization
Their papers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems (2009) — 6,446 citations
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems (2009) — 2,045 citations
- Mirror descent and nonlinear projected subgradient methods for convex optimization (2003) — 1,404 citations
- A conditional gradient method with linear rate of convergence for solving convex linear systems (2004) — 88 citations
- Interior Gradient and Proximal Methods for Convex and Conic Optimization (2006) — 315 citations
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems (2013) — 1,985 citations
- Asymptotic cones and functions in optimization and variational inequalities (2002) — 456 citations
- A comparison of constraint quali cations in in nite-dimensional convex programming (1990)
- AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT (2007) — 470 citations
- Gradient-based algorithms with applications to signal-recovery problems (2010) — 428 citations
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications (2017) — 498 citations
- Weak Convergence of an Iterative Method for Pseudomonotone Variational Inequalities and Fixed-Point Problems (2010) — 106 citations
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems (2015) — 108 citations
- Smoothing and First Order Methods: A Unified Framework (2012) — 336 citations
- Performance of first-order methods for smooth convex minimization: a novel approach (2012) — 345 citations
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions (1993)