Proximal Gradient Methods for Machine Learning and Imaging
From MaRDI portal
(Redirected from Proximal Gradient Methods for Machine Learning and Imaging)
Proximal Gradient Methods for Machine Learning and Imaging
Proximal Gradient Methods for Machine Learning and Imaging
Cites work
- A Convergent Incremental Gradient Method with a Constant Step Size
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A fast dual proximal gradient algorithm for convex minimization and applications
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space
- A mathematical introduction to compressive sensing
- A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
- A note on segmenting Mann iterates
- A Stochastic Approximation Method
- An algorithm for total variation minimization and applications
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- An introduction to continuous optimization for imaging
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
- Clarke Subgradients of Stratifiable Functions
- Compositions and convex combinations of averaged nonexpansive operators
- Construction of fixed points of nonlinear mappings in Hilbert space
- Convergence analysis of a proximal Gauss-Newton method
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of stochastic proximal gradient algorithm
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex functions, monotone operators and differentiability.
- Convex functions. Constructions, characterizations and counterexamples
- Convex optimization in normed spaces. Theory, methods and examples
- Convex programming in Hilbert space
- Convexity and optimization in Banach spaces.
- Coordinate descent algorithms
- Dualization of signal recovery problems
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Efficient online and batch learning using forward backward splitting
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- From error bounds to the complexity of first-order descent methods for convex functions
- Global error bounds for piecewise convex polynomials
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 3671159 (Why is no real title available?)
- scientific article; zbMATH DE number 3694690 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 42091 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3634029 (Why is no real title available?)
- scientific article; zbMATH DE number 1376935 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- scientific article; zbMATH DE number 3313108 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3187170 (Why is no real title available?)
- scientific article; zbMATH DE number 3192366 (Why is no real title available?)
- scientific article; zbMATH DE number 3084780 (Why is no real title available?)
- scientific article; zbMATH DE number 3108780 (Why is no real title available?)
- Image recovery via total variation minimization and related problems
- Introductory lectures on convex optimization. A basic course.
- Mean Value Methods in Iteration
- Methodes itératives pour les équations et inéquations aux dérivées partielles non linéaires de type monotone. (Iteration methods for nonlinear equations and inequations with partial derivatives of monotone type)
- Monotone Operators and the Proximal Point Algorithm
- New Proximal Point Algorithms for Convex Minimization
- Nonlinear total variation based noise removal algorithms
- Nonparametric sparsity and regularization
- On perturbed proximal gradient algorithms
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the Mann Iterative Process
- Optimal convergence rates for Nesterov acceleration
- Optimization methods for large-scale machine learning
- Optimization with sparsity-inducing penalties
- Parallel coordinate descent methods for big data optimization
- Parallel random coordinate descent method for composite minimization: convergence analysis and error bounds
- Pegasos: primal estimated sub-gradient solver for SVM
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal splitting methods in signal processing
- Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
- Proximité et dualité dans un espace hilbertien
- Random block coordinate descent methods for linearly constrained optimization over networks
- Robust Stochastic Approximation Approach to Stochastic Programming
- Signal Recovery by Proximal Forward-Backward Splitting
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Stochastic dual coordinate ascent methods for regularized loss minimization
- Stochastic Estimation of the Maximum of a Regression Function
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- Support Vector Machines
- Support-vector networks
- The solution by iteration of nonlinear functional equations in Banach spaces
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Weak Sharp Minima in Mathematical Programming
- Über die Methode sukzessiver Approximationen
Cited in
(4)
This page was built for publication: Proximal Gradient Methods for Machine Learning and Imaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028165)
