Marc Teboulle

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 22

Top Topics

Convergence Analysis

Decomposition Methods

Stationary Points

Equality Constraints

Top Venues

Oper. Res. Lett.

J. Optim. Theory Appl.

Publications

Eyal Cohen, D. Russell Luke, Titus Pinta, Shoham Sabach, Marc Teboulle
A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis. J. Glob. Optim. 89 (1) (2024)
Marc Teboulle, Yakov Vaisbourd
An elementary approach to tight worst case complexity analysis of gradient based methods. Math. Program. 201 (1) (2023)
Shoham Sabach, Marc Teboulle
Faster Lagrangian-Based Methods in Convex Optimization. SIAM J. Optim. 32 (1) (2022)
Eyal Cohen, Nadav Hallak, Marc Teboulle
A Dynamic Alternating Direction of Multipliers for Nonconvex Minimization with Nonlinear Functional Equality Constraints. J. Optim. Theory Appl. 193 (1) (2022)
Amir Beck, Marc Teboulle
Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems. SIAM J. Optim. 31 (3) (2021)
D. Russell Luke, Marc Teboulle, Nguyen H. Thao
Necessary conditions for linear convergence of iterated expansive, set-valued mappings. Math. Program. 180 (1) (2020)
Shoham Sabach, Marc Teboulle
Faster Lagrangian-Based Methods in Convex Optimization. CoRR (2020)
Nadav Hallak, Marc Teboulle
Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach. J. Optim. Theory Appl. 186 (2) (2020)
Marc Teboulle, Yakov Vaisbourd
Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints. SIAM J. Imaging Sci. 13 (1) (2020)
Heinz H. Bauschke, Jérôme Bolte, Jiawei Chen, Marc Teboulle, Xianfu Wang
On Linear Convergence of Non-Euclidean Gradient Methods without Strong Convexity and Lipschitz Gradient Continuity. J. Optim. Theory Appl. 182 (3) (2019)
Nadav Hallak, Marc Teboulle
A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization. Oper. Res. Lett. 47 (5) (2019)
D. Russell Luke, Shoham Sabach, Marc Teboulle
Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons. SIAM J. Math. Data Sci. 1 (3) (2019)
Jérôme Bolte, Shoham Sabach, Marc Teboulle, Yakov Vaisbourd
First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems. SIAM J. Optim. 28 (3) (2018)
Marc Teboulle
A simplified view of first order methods for optimization. Math. Program. 170 (1) (2018)
Jérôme Bolte, Shoham Sabach, Marc Teboulle
Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence. Math. Oper. Res. 43 (4) (2018)
Heinz H. Bauschke, Jérôme Bolte, Marc Teboulle
A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications. Math. Oper. Res. 42 (2) (2017)
Jérôme Bolte, Shoham Sabach, Marc Teboulle, Yakov Vaisbourd
First Order Methods beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems. CoRR (2017)
D. Russell Luke, Shoham Sabach, Marc Teboulle, Kobi Zatlawey
A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem. J. Glob. Optim. 69 (4) (2017)
Amir Beck, Shoham Sabach, Marc Teboulle
An Alternating Semiproximal Method for Nonconvex Regularized Structured Total Least Squares Problems. SIAM J. Matrix Anal. Appl. 37 (3) (2016)
Ron Shefi, Marc Teboulle
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems. EURO J. Comput. Optim. 4 (1) (2016)
Yoel Drori, Marc Teboulle
An optimal variant of Kelley's cutting-plane method. Math. Program. 160 (1-2) (2016)
Ron Shefi, Marc Teboulle
A dual method for minimizing a nonsmooth objective over one smooth inequality constraint. Math. Program. 159 (1-2) (2016)
Yoel Drori, Shoham Sabach, Marc Teboulle
A simple algorithm for a class of nonsmooth convex-concave saddle-point problems. Oper. Res. Lett. 43 (2) (2015)
Ron Shefi, Marc Teboulle
Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization. SIAM J. Optim. 24 (1) (2014)
Amir Beck, Angelia Nedic, Asuman E. Ozdaglar, Marc Teboulle
An O(1/k) Gradient Method for Network Resource Allocation Problems. IEEE Trans. Control. Netw. Syst. 1 (1) (2014)
Amir Beck, Marc Teboulle
A fast dual proximal gradient algorithm for convex minimization and applications. Oper. Res. Lett. 42 (1) (2014)
Jérôme Bolte, Shoham Sabach, Marc Teboulle
Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146 (1-2) (2014)
Yoel Drori, Marc Teboulle
Performance of first-order methods for smooth convex minimization: a novel approach. Math. Program. 145 (1-2) (2014)
Ronny Luss, Marc Teboulle
Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint. SIAM Rev. 55 (1) (2013)
Amir Beck, Marc Teboulle
Smoothing and First Order Methods: A Unified Framework. SIAM J. Optim. 22 (2) (2012)
Amir Beck, Yoel Drori, Marc Teboulle
A new semidefinite programming relaxation scheme for a class of quadratic matrix problems. Oper. Res. Lett. 40 (4) (2012)
Ronny Luss, Marc Teboulle
Convex approximations to sparse PCA via Lagrangian duality. Oper. Res. Lett. 39 (1) (2011)
Ronny Luss, Marc Teboulle
Conditional Gradient Algorithms for Rank-One Matrix Approximations with a Sparsity Constraint CoRR (2011)
Alfred Auslender, Ron Shefi, Marc Teboulle
A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems. SIAM J. Optim. 20 (6) (2010)
Amir Beck, Marc Teboulle
Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems. IEEE Trans. Image Process. 18 (11) (2009)
Hédy Attouch, Roberto Cominetti, Marc Teboulle
Foreword: Special issue on nonlinear convex optimization and variational inequalities. Math. Program. 116 (1-2) (2009)
Amir Beck, Marc Teboulle
A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid. Math. Program. 118 (1) (2009)
Amir Beck, Marc Teboulle
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems. SIAM J. Imaging Sci. 2 (1) (2009)
Alfred Auslender, Marc Teboulle
Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities. Math. Program. 120 (1) (2009)
Amir Beck, Marc Teboulle
A fast Iterative Shrinkage-Thresholding Algorithm with application to wavelet-based image deblurring. ICASSP (2009)
Yonina C. Eldar, Amir Beck, Marc Teboulle
A Minimax Chebyshev Estimator for Bounded Error Estimation. IEEE Trans. Signal Process. 56 (4) (2008)
Amir Beck, Marc Teboulle, Zahar Chikishev
Iterative Minimization Schemes for Solving the Single Source Localization Problem. SIAM J. Optim. 19 (3) (2008)
Alfred Auslender, Paulo J. S. Silva, Marc Teboulle
Nonmonotone projected gradient methods based on barrier and Euclidean distances. Comput. Optim. Appl. 38 (3) (2007)
Marc Teboulle
A Unified Continuous Optimization Framework for Center-Based Clustering Methods. J. Mach. Learn. Res. 8 (2007)
Mustafa Ç. Pinar, Marc Teboulle
unit ball. RAIRO Oper. Res. 40 (3) (2006)
Amir Beck, Aharon Ben-Tal, Marc Teboulle
Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares. SIAM J. Matrix Anal. Appl. 28 (2) (2006)
Amir Beck, Marc Teboulle
A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization. Math. Oper. Res. 31 (2) (2006)
Alfred Auslender, Marc Teboulle
Interior Gradient and Proximal Methods for Convex and Conic Optimization. SIAM J. Optim. 16 (3) (2006)
Jacob Kogan, Marc Teboulle, Charles K. Nicholas
-Means Like Clustering Algorithms. Inf. Retr. 8 (2) (2005)
Alfred Auslender, Marc Teboulle
Interior projection-like methods for monotone variational inequalities. Math. Program. 104 (1) (2005)
Amir Beck, Marc Teboulle
A conditional gradient method with linear rate of convergence for solving convex linear systems. Math. Methods Oper. Res. 59 (2) (2004)
Alfred Auslender, Marc Teboulle
Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization. Math. Oper. Res. 29 (1) (2004)
Jérôme Bolte, Marc Teboulle
Barrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems. SIAM J. Control. Optim. 42 (4) (2003)
Amir Beck, Marc Teboulle
Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31 (3) (2003)
Amir Beck, Marc Teboulle
Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems. Optim. Methods Softw. 18 (4) (2003)
Alfred Auslender, Marc Teboulle
Entropic proximal decomposition methods for convex programs and variational inequalities. Math. Program. 91 (1) (2001)
Amir Beck, Marc Teboulle
A probabilistic result for the max-cut problem on random graphs. Oper. Res. Lett. 27 (5) (2000)
Alfred Auslender, Marc Teboulle
Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems. SIAM J. Optim. 10 (4) (2000)
Amir Beck, Marc Teboulle
Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints. SIAM J. Optim. 11 (1) (2000)
Alfred Auslender, Marc Teboulle, Sami Ben-Tiba
A Logarithmic-Quadratic Proximal Method for Variational Inequalities. Comput. Optim. Appl. 12 (1-3) (1999)
Alfred Auslender, Marc Teboulle, Sami Ben-Tiba
Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels. Math. Oper. Res. 24 (3) (1999)
Moshe Hershkovitz, Marc Teboulle
Sensitivity analysis for a class of robotic grasping quality functionals. Robotica 16 (2) (1998)
Moshe Doljansky, Marc Teboulle
An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming. SIAM J. Optim. 9 (1) (1998)
Marc Teboulle
Convergence of Proximal-Like Algorithms. SIAM J. Optim. 7 (4) (1997)
Moshe Hershkovitz, Uri Tasch, Marc Teboulle, Joseph Tzelgov
Experimental validation of an optimization formulation of the human grasping quality sense. J. Field Robotics 14 (11) (1997)
Aharon Ben-Tal, Marc Teboulle
Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math. Program. 72 (1996)
Aharon Ben-Tal, Marc Teboulle
A Conjugate Duality Scheme Generating a New Class of Differentiable Duals. SIAM J. Optim. 6 (3) (1996)
Roman A. Polyak, Marc Teboulle
Nonlinear rescaling and proximal-like methods in convex optimization. Math. Program. 76 (1996)
Alfredo N. Iusem, Marc Teboulle
Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming. Math. Oper. Res. 20 (3) (1995)
Moshe Hershkovitz, Uri Tasch, Marc Teboulle
Toeard a formulation of the human grasping quality sense. J. Field Robotics 12 (4) (1995)
Alfredo N. Iusem, Benar Fux Svaiter, Marc Teboulle
Entropy-Like Proximal Methods in Convex Programming. Math. Oper. Res. 19 (4) (1994)
Gong Chen, Marc Teboulle
A proximal-based decomposition method for convex minimization problems. Math. Program. 64 (1994)
Gong Chen, Marc Teboulle
Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions. SIAM J. Optim. 3 (3) (1993)
Marc Teboulle, Igor Vajda
Convergence of best phi-entropy estimates. IEEE Trans. Inf. Theory 39 (1) (1993)
Marc Teboulle
Entropic Proximal Mappings with Applications to Nonlinear Programming. Math. Oper. Res. 17 (3) (1992)
Aharon Ben-Tal, Marc Teboulle
Portfolio theory for the recourse certainty equivalent maximizing investor. Ann. Oper. Res. 31 (1) (1991)
John R. Birge, Marc Teboulle
Upper Bounds on the Expected Value of a Convex Function Using Gradient and Conjugate Function Information. Math. Oper. Res. 14 (4) (1989)
Aharon Ben-Tal, Marc Teboulle
Penalty Functions and Duality in Stochastic Programming Via ϕ-Divergence Functionals. Math. Oper. Res. 12 (2) (1987)
Aharon Ben-Tal, Marc Teboulle
Rate distortion theory with generalized information measures via convex programming duality. IEEE Trans. Inf. Theory 32 (5) (1986)