Zobrazeno 1 - 10
of 241
pro vyhledávání: '"TEBOULLE, MARC"'
In this paper, we study convex bi-level optimization problems where both the inner and outer levels are given as a composite convex minimization. We propose the Fast Bi-level Proximal Gradient (FBi-PG) algorithm, which can be interpreted as applying
Externí odkaz:
http://arxiv.org/abs/2407.21221
Autor:
Sabach, Shoham, Teboulle, Marc
Publikováno v:
SIAM Journal on Optimization, Vol. 32, Iss. 1 (2022)
In this paper, we aim at unifying, simplifying and improving the convergence rate analysis of Lagrangian-based methods for convex optimization problems. We first introduce the notion of nice primal algorithmic map, which plays a central role in the u
Externí odkaz:
http://arxiv.org/abs/2010.14314
Publikováno v:
SIAM J. Mathematics of Data Science, 1(3), 408-445 (2019)
We present a unified treatment of the abstract problem of finding the best approximation between a cone and spheres in the image of affine transformations. Prominent instances of this problem are phase retrieval and source localization. The common ge
Externí odkaz:
http://arxiv.org/abs/1810.02893
We introduce a novel approach addressing global analysis of a difficult class of nonconvex-nonsmooth optimization problems within the important framework of Lagrangian-based methods. This genuine nonlinear class captures many problems in modern dispa
Externí odkaz:
http://arxiv.org/abs/1801.03013
We focus on nonconvex and nonsmooth minimization problems with a composite objective, where the differentiable part of the objective is freed from the usual and restrictive global Lipschitz gradient continuity assumption. This longstanding smoothness
Externí odkaz:
http://arxiv.org/abs/1706.06461
Publikováno v:
Mathematical Programming A 180(1), 1-31 (2020)
We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point sequences im
Externí odkaz:
http://arxiv.org/abs/1704.08926
Autor:
Beck, Amir, Teboulle, Marc
Publikováno v:
Journal of Optimization Theory & Applications; Dec2024, Vol. 203 Issue 3, p2307-2327, 21p
Autor:
Teboulle, Marc1 (AUTHOR) teboulle@tauex.tau.ac.il, Vaisbourd, Yakov2 (AUTHOR)
Publikováno v:
Mathematical Programming. Sep2023, Vol. 201 Issue 1/2, p63-96. 34p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Drori, Yoel, Teboulle, Marc
We propose a new variant of Kelley's cutting-plane method for minimizing a nonsmooth convex Lipschitz-continuous function over the Euclidean space. We derive the method through a constructive approach and prove that it attains the optimal rate of con
Externí odkaz:
http://arxiv.org/abs/1409.2636