Optimization on Solution Sets of Common Fixed Point Problems

DOI10.1007/978-3-030-78849-0zbMATH Open1479.49001OpenAlexW3188063759MaRDI QIDQ5003204

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

optimizationzero-sum gamesfixed point problemssubgradient projection algorithmCimmino subgradient algorithmproximal point subgradient algorithm

Mathematics Subject Classification ID

Convex programming (90C25) 2-person games (91A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Existence theories for problems in abstract spaces (49J27) 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)

Related Items (2)

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

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)