Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
From MaRDI portal
Publication:5025784
DOI10.1137/18M1193025zbMath1499.90175arXiv1810.02893WikidataQ127388661 ScholiaQ127388661MaRDI QIDQ5025784
Shoham Sabach, D. Russell Luke, Marc Teboulle
Publication date: 3 February 2022
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.02893
fixed pointsnonsmooth optimizationnonconvex optimizationfeasibilityphase retrievalproximal algorithmssource localization
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Numerical methods in optimal control (49M99)
Related Items
A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints, On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds, Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval, Convergence Analysis of the Relaxed Douglas--Rachford Algorithm, \( \alpha \)-firmly nonexpansive operators on metric spaces, Projection methods for high numerical aperture phase retrieval
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Nonsmooth optimization via quasi-Newton methods
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Restricted normal cones and sparsity optimization with affine constraints
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Local linear convergence of approximate projections onto regularized sets
- A convergent relaxation of the Douglas-Rachford algorithm
- Local linear convergence for alternating and averaged nonconvex projections
- Representations of quasi-Newton matrices and their use in limited memory methods
- A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem
- A flexible convex relaxation for phase retrieval
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A cyclic Douglas-Rachford iteration scheme
- Phase retrieval via sensor network localization
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- On the Solution of the GPS Localization and Circle Fitting Problems
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Iterative Minimization Schemes for Solving the Single Source Localization Problem
- Projection methods: an annotated bibliography of books and reviews
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- Numerical Optimization
- Variational Analysis
- Local differentiability of distance functions
- Optical Wavefront Reconstruction: Theory and Numerical Methods
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- On Fienup Methods for Sparse Phase Retrieval
- Relaxed averaged alternating reflections for diffraction imaging
- Variational Phase Retrieval with Globally Convergent Preconditioned Proximal Algorithm
- Phase retrieval for Fresnel measurements using a shearlet sparsity constraint
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Algorithms and Convergence Results of Projection Methods for Inconsistent Feasibility Problems: A Review
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
- Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging
- The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
- Least Squares Algorithms for Time-of-Arrival-Based Mobile Location
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- Proximité et dualité dans un espace hilbertien
