Marc Teboulle
Orcid: 0000-0002-4228-131XAffiliations:
- Tel Aviv University, School of Mathematical Sciences, Israel
According to our database1,
Marc Teboulle
authored at least 80 papers
between 1986 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on id.loc.gov
On csauthors.net:
Bibliography
2023
An elementary approach to tight worst case complexity analysis of gradient based methods.
Math. Program., 2023
2022
A Dynamic Alternating Direction of Multipliers for Nonconvex Minimization with Nonlinear Functional Equality Constraints.
J. Optim. Theory Appl., 2022
2021
SIAM J. Optim., 2021
2020
Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints.
SIAM J. Imaging Sci., 2020
Necessary conditions for linear convergence of iterated expansive, set-valued mappings.
Math. Program., 2020
Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach.
J. Optim. Theory Appl., 2020
2019
Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons.
SIAM J. Math. Data Sci., 2019
A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization.
Oper. Res. Lett., 2019
On Linear Convergence of Non-Euclidean Gradient Methods without Strong Convexity and Lipschitz Gradient Continuity.
J. Optim. Theory Appl., 2019
2018
First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems.
SIAM J. Optim., 2018
Math. Oper. Res., 2018
2017
A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications.
Math. Oper. Res., 2017
A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem.
J. Glob. Optim., 2017
2016
An Alternating Semiproximal Method for Nonconvex Regularized Structured Total Least Squares Problems.
SIAM J. Matrix Anal. Appl., 2016
A dual method for minimizing a nonsmooth objective over one smooth inequality constraint.
Math. Program., 2016
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems.
EURO J. Comput. Optim., 2016
2015
Oper. Res. Lett., 2015
2014
IEEE Trans. Control. Netw. Syst., 2014
Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization.
SIAM J. Optim., 2014
Oper. Res. Lett., 2014
Math. Program., 2014
Math. Program., 2014
2013
Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint.
SIAM Rev., 2013
2012
A new semidefinite programming relaxation scheme for a class of quadratic matrix problems.
Oper. Res. Lett., 2012
2011
Conditional Gradient Algorithms for Rank-One Matrix Approximations with a Sparsity Constraint
CoRR, 2011
A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems.
Proceedings of the Fixed-Point Algorithms for Inverse Problems in Science and Engineering, 2011
2010
A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems.
SIAM J. Optim., 2010
Gradient-based algorithms with applications to signal-recovery problems.
Proceedings of the Convex Optimization in Signal Processing and Communications., 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems.
IEEE Trans. Image Process., 2009
SIAM J. Imaging Sci., 2009
A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid.
Math. Program., 2009
Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities.
Math. Program., 2009
Foreword: Special issue on nonlinear convex optimization and variational inequalities.
Math. Program., 2009
A fast Iterative Shrinkage-Thresholding Algorithm with application to wavelet-based image deblurring.
Proceedings of the IEEE International Conference on Acoustics, 2009
2008
IEEE Trans. Signal Process., 2008
SIAM J. Optim., 2008
2007
J. Mach. Learn. Res., 2007
Comput. Optim. Appl., 2007
2006
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., 2006
SIAM J. Optim., 2006
On semidefinite bounds for maximization of a non-convex quadratic objective over the <i>l<sub>1</sub> </i> unit ball.
RAIRO Oper. Res., 2006
A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization.
Math. Oper. Res., 2006
Proceedings of the Grouping Multidimensional Data - Recent Advances in Clustering, 2006
2005
Math. Program., 2005
Inf. Retr., 2005
2004
Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization.
Math. Oper. Res., 2004
A conditional gradient method with linear rate of convergence for solving convex linear systems.
Math. Methods Oper. Res., 2004
2003
Barrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems.
SIAM J. Control. Optim., 2003
Oper. Res. Lett., 2003
Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems.
Optim. Methods Softw., 2003
2001
Entropic proximal decomposition methods for convex programs and variational inequalities.
Math. Program., 2001
2000
Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints.
SIAM J. Optim., 2000
Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems.
SIAM J. Optim., 2000
Oper. Res. Lett., 2000
1999
Math. Oper. Res., 1999
Comput. Optim. Appl., 1999
1998
An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming.
SIAM J. Optim., 1998
Robotica, 1998
1997
Experimental validation of an optimization formulation of the human grasping quality sense.
J. Field Robotics, 1997
1996
SIAM J. Optim., 1996
Math. Program., 1996
Math. Program., 1996
1995
Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming.
Math. Oper. Res., 1995
1994
Math. Program., 1994
1993
Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions.
SIAM J. Optim., 1993
1992
Math. Oper. Res., 1992
1991
Ann. Oper. Res., 1991
1989
Upper Bounds on the Expected Value of a Convex Function Using Gradient and Conjugate Function Information.
Math. Oper. Res., 1989
1987
Penalty Functions and Duality in Stochastic Programming Via ϕ-Divergence Functionals.
Math. Oper. Res., 1987
1986
Rate distortion theory with generalized information measures via convex programming duality.
IEEE Trans. Inf. Theory, 1986