Applications of accelerated computational methods for quasi-nonexpansive operators to optimization problems

This paper studies the convergence rates of two accelerated computational methods without assuming nonexpansivity of the underlying operators with convex and affine domains in infinite-dimensional Hilbert spaces. One method is a noninertial method, and its convergence rate is estimated as R T , { x...

Full description

Saved in:

Bibliographic Details
Published in:	Soft computing (Berlin, Germany) Vol. 24; no. 23; pp. 17887 - 17911
Main Author:	Sahu, D. R.
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2020 Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Codes Computational Intelligence Control Convergence Convexity Engineering Feasibility Fixed points (mathematics) Hilbert space Iterative methods Mathematical Logic and Foundations Mechatronics Methodologies and Application Methods Numerical methods Operators Optimization Robotics S-iteration method Convex optimization Lasso problem Fixed-point set Maximal monotone operator Nonexpansive Fixed-point algorithm Proximal gradient method
ISSN:	1432-7643, 1433-7479
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!