Yakov Vaisbourd

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Maximum entropy on the mean and the Cramér rate function in statistical estimation and inverse problems: properties, models, and algorithms 2025 Yakov Vaisbourd
Rustum Choksi
Ariel Goodwin
Tim Hoheisel
Carola‐Bibiane Schönlieb
+ An elementary approach to tight worst case complexity analysis of gradient based methods 2022 Marc Teboulle
Yakov Vaisbourd
+ Maximum Entropy on the Mean and the Cramér Rate Function in Statistical Estimation and Inverse Problems: Properties, Models, and Algorithms 2022 Yakov Vaisbourd
Rustum Choksi
Ariel Goodwin
Tim Hoheisel
Carola‐Bibiane Schönlieb
+ Globally Solving the Trust Region Subproblem Using Simple First-Order Methods 2018 Amir Beck
Yakov Vaisbourd
+ PDF Chat First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems 2018 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 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 2017 Jérôme Bolte
Shoham Sabach
Marc Teboulle
Yakov Vaisbourd
+ PDF Chat The Sparse Principal Component Analysis Problem: Optimality Conditions and Algorithms 2016 Amir Beck
Yakov Vaisbourd
+ Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems 2015 Amir Beck
Luba Tetruashvili
Yakov Vaisbourd
Ariel Shemtov
+ The Sparse PCA Problem: Optimality Conditions and Algorithms 2015 Amir Beck
Yakov Vaisbourd
+ The Sparse Principal Component Analysis Problem: Optimality Conditions and Algorithms 2015 Amir Beck
Yakov Vaisbourd
+ The Sparse Principal Component Analysis Problem: Optimality Conditions and Algorithms 2015 Amir Beck
Yakov Vaisbourd
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint 2013 Ronny Luss
Marc Teboulle
6
+ PDF Chat Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms 2013 Amir Beck
Yonina C. Eldar
5
+ PDF Chat Proximité et dualité dans un espace hilbertien 1965 Jean Jacques Moreau
3
+ PDF Chat A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications 2016 Heinz H. Bauschke
Jérôme Bolte
Marc Teboulle
3
+ Loading and correlations in the interpretation of principle compenents 1995 Jorge Cadima
Ian T. Jolliffe
3
+ Proximal alternating linearized minimization for nonconvex and nonsmooth problems 2013 Jérôme Bolte
Shoham Sabach
Marc Teboulle
3
+ First-Order Methods in Optimization 2017 Amir Beck
3
+ The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming 1967 L.M. Bregman
3
+ Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods 2011 Hédy Attouch
Jérôme Bolte
B. F. Svaiter
3
+ Signal Recovery by Proximal Forward-Backward Splitting 2005 Patrick L. Combettes
Valérie R. Wajs
3
+ Generalized power method for sparse principal component analysis 2008 Michel Journée
Yurii Nesterov
Peter Richtárik
Rodolphe Sepulchre
3
+ A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems 2009 Amir Beck
Marc Teboulle
3
+ Regression Shrinkage and Selection Via the Lasso 1996 Robert Tibshirani
3
+ PDF Chat Identifying small mean-reverting portfolios 2010 Alexandre d’Aspremont
3
+ Interior Gradient and Proximal Methods for Convex and Conic Optimization 2006 A. Auslender
Marc Teboulle
3
+ PDF Chat A majorization-minimization approach to the sparse generalized eigenvalue problem 2010 Bharath K. Sriperumbudur
David A. Torres
Gert Lanckriet
3
+ On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms 2015 Amir Beck
Nadav Hallak
2
+ The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems 2007 Jérôme Bolte
Aris Daniilidis
Adrian S. Lewis
2
+ PDF Chat Forward-Backward Splitting with Bregman Distances 2017 Quang Van Nguyen
2
+ Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming 1993 Jonathan Eckstein
2
+ Entropic Proximal Mappings with Applications to Nonlinear Programming 1992 Marc Teboulle
2
+ Principal Component Analysis 2005 Ian T. Jolliffe
2
+ PDF Chat A Direct Formulation for Sparse PCA Using Semidefinite Programming 2007 Alexandre d’Aspremont
Laurent El Ghaoui
Michael I. Jordan
Gert Lanckriet
2
+ PDF Chat A Modified Principal Component Technique Based on the LASSO 2003 Ian T. Jolliffe
Nickolay T. Trendafilov
Mudassir Uddin
2
+ Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions 1993 Gong Chen
Marc Teboulle
2
+ PDF Chat On the convergence of the proximal algorithm for nonsmooth functions involving analytic features 2007 Hédy Attouch
Jérôme Bolte
2
+ PDF Chat Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity 2009 Jérôme Bolte
Aris Daniilidis
Olivier Ley
Laurent Mazet
2
+ Proximal minimization algorithm withD-functions 1992 Yair Censor
Stavros A. Zenios
2
+ PDF Chat A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem 2001 Marielba Rojas
Sandra A. Santos
Danny C. Sorensen
1
+ PDF Chat Solving the Trust-Region Subproblem using the Lanczos Method 1999 Nicholas I. M. Gould
Stefano Lucidi
Massimo Roma
Philippe L. Toint
1
+ PDF Chat Incremental proximal methods for large scale convex optimization 2011 Dimitri P. Bertsekas
1
+ PDF Chat Computing a Trust Region Step 1983 Jorge J. Morè
D. C. Sorensen
1
+ Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint 1997 D. C. Sorensen
1
+ A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space 1998 Regina S. Burachik
Alfredo N. Iusem
1
+ On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes 2015 Amir Beck
1
+ A fast dual proximal gradient algorithm for convex minimization and applications 2013 Amir Beck
Marc Teboulle
1
+ Hidden convexity in some nonconvex quadratically constrained quadratic programming 1996 Aharon Ben‐Tal
Marc Teboulle
1
+ Iterative Solution of Nonlinear Equations in Several Variables 2000 J. M. Ortega
Werner C. Rheinboldt
1
+ PDF Chat A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging 2010 Antonin Chambolle
Thomas Pock
1
+ Error bounds and convergence analysis of feasible descent methods: a general approach 1993 Zhi-Quan Luo
Paul Tseng
1
+ PDF Chat Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems 2012 Yu. Nesterov
1
+ PDF Chat Accelerating the LSTRS Algorithm 2011 Jörg Lampe
M. Rojas
D. C. Sorensen
Heinrich Voß
1
+ On the Convergence of the Proximal Point Algorithm for Convex Minimization 1991 Osman Güler
1
+ PDF Chat Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function 2012 Peter Richtárik
Martin Takáč
1
+ Principal Component Analysis 1988 Colin Goodall
Ian T. Jolliffe
1
+ Iterative Methods for Finding a Trust-region Step 2009 Jennifer B. Erway
Philip E. Gill
Joshua Griffin
1
+ PDF Chat On the ergodic convergence rates of a first-order primal–dual algorithm 2015 Antonin Chambolle
Thomas Pock
1
+ Gradient-based algorithms with applications to signal-recovery problems 2009 Amir Beck
Marc Teboulle
1
+ Global convergence of a proximal linearized algorithm for difference of convex functions 2015 João Carlos O. Souza
Paulo Roberto Oliveira
Antoine Soubeyran
1
+ PDF Chat A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants 2017 Nam Ho-Nguyen
Fatma Kılınç-Karzan
1