Stochastic approximation method using diagonal positive-definite matrices for convex optimization with fixed point constraints

DOI10.1186/s13663-021-00695-3OpenAlexW3165523929MaRDI QIDQ2138441

Hideaki Iiduka

Publication date: 12 May 2022

Published in: Fixed Point Theory and Algorithms for Sciences and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13663-021-00695-3

zbMATH Keywords

fixed pointquasinonexpansive mappingconvex stochastic optimizationstochastic subgradientadaptive learning rate optimization algorithmsstochastic fixed point optimization algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Numerical methods for variational inequalities and related problems (65K15)

Uses Software

• UCI-ml
• LIBSVM
• AdaGrad
• Adam

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative approximation of fixed points
• Stochastic approximation. A dynamical systems viewpoint.
• Approximation of fixed points of nonexpansive mappings
• Convex analysis and nonlinear optimization. Theory and examples
• Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
• Ill-posed problems with a priori information
• Robust Stochastic Approximation Approach to Stochastic Programming
• Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
• Matrix Analysis
• Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
• Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
• On Stochastic Subgradient Mirror-Descent Algorithm with Weighted Averaging
• Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions
• Learning representations by back-propagating errors
• Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms
• A projection method for approximating fixed points of quasi nonexpansive mappings without the usual demiclosedness condition
• Fixed points of nonexpanding maps
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Mean Value Methods in Iteration
• A Stochastic Approximation Method
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Stochastic approximation method using diagonal positive-definite matrices for convex optimization with fixed point constraints