D-Index & Metrics Best Publications

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Mathematics D-index 49 Citations 24,241 112 World Ranking 818 National Ranking 15
Engineering and Technology D-index 49 Citations 24,259 111 World Ranking 2093 National Ranking 14

Research.com Recognitions

Awards & Achievements

2017 - SIAM Fellow For fundamental contributions to continuous optimization theory, analysis, development of algorithms, and scientific applications.

Overview

What is he best known for?

The fields of study he is best known for:

  • Mathematical analysis
  • Mathematical optimization
  • Algorithm

His primary areas of investigation include Mathematical optimization, Convex optimization, Rate of convergence, Proximal Gradient Methods and Convex analysis. His Mathematical optimization research is multidisciplinary, incorporating elements of Bregman divergence, Algorithm, Convex function and Deblurring. His biological study spans a wide range of topics, including Image processing and Minification.

His study in Proximal Gradient Methods is interdisciplinary in nature, drawing from both Modes of convergence, Optimization problem, Proximal gradient methods for learning and Random coordinate descent. His Random coordinate descent research includes elements of Deconvolution and Inverse problem. His Convex analysis research incorporates themes from Uniform convergence, Weak convergence, Subderivative and Applied mathematics.

His most cited work include:

  • A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems (7861 citations)
  • Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems (1450 citations)
  • Proximal alternating linearized minimization for nonconvex and nonsmooth problems (886 citations)

What are the main themes of his work throughout his whole career to date?

His primary scientific interests are in Mathematical optimization, Convex optimization, Rate of convergence, Applied mathematics and Proximal Gradient Methods. The study incorporates disciplines such as Algorithm, Bounded function and Nonlinear programming in addition to Mathematical optimization. Marc Teboulle regularly ties together related areas like Deblurring in his Algorithm studies.

Marc Teboulle has researched Convex optimization in several fields, including Linear matrix inequality, Quadratic programming and Duality. Characterization is closely connected to Metric in his research, which is encompassed under the umbrella topic of Rate of convergence. His Proximal Gradient Methods research is multidisciplinary, incorporating perspectives in Proximal gradient methods for learning, Subgradient method and Random coordinate descent.

He most often published in these fields:

  • Mathematical optimization (61.54%)
  • Convex optimization (38.46%)
  • Rate of convergence (21.37%)

What were the highlights of his more recent work (between 2014-2020)?

  • Mathematical optimization (61.54%)
  • Rate of convergence (21.37%)
  • Minification (11.11%)

In recent papers he was focusing on the following fields of study:

Marc Teboulle focuses on Mathematical optimization, Rate of convergence, Minification, Applied mathematics and Lipschitz continuity. His work carried out in the field of Mathematical optimization brings together such families of science as Nonlinear system and Proximal Gradient Methods. His studies in Rate of convergence integrate themes in fields like Fixed point, Iterated function, Metric, Sequence and Monotonic function.

His Minification study incorporates themes from Subsequence, Vector-valued function and Convex set. His Lipschitz continuity research integrates issues from Bregman divergence and Lemma. While the research belongs to areas of Bregman divergence, he spends his time largely on the problem of Convex function, intersecting his research to questions surrounding Random coordinate descent.

Between 2014 and 2020, his most popular works were:

  • A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications (157 citations)
  • First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems (63 citations)
  • A simplified view of first order methods for optimization (54 citations)

In his most recent research, the most cited papers focused on:

  • Mathematical analysis
  • Mathematical optimization
  • Algorithm

His primary areas of study are Mathematical optimization, Minification, Applied mathematics, Focus and Numerical analysis. His Mathematical optimization research is multidisciplinary, incorporating perspectives in Convex function, Proximal Gradient Methods and Feature. Marc Teboulle combines subjects such as Subderivative and Random coordinate descent with his study of Convex function.

His study with Proximal Gradient Methods involves better knowledge in Convex optimization. His Numerical analysis study frequently links to related topics such as Rate of convergence. His Rate of convergence study combines topics from a wide range of disciplines, such as Euclidean space and Combinatorics.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

