Marc Teboulle
Marc Teboulle
Professor, School of Mathematical Sciences, Tel Aviv University
Verified email at math.tau.ac.il - Homepage
Title
Cited by
Cited by
Year
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A Beck, M Teboulle
SIAM journal on imaging sciences 2 (1), 183-202, 2009
91942009
Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems
A Beck, M Teboulle
IEEE transactions on image processing 18 (11), 2419-2434, 2009
17222009
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
J Bolte, S Sabach, M Teboulle
Mathematical Programming 146 (1-2), 459-494, 2014
9792014
Mirror descent and nonlinear projected subgradient methods for convex optimization
A Beck, M Teboulle
Operations Research Letters 31 (3), 167-175, 2003
8592003
Asymptotic cones and functions in optimization and variational inequalities
A Auslender, M Teboulle
Springer Science & Business Media, 2006
4482006
Convergence analysis of a proximal-like minimization algorithm using Bregman functions
G Chen, M Teboulle
SIAM Journal on Optimization 3 (3), 538-543, 1993
4261993
A proximal-based decomposition method for convex minimization problems
G Chen, M Teboulle
Mathematical Programming 64 (1-3), 81-101, 1994
4111994
Gradient-based algorithms with applications to signal recovery
A Beck, M Teboulle
Convex optimization in signal processing and communications, 42-88, 2009
3522009
An old‐new concept of convex risk measures: The optimized certainty equivalent
A Ben‐Tal, M Teboulle
Mathematical Finance 17 (3), 449-476, 2007
3082007
Interior gradient and proximal methods for convex and conic optimization
A Auslender, M Teboulle
SIAM Journal on Optimization 16 (3), 697-725, 2006
2972006
Entropic proximal mappings with applications to nonlinear programming
M Teboulle
Mathematics of Operations Research 17 (3), 670-690, 1992
2741992
A logarithmic-quadratic proximal method for variational inequalities
A Auslender, M Teboulle, S Ben-Tiba
Computational Optimization, 31-40, 1999
2071999
Convergence of proximal-like algorithms
M Teboulle
SIAM Journal on Optimization 7 (4), 1069-1083, 1997
2071997
Smoothing and first order methods: A unified framework
A Beck, M Teboulle
SIAM Journal on Optimization 22 (2), 557-580, 2012
2042012
Entropy-like proximal methods in convex programming
AN Iusem, BF Svaiter, M Teboulle
Mathematics of Operations Research 19 (4), 790-814, 1994
1971994
Hidden convexity in some nonconvex quadratically constrained quadratic programming
A Ben-Tal, M Teboulle
Mathematical Programming 72 (1), 51-63, 1996
1641996
Expected utility, penalty functions, and duality in stochastic nonlinear programming
A Ben-Tal, M Teboulle
Management Science 32 (11), 1445-1466, 1986
1611986
Interior proximal and multiplier methods based on second order homogeneous kernels
A Auslender, M Teboulle, S Ben-Tiba
Mathematics of Operations Research 24 (3), 645-668, 1999
1601999
A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
HH Bauschke, J Bolte, M Teboulle
Mathematics of Operations Research 42 (2), 330-348, 2017
1592017
A unified continuous optimization framework for center-based clustering methods
M Teboulle
Journal of Machine Learning Research 8 (Jan), 65-102, 2007
1472007
The system can't perform the operation now. Try again later.
Articles 1–20