Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 339
Marc Teboulle - MaRDI portal

Marc Teboulle

From MaRDI portal
(Redirected from Person:403665)
Person:170029

Available identifiers

zbMath Open teboulle.marcDBLP54/6347WikidataQ102196401 ScholiaQ102196401MaRDI QIDQ170029

List of research outcomes

PublicationDate of PublicationType
A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis2024-05-06Paper
An Adaptive Lagrangian-Based Scheme for Nonconvex Composite Optimization2024-03-01Paper
An elementary approach to tight worst case complexity analysis of gradient based methods2023-08-01Paper
A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints2022-05-17Paper
Faster Lagrangian-Based Methods in Convex Optimization2022-03-15Paper
Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons2022-02-03Paper
Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems2021-07-20Paper
https://portal.mardi4nfdi.de/entity/Q51462432021-01-25Paper
Finding second-order stationary points in constrained minimization: a feasible direction approach2020-08-25Paper
Lagrangian methods for composite optimization2020-07-10Paper
Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints2020-05-04Paper
Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence2020-03-12Paper
Necessary conditions for linear convergence of iterated expansive, set-valued mappings2020-02-20Paper
A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization2020-02-10Paper
On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity2019-09-04Paper
A simple algorithm for a class of nonsmooth convex-concave saddle-point problems2018-10-01Paper
A fast dual proximal gradient algorithm for convex minimization and applications2018-08-27Paper
First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems2018-08-03Paper
A simplified view of first order methods for optimization2018-07-13Paper
A Minimax Chebyshev Estimator for Bounded Error Estimation2018-06-27Paper
A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem2017-12-14Paper
Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems2017-10-09Paper
An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems2017-09-21Paper
A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications2017-06-02Paper
An optimal variant of Kelley's cutting-plane method2016-11-25Paper
A dual method for minimizing a nonsmooth objective over one smooth inequality constraint2016-09-16Paper
An Alternating Semiproximal Method for Nonconvex Regularized Structured Total Least Squares Problems2016-09-07Paper
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems2016-05-19Paper
Proximal alternating linearized minimization for nonconvex and nonsmooth problems2014-08-29Paper
Performance of first-order methods for smooth convex minimization: a novel approach2014-06-27Paper
Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization2014-06-19Paper
Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint2013-04-05Paper
A new semidefinite programming relaxation scheme for a class of quadratic matrix problems2012-09-18Paper
Smoothing and First Order Methods: A Unified Framework2012-09-12Paper
A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems2012-07-10Paper
https://portal.mardi4nfdi.de/entity/Q31740682011-10-12Paper
Convex approximations to sparse PCA via Lagrangian duality2011-03-22Paper
A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems2011-03-21Paper
https://portal.mardi4nfdi.de/entity/Q30796642011-03-02Paper
https://portal.mardi4nfdi.de/entity/Q30579432010-11-18Paper
Weak convergence of an iterative method for pseudomonotone variational inequalities and fixed-point problems2010-10-27Paper
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems2009-10-19Paper
Iterative Minimization Schemes for Solving the Single Source Localization Problem2009-08-20Paper
On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball2009-07-06Paper
Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities2009-05-05Paper
A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid2009-05-04Paper
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems2009-01-01Paper
A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization2008-05-27Paper
Nonmonotone projected gradient methods based on barrier and Euclidean distances2008-03-12Paper
AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT2007-11-21Paper
Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares2007-05-03Paper
Interior Gradient and Proximal Methods for Convex and Conic Optimization2006-05-30Paper
Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization2005-11-11Paper
Interior projection-like methods for monotone variational inequalities2005-10-31Paper
https://portal.mardi4nfdi.de/entity/Q53149552005-09-05Paper
Singular Riemannian barrier methods and gradient-projection dynamical systems for constrained optimization2005-04-15Paper
Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems2005-04-05Paper
A conditional gradient method with linear rate of convergence for solving convex linear systems2005-02-11Paper
Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.2005-01-11Paper
Barrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems2004-01-08Paper
Mirror descent and nonlinear projected subgradient methods for convex optimization.2003-06-17Paper
https://portal.mardi4nfdi.de/entity/Q47799702002-10-29Paper
https://portal.mardi4nfdi.de/entity/Q27680052002-04-09Paper
Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints2001-03-19Paper
Entropic proximal decomposition methods for convex programs and variational inequalities2001-01-01Paper
A probabilistic result for the max-cut problem on random graphs2001-01-01Paper
Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems2000-10-19Paper
https://portal.mardi4nfdi.de/entity/Q49457672000-09-24Paper
An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming1999-02-22Paper
A logarithmic-quadratic proximal method for variational inequalities1999-01-01Paper
Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels1999-01-01Paper
Nonlinear rescaling and proximal-like methods in convex optimization1998-03-10Paper
Experimental validation of an optimization formulation of the human grasping quality sense1998-02-19Paper
Convergence of Proximal-Like Algorithms1998-02-10Paper
A primal-dual iterative algorithm for a maximum likelihood estimation problem1997-08-31Paper
A Conjugate Duality Scheme Generating a New Class of Differentiable Duals1997-02-03Paper
Hidden convexity in some nonconvex quadratically constrained quadratic programming1996-12-08Paper
Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming1996-09-16Paper
Multiplicative Interior Gradient Methods for Minimization over the Nonnegative Orthant1996-07-16Paper
Entropy-Like Proximal Methods in Convex Programming1995-09-27Paper
Toeard a formulation of the human grasping quality sense1995-06-29Paper
Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions1995-03-15Paper
A proximal-based deomposition method for compositions method for convex minimization problems1994-08-10Paper
Applications of optimization methods to robust stability of linear systems1994-08-09Paper
On the convergence rate of entropic proximal optimization methods1994-07-26Paper
A regularized dual-based iterative method for a class of image reconstruction problems1994-03-27Paper
Convergence of best phi -entropy estimates1993-05-16Paper
Entropic Proximal Mappings with Applications to Nonlinear Programming1993-01-17Paper
Portfolio theory for the recourse certainty equivalent maximizing investor1992-06-25Paper
Certainty equivalents and information measures: Duality and extremal principles1992-06-25Paper
A geometric property of the least squares solution of linear equations1990-01-01Paper
A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming1990-01-01Paper
Entropic means1989-01-01Paper
Upper Bounds on the Expected Value of a Convex Function Using Gradient and Conjugate Function Information1989-01-01Paper
A simple Duality Proof for Quadratically Constrained Entropy Functionals and Extension to Convex Constraints1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47336811989-01-01Paper
The role of duality in optimization problems involving entropy functionals with applications to information theory1988-01-01Paper
Extension of some results for channel capacity using a generalized information measure1988-01-01Paper
A Dual Approach to Multidimensional $L_p$ Spectral Estimation Problems1988-01-01Paper
Penalty Functions and Duality in Stochastic Programming Via ϕ-Divergence Functionals1987-01-01Paper
Expected Utility, Penalty Functions, and Duality in Stochastic Nonlinear Programming1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36986471986-01-01Paper
Rate distortion theory with generalized information measures via convex programming duality1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41976391979-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Marc Teboulle