Proximal Gradient Methods for Machine Learning and Imaging (Q5028165)

scientific article; zbMATH DE number 7471339

Language	Label	Description	Also known as
English	Proximal Gradient Methods for Machine Learning and Imaging	scientific article; zbMATH DE number 7471339

Statements

instance of

scholarly article

0 references

title

Proximal Gradient Methods for Machine Learning and Imaging (English)

0 references

DOI

10.1007/978-3-030-86664-8_4

0 references

0 references

0 references

Harmonic and Applied Analysis

0 references

publication date

8 February 2022

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-86664-8_4

0 references

0 references

0 references

0 references

0 references

Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction

0 references

Q3149262

0 references

The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions

0 references

Nonlinear total variation based noise removal algorithms

0 references

Convergence of stochastic proximal gradient algorithm

0 references

Convex Analysis

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Q4773116

0 references

Parallel coordinate descent methods for big data optimization

0 references

A note on segmenting Mann iterates

0 references

An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping

0 references

On perturbed proximal gradient algorithms

0 references

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity

0 references

Optimal Convergence Rates for Nesterov Acceleration

0 references

Optimization with Sparsity-Inducing Penalties

0 references

Q3868358

0 references

Convexity and Optimization in Banach Spaces

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems

0 references

The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

0 references

A fast dual proximal gradient algorithm for convex minimization and applications

0 references

Clarke Subgradients of Stratifiable Functions

0 references

From error bounds to the complexity of first-order descent methods for convex functions

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

Q3654591

0 references

Q3994918

0 references

A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space

0 references

The solution by iteration of nonlinear functional equations in Banach spaces

0 references

Construction of fixed points of nonlinear mappings in Hilbert space

0 references

Weak Sharp Minima in Mathematical Programming

0 references

An algorithm for total variation minimization and applications

0 references

On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm''

0 references

Image recovery via total variation minimization and related problems

0 references

An introduction to continuous optimization for imaging

0 references

A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration

0 references

Proximal Splitting Methods in Signal Processing

0 references

Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping

0 references

Proximal Thresholding Algorithm for Minimization over Orthonormal Bases

0 references

Dualization of signal recovery problems

0 references

Compositions and convex combinations of averaged nonexpansive operators

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

Support-vector networks

0 references

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

0 references

On the Mann Iterative Process

0 references

Q2880998

0 references

Q4702909

0 references

Q5821624

0 references

A mathematical introduction to compressive sensing

0 references

Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates

0 references

Convex programming in Hilbert space

0 references

New Proximal Point Algorithms for Convex Minimization

0 references

A Convergent Incremental Gradient Method with a Constant Step Size

0 references

Q2753173

0 references

Q5847510

0 references

Q5576518

0 references

Error Bounds for Piecewise Convex Quadratic Programs and Applications

0 references

Global error bounds for piecewise convex polynomials

0 references

Splitting Algorithms for the Sum of Two Nonlinear Operators

0 references

Error bounds and convergence analysis of feasible descent methods: A general approach

0 references

Asymptotic Convergence Analysis of the Proximal Point Algorithm

0 references

Mean Value Methods in Iteration

0 references

0 references

0 references

0 references

0 references

Proximité et dualité dans un espace hilbertien

0 references

Nonparametric sparsity and regularization

0 references

Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds

0 references

Random block coordinate descent methods for linearly constrained optimization over networks

0 references

Robust Stochastic Approximation Approach to Stochastic Programming

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Q3320132

0 references

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems

0 references

Weak convergence of the sequence of successive approximations for nonexpansive mappings

0 references

An Iterative Regularization Method for Total Variation-Based Image Restoration

0 references

Ergodic convergence to a zero of the sum of monotone operators in Hilbert space

0 references

Convex Optimization in Normed Spaces

0 references

Convex functions, monotone operators and differentiability.

0 references

Q5593503

0 references

Q3491338

0 references

Q4050397

0 references

Convergence analysis of a proximal Gauss-Newton method

0 references

Über die Methode sukzessiver Approximationen

0 references

Pegasos: primal estimated sub-gradient solver for SVM

0 references

Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization

0 references

Q5187067

0 references

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)

0 references

Support Vector Machines

0 references

A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights

0 references

Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities

0 references

Q4146571

0 references

Coordinate descent algorithms

0 references

A Stochastic Approximation Method

0 references

Stochastic Estimation of the Maximum of a Regression Function

0 references

Optimization Methods for Large-Scale Machine Learning

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5028165