Fetching the paper…
Reading the bibliography…
The goal of this paper is to promote the use of fixed point strategies in data science by showing that they provide a simplifying and unifying framework to model, analyze, and solve a great variety of problems.
1908
Earlier work this paper cites.
1912
Earlier work this paper cites.
S. Kaczmarz, Angenäherte Auflösung von Systemen linearer Gleichungen, Bull. Acad. Sci. Pologne,
1937
Earlier work this paper cites.
G. Cimmino, Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari, La Ricerca Scientifica (Roma)
1938
Earlier work this paper cites.
J. Nash, Non-cooperative games, Ann. Math
1951
Earlier work this paper cites.
W. Cheney and A. A. Goldstein, Proximity maps for convex sets, Proc. Amer. Math. Soc
1959
Earlier work this paper cites.
H. M. Wagner, Linear programming techniques for regression analysis, J. Amer. Stat. Assoc
1959
Earlier work this paper cites.
H. J. Landau and W. L. Miranker, The recovery of distorted band-limited signals, J. Math. Anal. Appl
1961
Earlier work this paper cites.
G. J. Minty, Monotone (nonlinear) operators in Hilbert space, Duke Math. J
1962
Earlier work this paper cites.
J. J. Moreau, Fonctions convexes duales et points proximaux dans un espace hilbertien, C. R. Acad. Sci. Paris
1962
Earlier work this paper cites.
A. A. Goldstein, Convex programming in Hilbert space, Bull. Amer. Math. Soc
1964
Earlier work this paper cites.
L. M. Brègman, The method of successive projection for finding a common point of convex sets, Soviet Math. – Doklady,
1965
Earlier work this paper cites.
I. I. Eremin, Generalization of the relaxation method of Motzkin-Agmon, Uspekhi Mat. Nauk
1965
Earlier work this paper cites.
S. Twomey, The application of numerical filtering to the solution of integral equations encountered in indirect sensing measurements, J. Franklin Inst
1965
Earlier work this paper cites.
Yu. M. Ermol’ev and Z. V. Nekrylova, Some methods of stochastic optimization, Kibernetika (Kiev)
1966
Earlier work this paper cites.
E. S. Levitin and B. T. Polyak, Convergence of minimizing sequences in conditional extremum problems, Soviet Math. Dokl
1966
Earlier work this paper cites.
L. M. Brègman, The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming, USSR Comput. Math. Math. Phys
1967
Earlier work this paper cites.
L. G. Gubin, B. T. Polyak, and E. V. Raik, The method of projections for finding the common point of convex sets, Comput. Math. Math. Phys
1967
Earlier work this paper cites.
Yu. M. Ermol’ev, On the method of generalized stochastic gradients and quasi-Fejér sequences, Cybernetics
1969
Earlier work this paper cites.
B. R. Hunt, The inverse problem of radiography, Math. Biosciences,
1970
Earlier work this paper cites.
R. T. Rockafellar, Convex Analysis
1970
Earlier work this paper cites.
B. Martinet, Algorithmes pour la Résolution de Problèmes d’Optimisation et de Minimax
1972
Earlier work this paper cites.
G. T. Herman, A. Lent, and S. W. Rowland, ART: Mathematics and applications, J. Theor. Biology
1973
Earlier work this paper cites.
J.-B. Baillon, R. E. Bruck, and S. Reich, On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces, Houston J. Math
1978
Earlier work this paper cites.
R. G. Wiley, On an iterative technique for recovery of bandlimited signals, Proc. IEEE
1978
Earlier work this paper cites.
D. C. Youla, Generalized image restoration by the method of alternating orthogonal projections, IEEE Trans. Circuits Syst
1978
Earlier work this paper cites.
E. Artzy, T. Elfving, and G. T. Herman, Quadratic optimization for image reconstruction II, Comput. Graph. Image Process
1979
Earlier work this paper cites.
P.-L. Lions and B. Mercier, Splitting algorithms for the sum of two nonlinear operators, SIAM J. Numer. Anal
1979
Earlier work this paper cites.
B. Mercier, Lectures on Topics in Finite Element Solution of Elliptic Problems
1979
Earlier work this paper cites.
R. W. Schafer, R. M. Mersereau, and M. A. Richards, Constrained iterative restoration algorithms, Proc. IEEE
1981
Earlier work this paper cites.
V. Tom, T. Quatieri, M. Hayes, and J. McClellan, Convergence of iterative nonexpansive signal reconstruction algorithms, IEEE Trans. Acoust. Speech Signal Process
1981
Earlier work this paper cites.
D. C. Youla and H. Webb, Image restoration by the method of convex projections: Part 1 – theory, IEEE Trans. Med. Imaging
1982
Earlier work this paper cites.
D. Gabay, Applications of the method of multipliers to variational inequalities, in: M. Fortin and R. Glowinski (Eds.), Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary Value Problems,
1983
Earlier work this paper cites.
J. E. Spingarn, Partial inverse of a monotone operator, Appl. Math. Optim
1983
Earlier work this paper cites.
G. Pierra, Decomposition through formalization in a product space, Math. Program
1984
Earlier work this paper cites.
H. J. Trussell and M. R. Civanlar, The feasible solution in signal restoration, IEEE Trans. Acoust. Speech Signal Process
1984
Earlier work this paper cites.
D. C. Youla and V. Velasco, Extensions of a result on the synthesis of signals in the presence of inconsistent constraints, IEEE Trans. Circuits Syst
1986
Earlier work this paper cites.
G. Cohen, Nash equilibria: Gradient and decomposition algorithms, Large Scale Syst
1987
Earlier work this paper cites.
E. G. Gol’shtein, A general approach to decomposition of optimization systems, Sov. J. Comput. Syst. Sci
1987
Earlier work this paper cites.
H. Stark (Ed.), Image Recovery: Theory and Application
1987
Earlier work this paper cites.
R. Glowinski and P. Le Tallec (Eds.), Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics
1989
Earlier work this paper cites.
C. P. Mariadassou and B. Yegnanarayana, Image reconstruction from noisy digital holograms, IEE Proceedings-F
1990
Earlier work this paper cites.
Y. Censor and S. A. Zenios, Proximal minimization algorithm with D D -functions, J. Optim. Theory Appl
1992
Earlier work this paper cites.
J. Eckstein and D. P. Bertsekas, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Math. Program
1992
Earlier work this paper cites.
M. Teboulle, Entropic proximal mappings with applications to nonlinear programming, Math. Oper. Res
1992
Earlier work this paper cites.
P. L. Combettes, The foundations of set theoretic estimation, Proc. IEEE
1993
Earlier work this paper cites.
J. Eckstein, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res
1993
Earlier work this paper cites.
L. C. Potter and K. S. Arun, A dual approach to linear inverse problems with convex constraints, SIAM J. Control Optim
1993
Earlier work this paper cites.
Y. Censor and T. Elfving, A multiprojection algorithm using Bregman projections in a product space, Numer. Algorithms
1994
Earlier work this paper cites.
P. L. Combettes, Inconsistent signal feasibility problems: Least-squares solutions in a product space, IEEE Trans. Signal Process
1994
Earlier work this paper cites.
J. Eckstein, Parallel alternating direction multiplier decomposition of convex programs, J. Optim. Theory Appl
1994
Earlier work this paper cites.
H. H. Bauschke and J. M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Rev
1996
Earlier work this paper cites.
P. L. Combettes, The convex feasibility problem in image recovery, in: Advances in Imaging and Electron Physics
1996
Earlier work this paper cites.
B. Lemaire, Stability of the iteration method for nonexpansive mappings, Serdica Math. J
1996
Earlier work this paper cites.
H. H. Bauschke and J. M. Borwein, Legendre functions and the method of random Bregman projections, J. Convex Anal
1997
Earlier work this paper cites.
Y. Censor and S. A. Zenios, Parallel Optimization – Theory, Algorithms and Applications
1997
Earlier work this paper cites.
P. L. Combettes, Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections, IEEE Trans. Image Process
1997
Earlier work this paper cites.
K. C. Kiwiel and B. Łopuch, Surrogate projection methods for finding fixed points of firmly nonexpansive mappings, SIAM J. Optim
1997
Earlier work this paper cites.
R. Zhang and L. Guo, Controllability of stochastic game-based control systems, SIAM J. Control Optim
1999
Earlier work this paper cites.
P. L. Combettes, Strong convergence of block-iterative outer approximation methods for convex optimization, SIAM J. Control Optim
2000
Earlier work this paper cites.
P. Tseng, A modified forward-backward splitting method for maximal monotone mappings, SIAM J. Control Optim
2000
Earlier work this paper cites.
G. L. Zeng and G. T. Gullberg, Unmatched projector/backprojector pairs in an iterative reconstruction algorithm, IEEE Trans. Med. Imaging
2000
Earlier work this paper cites.
C. Byrne and Y. Censor, Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback-Leibler distance minimization, Ann. Oper. Res
2001
Earlier work this paper cites.
I. Yamada, The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings, in: Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications
2001
Earlier work this paper cites.
C. Byrne, Iterative oblique projection onto convex sets and the split feasibility problem, Inverse Problems
2002
Earlier work this paper cites.
2002
Earlier work this paper cites.
H. H. Bauschke, J. M. Borwein, and P. L. Combettes, Bregman monotone optimization algorithms, SIAM J. Control Optim
2003
Earlier work this paper cites.
P. L. Combettes, A block-iterative surrogate constraint splitting method for quadratic signal recovery, IEEE Trans. Signal Process
2003
Earlier work this paper cites.
D. L. Donoho and M. Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 \ell^{1} minimization, Proc. Nat. Acad. Sci
2003
Earlier work this paper cites.
P. L. Combettes, Solving monotone inclusions via compositions of nonexpansive averaged operators, Optimization
2004
Earlier work this paper cites.
I. Daubechies, M. Defrise, and C. De Mol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Comm. Pure Appl. Math
2004
Earlier work this paper cites.
C. De Mol and M. Defrise, Inverse imaging with mixed penalties, ULB Institutional Repository
2004
Earlier work this paper cites.
2004
Earlier work this paper cites.
J.-F. Aujol, G. Aubert, L. Blanc-Féraud, and A. Chambolle, Image decomposition into a bounded variation component and an oscillating component, J. Math. Imaging Vision,
2005
Earlier work this paper cites.
Y. Censor, T. Elfving, N. Kopf, and T. Bortfeld, The multiple-sets split feasibility problem and its applications for inverse problems, Inverse Problems
2005
Earlier work this paper cites.
P. L. Combettes and V. R. Wajs, Signal recovery by proximal forward-backward splitting, Multiscale Model. Simul
2005
Earlier work this paper cites.
J.-F. Giovannelli and A. Coulais, Positive deconvolution for superimposed extended source and point sources, Astron. Astrophys
2005
Earlier work this paper cites.
J.-F. Aujol, G. Gilboa, T. Chan, and S. Osher, Structure-texture image decomposition – modeling, algorithms, and parameter selection. Int. J. Comput. Vision,
2006
Earlier work this paper cites.
H. H. Bauschke, P. L. Combettes, and S. G. Kruk, Extrapolation algorithm for affine-convex feasibility problems, Numer. Algorithms,
2006
Earlier work this paper cites.
S. A. Hirstoaga, Iterative selection methods for common fixed point problems, J. Math. Anal. Appl
2006
Earlier work this paper cites.
M. Yuan and Y. Lin, Model selection and estimation in regression with grouped variables, J. Roy. Stat. Soc
2006
Earlier work this paper cites.
J. M. Bioucas-Dias and M. A. T. Figueiredo, A new TwIST: Two-step iterative shrinkage/thresholding algorithms for image restoration, IEEE Trans. Image Process
2007
Earlier work this paper cites.
P. L. Combettes and J.-C. Pesquet, A Douglas-Rachford splitting approach to nonsmooth convex variational signal recovery, IEEE J. Select. Topics Signal Process
2007
Cited alongside, same era.
J. Friedman, T. Hastie, and R. Tibshirani, Sparse inverse covariance estimation with the graphical lasso, Biostatistics
2008
Cited alongside, same era.
H. H. Bauschke, F. Deutsch, and H. Hundal, Characterizing arbitrarily slow convergence in the method of alternating projections, Int. Trans. Oper. Res
2009
Cited alongside, same era.
A. Beck and M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems, SIAM J. Imaging Sci
2009
Cited alongside, same era.
L. M. Briceño-Arias and P. L. Combettes, Convex variational formulation with smooth coupling for multicomponent signal decomposition and recovery, Numer. Math. Theory Methods Appl
P. L. Combettes and Q. V. Nguyen, Solving composite monotone inclusions in reflexive Banach spaces by constructing best Bregman approximations from their Kuhn-Tucker set, J. Convex Anal
2016
Later among the works it cites.
P. L. Combettes and J.-C. Pesquet, Stochastic approximations and perturbations in forward-backward splitting for monotone operators, Pure Appl. Funct. Anal
2016
Later among the works it cites.
R. Glowinski, S. J. Osher, and W. Yin (Eds.), Splitting Methods in Communication, Imaging, Science, and Engineering
2016
Later among the works it cites.
A. M. McDonald, M. Pontil, and D. Stamos, New perspectives on k k -support and cluster norms, J. Machine Learn. Res
2016
Later among the works it cites.
I. Necoara and D. Clipici, Parallel random coordinate descent method for composite minimization: Convergence analysis and error bounds, SIAM J. Optim
2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2009
Cited alongside, same era.
E. J. Candès and B. Recht, Exact matrix completion via convex optimization, Found. Comput. Math
2009
Cited alongside, same era.
P. L. Combettes, Fejér-monotonicity in convex optimization, in: Encyclopedia of Optimization
2009
Cited alongside, same era.
T. Goldstein and S. Osher, The split Bregman method for L1-regularized problems, SIAM J. Imaging Sci
2009
Cited alongside, same era.
T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning
2009
Cited alongside, same era.
G. T. Herman, Fundamentals of Computerized Tomography: Image Reconstruction from Projections
2009
Cited alongside, same era.
L. Jacob, G. Obozinski, and J.-Ph. Vert, Group lasso with overlap and graph lasso, Proc. Int. Conf. Machine Learn
2009
Cited alongside, same era.
M. V. Afonso, J. M. Bioucas-Dias, and M. A. T. Figueiredo, Fast image recovery using variable splitting and constrained optimization, IEEE Trans. Image Process
2010
Cited alongside, same era.
Later among the works it cites.
P. Richtárik and M. Takáč, On optimal probabilities in stochastic coordinate descent methods, Optim. Lett
2016
Later among the works it cites.
A. Rond, R. Giryes, and M. Elad, Poisson inverse problems by the plug-and-play scheme, J. Vis. Commun. Image Repres
2016
Later among the works it cites.
L. Rosasco, S. Villa, and B. C. Vũ, A stochastic inertial forward-backward splitting algorithm for multivariate monotone inclusions, Optimization
2016
Later among the works it cites.
Y. Yang, J. Sun, H. Li, and Z. Xu, Deep ADMM-Net for compressive sensing MRI, Proc. Adv. Neural Inform. Process. Syst. Conf
2016
Later among the works it cites.
Y. F. Atchadé, G. Fort, and E. Moulines, On perturbed proximal gradient algorithms, J. Machine Learn. Res
2017
Later among the works it cites.
H. H. Bauschke, J. Bolte, and M. Teboulle, A descent lemma beyond Lipschitz gradient continuity: First-order methods revisited and applications, Math. Oper. Res
2017
Later among the works it cites.
S. H. Chan, X. Wang, and O. A. Elgendy, Plug-and-play ADMM for image restoration: Fixed-point convergence and applications, IEEE Trans. Comput. Imaging
2017
Later among the works it cites.
P. L. Combettes and L. E. Glaudin, Quasinonexpansive iterations on the affine hull of orbits: From Mann’s mean value algorithm to inertial methods, SIAM J. Optim
2017
Later among the works it cites.
D. Davis and W. Yin, A three-operator splitting scheme and its optimization applications, Set-Valued Var. Anal
2017
Later among the works it cites.
E. Ndiaye, O. Fercoq, A. Gramfort, and J. Salmon, Gap safe screening rules for sparsity enforcing penalties, J. Machine Learn. Res
2017
Later among the works it cites.
Q. V. Nguyen, Forward-backward splitting with Bregman distances, Vietnam J. Math
2017
Later among the works it cites.
S. Ono, Primal-dual plug-and-play image restoration, IEEE Signal Process. Lett
2017
Later among the works it cites.
M. Schmidt, N. Le Roux, and F. Bach, Minimizing finite sums with the stochastic average gradient, Math. Program
2017
Later among the works it cites.
Y. Yu, J. Peng, X. Han, and A. Cui, A primal Douglas–Rachford splitting method for the constrained minimization problem in compressive sensing, Circuits Syst. Signal Process
2017
Later among the works it cites.
G. Belgioioso and S. Grammatico, A Douglas-Rachford splitting for semi-decentralized equilibrium seeking in generalized aggregative games, Proc. IEEE Conf. Decision Control
2018
Later among the works it cites.
M. Bravo, D. Leslie, and P. Mertikopoulos, Bandit learning in concave N N -person games, Proc. Adv. Neural Inform. Process. Syst. Conf
2018
Later among the works it cites.
L. M. Briceño-Arias and D. Davis, Forward-backward-half forward algorithm for solving monotone inclusions, SIAM J. Optim
2018
Later among the works it cites.
G. T. Buzzard, S. H. Chan, S. Sreehari, and C. A. Bouman, Plug-and-play unplugged: Optimization-free reconstruction using consensus equilibrium, SIAM J. Imaging Sci
2018
Later among the works it cites.
Y. Censor and M. Zaknoon, Algorithms and convergence results of projection methods for inconsistent feasibility problems: A review, Pure Appl. Funct. Anal
2018
Later among the works it cites.
L. Chizat, G. Peyré, B. Schmitzer, and F.-X. Vialard, An interpolating distance between optimal transport and Fisher-Rao metrics, Found. Comput. Math
2018
Later among the works it cites.
P. L. Combettes, Monotone operator theory in convex optimization, Math. Program
2018
Later among the works it cites.
P. L. Combettes and J. Eckstein, Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions, Math. Program
2018
Later among the works it cites.
D. A. Lorenz, S. Rose, and F. Schöpfer, The randomized Kaczmarz method with mismatched adjoint, Bit. Numer. Math
2018
Later among the works it cites.
A. Mokhtari, M. Gürbüzbalaban, and A. Ribeiro, Surpassing gradient descent provably: A cyclic incremental method with linear convergence rate, SIAM J. Optim
2018
Later among the works it cites.
K. Scaman and A. Virmaux, Lipschitz regularity of deep neural networks: Analysis and efficient estimation, Proc. Adv. Neural Inform. Process. Syst. Conf
2018
Later among the works it cites.
N. Vaswani, Y. Chi, and T. Bouwmans, Rethinking PCA for modern data sets: Theory, algorithms, and applications, Proc. IEEE
2018
Later among the works it cites.
M. Yan, A new primal-dual algorithm for minimizing the sum of three functions with a linear operator, J. Sci. Comput
2018
Later among the works it cites.
J. Zhang and B. Ghanem, ISTA-Net: Interpretable optimization-inspired deep network for image compressive sensing, Proc. IEEE Conf. Comput. Vis. Pattern Recognit
2018
Later among the works it cites.
H. Attouch and A. Cabot, Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions, Appl. Math. Optim
2019
Later among the works it cites.
H. H. Bauschke and P. L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces
2019
Later among the works it cites.
L. M. Briceño-Arias, G. Chierchia, E. Chouzenoux, and J.-C. Pesquet, A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression, Comput. Optim. Appl
2019
Later among the works it cites.
P. L. Combettes and L. E. Glaudin, Proximal activation of smooth functions in splitting algorithms for convex image recovery, SIAM J. Imaging Sci
2019
Later among the works it cites.
P. L. Combettes, A. M. McDonald, C. A. Micchelli, and M. Pontil, Learning with optimal interpolation norms, Numer. Algorithms
2019
Later among the works it cites.
P. L. Combettes and J.-C. Pesquet, Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping II: Mean-square and linear convergence, Math. Program
2019
Later among the works it cites.
P. Dasgupta and J. B. Collins, A survey of game theoretic approaches for adversarial machine learning in cybersecurity tasks, AI Magazine
2019
Later among the works it cites.
Y. Dong, P. C. Hansen, M. E. Hochstenbach, and N. A. Brogaard Riis, Fixing nonconvergence of algebraic iterative reconstruction with an unmatched backprojector, SIAM J. Sci. Comput
2019
Later among the works it cites.
R. Laraki, J. Renault, and S. Sorin, Mathematical Foundations of Game Theory
2019
Later among the works it cites.
H. Raguet, A note on the forward-Douglas-Rachford splitting for monotone inclusion and convex optimization, Optim. Lett
2019
Later among the works it cites.
A Repetti, M. Pereyra, and Y. Wiaux, Scalable Bayesian uncertainty quantification in imaging inverse problems via convex optimization, SIAM J. Imaging Sci
2019
Later among the works it cites.
E. K. Ryu, J. Liu, S. Wang, X. Chen, Z. Wang, and W. Yin, Plug-and-play methods provably converge with properly trained denoisers, Proc. Int. Conf. Machine Learn
2019
Later among the works it cites.
Y. Sun, B. Wohlberg, and U. S. Kamilov, An online plug-and-play algorithm for regularized image reconstruction, IEEE Trans. Comput. Imaging
2019
Later among the works it cites.
A. M. Teodoro, J. M. Bioucas-Dias, and M. A. T. Figueiredo, A convergent image fusion algorithm using scene-adapted Gaussian-mixture-based denoising, IEEE Trans. Image Process
2019
Later among the works it cites.
P. Yi and L. Pavel, Distributed generalized Nash equilibria computation of monotone games via double-layer preconditioned proximal-point algorithms, IEEE Trans. Control. Netw. Syst
2019
Later among the works it cites.
P. Yi and L. Pavel, An operator splitting approach for distributed generalized Nash equilibria computation, Automatica
2019
Later among the works it cites.
J. Abe, M. Yamagishi, and I. Yamada, Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition, Inverse Problems
2020
Closest in time.
V. Apidopoulos, J.-F. Aujol, and C. Dossal, Convergence rate of inertial forward-backward algorithm beyond Nesterov’s rule, Math. Program
2020
Closest in time.
S. Banert, R. I. Boţ, and E. R. Csetnek, Fixing and extending some recent results on the ADMM algorithm, Numer. Algorithms
2020
Closest in time.
S. Banert, A. Ringh, J. Adler, J. Karlsson, and O. Öktem, Data-driven nonsmooth optimization, SIAM J. Optim
2020
Closest in time.
G. Belgioioso, A. Nedich, and S. Grammatico, Distributed generalized Nash equilibrium seeking in aggregative games on time-varying networks, IEEE Trans. Automat. Control
2020
Closest in time.
A. Benfenati, E. Chouzenoux, and J.-C. Pesquet, Proximal approaches for matrix optimization problems: Application to robust precision matrix estimation, Signal Process
2020
Closest in time.
C. Bertocchi, E. Chouzenoux, M.-C. Corbineau, J.-C. Pesquet, and M. Prato, Deep unfolding of a proximal interior point method for image restoration, Inverse Problems
2020
Closest in time.
M. N. Bùi and P. L. Combettes, Warped proximal iterations for monotone inclusions, J. Math. Anal. Appl
2020
Closest in time.
M. N. Bùi and P. L. Combettes, Bregman forward-backward operator splitting, Set-Valued Var. Anal
2020
Closest in time.
E. Chouzenoux, M.-C. Corbineau, and J.-C. Pesquet, A proximal interior point algorithm with applications to image processing, J. Math. Imaging Vision
2020
Closest in time.
P. L. Combettes and C. L. Müller, Perspective maximum likelihood-type estimation via proximal decomposition, Electron. J. Stat
2020
Closest in time.
P. L. Combettes and J.-C. Pesquet, Deep neural network structures solving variational inequalities, Set-Valued Var. Anal
2020
Closest in time.
P. L. Combettes and J.-C. Pesquet, Lipschitz certificates for layered network structures driven by averaged activation operators, SIAM J. Math. Data Sci
2020
Closest in time.
J. Darbon and T. Meng, On decomposition models in imaging sciences and multi-time Hamilton–Jacobi partial differential equations, SIAM J. Imaging Sci
2020
Closest in time.
M. Hasannasab, J. Hertrich, S. Neumayer, G. Plonka, S. Setzer, and G. Steidl, Parseval proximal neural networks, J. Fourier Anal. Appl
2020
Closest in time.
X. Huang, E. K. Ryu, and W. Yin, Tight coefficients of averaged operators via scaled relative graph, J. Math. Anal. Appl
2020
Closest in time.
P. R. Johnstone and J. Eckstein, Projective splitting with forward steps, Math. Program
2020
Closest in time.
F. Latorre, P. T. Rolland, and V. Cevher, Lipschitz constant estimation of neural networks via sparse polynomial optimization, Proc. Int. Conf. Learn. Represent
2020
Closest in time.
S. B. Lindstrom and B. Sims, Survey: Sixty years of Douglas–Rachford, J. Aust. Math. Soc
2020
Closest in time.
K. Mishchenko, F. Iutzeler, and J. Malick, A distributed flexible delay-tolerant proximal gradient algorithm, SIAM J. Optim
2020
Closest in time.
L. Rosasco, S. Villa, and B. C. Vũ, Convergence of stochastic proximal gradient algorithm, Appl. Math. Optim
2020
Closest in time.
E. K. Ryu, Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting, Math. Program
2020
Closest in time.
I. Selesnick, A. Lanza, S. Morigi, and F. Sgallari, Non-convex total variation regularization for convex denoising of signals, J. Math. Imaging Vision
2020
Closest in time.
S. Theodoridis, Machine Learning: A Bayesian and Optimization Perspective
2020
Closest in time.
X. Xu, Y. Sun, J. Liu, B. Wohlberg, and U. S. Kamilov, Provable convergence of plug-and-play priors with MMSE denoisers, IEEE Signal Process. Lett
2020
Closest in time.
2021
Closest in time.
E. Chouzenoux, J.-C. Pesquet, C. Riddell, M. Savanier, and Y. Trousset, Convergence of proximal gradient algorithm in the presence of adjoint mismatch, Inverse Problems
2021
Closest in time.
P. L. Combettes and L. E. Glaudin, Solving composite fixed point problems with block updates, Adv. Nonlinear Anal
2021
Closest in time.
P. L. Combettes and Z. C. Woodstock, A fixed point framework for recovering signals from nonlinear transformations, Proc. Europ. Signal Process. Conf
2021
Closest in time.
2021
Closest in time.
P. R. Johnstone and J. Eckstein, Single-forward-step projective splitting: Exploiting cocoercivity, Comput. Optim. Appl
2021
Closest in time.
V. Monga, Y. Li, and Y. C. Eldar, Algorithm unrolling: Interpretable, efficient deep learning for signal and image processing, IEEE Signal Process. Mag
2021
Closest in time.
N. T. Thao and D. Rzepka, Time encoding of bandlimited signals: Reconstruction by pseudo-inversion and time-varying multiplierless FIR filtering, IEEE Trans. Signal Process
2021
Closest in time.