NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING

DOI10.1081/NFA-120003674zbMath1178.90346MaRDI QIDQ4546050

Nobuhiko Ogura, Isao Yamada

Publication date: 18 August 2002

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

zbMATH Keywords

convex optimizationinverse problemnonexpansive mappingmonotone operatorvariational inequality problemconvex projectiongeneralized convex feasible setfixed point theorem, steepest descent method

Mathematics Subject Classification ID

Convex programming (90C25) Fixed-point theorems (47H10) Programming in abstract spaces (90C48) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Related Items (35)

Continuous dynamics related to monotone inclusions and non-smooth optimization problems ⋮ Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ On compositions of special cases of Lipschitz continuous operators ⋮ Convergence rates with inexact non-expansive operators ⋮ Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry ⋮ A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms ⋮ Iteration-discretization methods for variational inequalities over fixed point sets ⋮ Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization ⋮ Convergence Rate Analysis of Primal-Dual Splitting Schemes ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ Tight coefficients of averaged operators via scaled relative graph ⋮ MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications ⋮ A generalized forward-backward splitting operator: degenerate analysis and applications ⋮ How Averaged is the Composition of Two Linear Projections? ⋮ A fast inertial primal-dual algorithm to composite optimization models with application to image restoration problems ⋮ Strong Convergence for the Alternating Halpern–Mann Iteration in CAT(0) Spaces ⋮ Strict pseudocontractions and demicontractions, their properties, and applications ⋮ Inducing strong convergence into the asymptotic behaviour of proximal splitting algorithms in Hilbert spaces ⋮ Compositions and convex combinations of averaged nonexpansive operators ⋮ Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization tasks ⋮ Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators ⋮ On the optimal relaxation parameters of Krasnosel'ski–Mann iteration ⋮ Local linear convergence analysis of Primal–Dual splitting methods ⋮ Unnamed Item ⋮ Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions ⋮ Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings ⋮ Nonstrictly Convex Minimization over the Bounded Fixed Point Set of a Nonexpansive Mapping ⋮ Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs ⋮ Second Order Forward-Backward Dynamical Systems For Monotone Inclusion Problems ⋮ Iterative methods for computing the resolvent of the sum of a maximal monotone operator and composite operator with applications ⋮ Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition ⋮ Convergence analysis of a variable metric forward-backward splitting algorithm with applications ⋮ Convergence rates of forward-Douglas-Rachford splitting method ⋮ The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings ⋮ Conical averagedness and convergence analysis of fixed point algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constrained \(L_ p\) approximation
• Constrained best approximation in Hilbert space. II
• Totally convex functions for fixed points computation and infinite dimensional optimization
• Constrained best approximation in Hilbert space
• Convexly constrained linear inverse problems: iterative least-squares and regularization
• Hard-constrained inconsistent signal feasibility problems
• Smoothing and Interpolation in a Convex Subset of a Hilbert Space
• On the Convergence of the Products of Firmly Nonexpansive Mappings
• Iteration methods for convexly constrained ill-posed problems in hilbert space
• Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
• Quadratic optimization of fixed points of nonexpansive mappings in hubert space
• On Projection Algorithms for Solving Convex Feasibility Problems
• NONEXPANSIVE NONLINEAR OPERATORS IN A BANACH SPACE
• Weak convergence of the sequence of successive approximations for nonexpansive mappings

This page was built for publication: NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING