Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks

DOI10.1007/S00186-024-00851-6MaRDI QIDQ6540474FDO

Authors Deren Han

Publication date 15 May 2024

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

nonconvex and nonsmoothstochastic variance reduction gradientproximal neural network

Mathematics Subject Classification ID

Calculus of variations and optimal control; optimization (49-XX) Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites work

• scientific article; zbMATH DE number 3449561 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• scientific article; zbMATH DE number 5223994 (Why is no real title available?)
• A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
• A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
• A Stochastic Approximation Method
• A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
• A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
• A block coordinate variable metric forward-backward algorithm
• A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
• A survey on some recent developments of alternating direction method of multipliers
• Accelerated doubly stochastic gradient descent for tensor CP decomposition
• Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
• Blind source separation of positive and partially correlated data
• Block stochastic gradient iteration for convex and nonconvex optimization
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs
• Convex Analysis
• Evaluating Derivatives
• First-order and stochastic optimization methods for machine learning
• Functions of Matrices
• Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems
• Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
• Inertial stochastic PALM and applications in machine learning
• Large-scale machine learning with stochastic gradient descent
• Lectures on convex optimization
• Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Parseval proximal neural networks
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Tensor Decompositions and Applications
• The developments of proximal point algorithms
• Variational Analysis

This page was built for publication: Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6540474)