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

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

Author name not available (Why is that?), 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

• Functions of Matrices
• Variational Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Stochastic Approximation Method
• Tensor Decompositions and Applications
• Convex Analysis
• 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
• A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
• Evaluating Derivatives
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Title not available (Why is that?)
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Large-Scale Machine Learning with Stochastic Gradient Descent
• A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
• A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
• A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
• Blind source separation of positive and partially correlated data
• Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs
• Lectures on convex optimization
• A block coordinate variable metric forward-backward algorithm
• Parseval proximal neural networks
• Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
• Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems
• A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
• Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
• Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization
• First-order and stochastic optimization methods for machine learning
• A survey on some recent developments of alternating direction method of multipliers
• The developments of proximal point algorithms
• Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems
• Inertial stochastic PALM and applications in machine learning
• Accelerated doubly stochastic gradient descent for tensor CP decomposition

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)