A proximal iterative approach to a non-convex optimization problem
From MaRDI portal
Publication:1049031
DOI10.1016/J.NA.2009.07.011zbMATH Open1180.90238OpenAlexW2076882061MaRDI QIDQ1049031FDOQ1049031
Authors: 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
Recommendations
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- A Variable Krasnoselski–Mann Algorithm for a New Class of Fixed Point Problems
- Computing proximal points of nonconvex functions
- A new method for nonsmooth convex optimization
- Algorithmic Applications in Management
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods in optimal control (49M99)
Cites Work
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Prox-regular functions in Hilbert spaces
- Fixed Point Iteration Processes for Asymptotically Nonexpansive Mappings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Prox-regular functions in variational analysis
- Proximité et dualité dans un espace hilbertien
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Weak and strong convergence of Krasnoselski–Mann iteration for hierarchical fixed point problems
- Mean Value Methods in Iteration
- Alternating Projections on Manifolds
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Krasnoselski-Mann Iterations in Normed Spaces
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- Local integration of prox-regular functions in Hilbert spaces
- Title not available (Why is that?)
Cited In (8)
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- Solving proximal split feasibility problems without prior knowledge of operator norms
- Computing proximal points of nonconvex functions
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A proximal alternating linearization method for nonconvex optimization problems
- The landscape of the proximal point method for nonconvex-nonconcave minimax optimization
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- Title not available (Why is that?)
This page was built for publication: A proximal iterative approach to a non-convex optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1049031)
