A proximal iterative approach to a non-convex optimization problem

DOI10.1016/j.na.2009.07.011zbMath1180.90238OpenAlexW2076882061MaRDI QIDQ1049031

Abdellatif Moudafi

Publication date: 8 January 2010

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2009.07.011

zbMATH Keywords

optimizationfixed-pointprox-regularityKrasnosel'skii-Mann algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods in optimal control (49M99)

Related Items

Solving proximal split feasibility problems without prior knowledge of operator norms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Prox-regular functions in Hilbert spaces
• Krasnoselski-Mann Iterations in Normed Spaces
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
• Fixed Point Iteration Processes for Asymptotically Nonexpansive Mappings
• Prox-regular functions in variational analysis
• Alternating Projections on Manifolds
• Weak and strong convergence of Krasnoselski–Mann iteration for hierarchical fixed point problems
• Proximité et dualité dans un espace hilbertien
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Mean Value Methods in Iteration