Amir Beck;Marc Teboulle.
Siam Journal on Imaging Sciences (2009)

11239 Citations

Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems

A. Beck;M. Teboulle.
IEEE Transactions on Image Processing (2009)

2016 Citations

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

Jérôme Bolte;Shoham Sabach;Marc Teboulle.
Mathematical Programming (2014)

1301 Citations

Mirror descent and nonlinear projected subgradient methods for convex optimization

Amir Beck;Marc Teboulle.
Operations Research Letters (2003)

1075 Citations

Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions

Gong Chen;Marc Teboulle.
Siam Journal on Optimization (1993)

502 Citations

Asymptotic cones and functions in optimization and variational inequalities

Alfred Auslender;Marc Teboulle.
(2002)

500 Citations

A proximal-based decomposition method for convex minimization problems

Gong Chen;Marc Teboulle.
Mathematical Programming (1994)

459 Citations

AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT

Aharon Ben-Tal;Marc Teboulle.
Mathematical Finance (2007)

373 Citations

Gradient-based algorithms with applications to signal-recovery problems.

Amir Beck;Marc Teboulle.
Convex Optimization in Signal Processing and Communications (2009)

351 Citations

Interior Gradient and Proximal Methods for Convex and Conic Optimization

Alfred Auslender;Marc Teboulle.
Siam Journal on Optimization (2006)

328 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Marc Teboulle

Yonina C. Eldar

Yonina C. Eldar

Weizmann Institute of Science

Publications: 69

Francis Bach

Francis Bach

École Normale Supérieure

Publications: 63

Volkan Cevher

Volkan Cevher

École Polytechnique Fédérale de Lausanne

Publications: 58

Michael Unser

Michael Unser

École Polytechnique Fédérale de Lausanne

Publications: 57

Zhouchen Lin

Zhouchen Lin

Peking University

Publications: 52

Jean-Christophe Pesquet

Jean-Christophe Pesquet

CentraleSupélec

Publications: 47

Shiqian Ma

Shiqian Ma

University of California, Davis

Publications: 45

Thomas Pock

Thomas Pock

Graz University of Technology

Publications: 43

Jeffrey A. Fessler

Jeffrey A. Fessler

University of Michigan–Ann Arbor

Publications: 42

Jieping Ye

Jieping Ye

Arizona State University

Publications: 42

Christoph Studer

Christoph Studer

ETH Zurich

Publications: 38

Amir Beck

Amir Beck

Tel Aviv University

Publications: 37

Mingyi Hong

Mingyi Hong

University of Minnesota

Publications: 36

Wotao Yin

Wotao Yin

Alibaba Group (China)

Publications: 35

Ivan W. Selesnick

Ivan W. Selesnick

New York University

Publications: 34

Nicolas Dobigeon

Nicolas Dobigeon

National Polytechnic Institute of Toulouse

Publications: 34

Trending Scientists

Oleg Sokolsky

Oleg Sokolsky

University of Pennsylvania

Wiktor L. Adamowicz

Wiktor L. Adamowicz

University of Alberta

Liang-Chieh Chen

Liang-Chieh Chen

Google (United States)

Gerald P. Brierley

Gerald P. Brierley

The Ohio State University

Silvio Sammartano

Silvio Sammartano

University of Messina

Saravanamuthu Vigneswaran

Saravanamuthu Vigneswaran

University of Technology Sydney

G. C. Wood

G. C. Wood

University of Manchester

Linda B. Brubaker

Linda B. Brubaker

University of Washington

Eero Nikinmaa

Eero Nikinmaa

University of Helsinki

Koji Sode

Koji Sode

University of North Carolina at Chapel Hill

Udo Dannlowski

Udo Dannlowski

University of Münster

George M. Realmuto

George M. Realmuto

University of Minnesota

Marc Decramer

Marc Decramer

KU Leuven

Anne Christophe

Anne Christophe

École Normale Supérieure

Batia Laufer

Batia Laufer

University of Haifa

Emanuele Berti

Emanuele Berti

Johns Hopkins University

Something went wrong. Please try again later.