Optimization on solution sets of common fixed point problems

DOI10.1007/978-3-030-78849-0MaRDI QIDQ5003204zbMATH OpenOpenAlexFDO

Authors Alexander J. Zaslavski

Publication date 20 July 2021

Published in Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-78849-0

zbMATH Keywords

Cimmino subgradient algorithmfixed point problemsoptimizationproximal point subgradient algorithmsubgradient projection algorithmzero-sum games

Mathematics Subject Classification ID

Convexity of real functions of several variables, generalizations (26B25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01) Existence theories for problems in abstract spaces (49J27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Convex programming (90C25) 2-person games (91A05)

Recommendations

• The projected subgradient algorithm in convex optimization
• Algorithms for solving common fixed point problems
• Numerical optimization with computational errors
• Approximate solutions of common fixed-point problems
• Convex optimization with computational errors

Cited in

(6)

• Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method
• The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
• Optimization in Banach spaces
• The projected subgradient algorithm in convex optimization
• Preface to the special issue dedicated to Dr. Alexander J. Zaslavski on his 65th birthday
• Optimization on solution sets of common fixed point problems with a countable family of maps

This page was built for publication: Optimization on solution sets of common fixed point problems

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