Global convergence and acceleration of projection methods for feasibility problems involving union convex sets

DOI10.1007/s10957-024-02580-6MaRDI QIDQ6667563

Jan Harold Alcantara, Ching-pei Lee

Publication date: 20 January 2025

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

global convergencelinear complementarity problemnonconvex optimizationalternating projectionsproximal methodsfixed point algorithmaveraged projectionsnonconvex feasibility problemsunion convex set

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Calculus of variations and optimal control; optimization (49-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The method of alternating relaxed projections for two nonconvex sets
• Reflection-projection method for convex feasibility problems with an obtuse cone
• Algorithms based on unions of nonexpansive maps
• Local linear convergence for alternating and averaged nonconvex projections
• A proximal difference-of-convex algorithm with extrapolation
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• Method of alternating projections for the general absolute value equation
• An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
• Local linear convergence for inexact alternating projections on nonconvex sets
• Union averaged operators with applications to proximal algorithms for MIN-convex functions
• A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems
• NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
• Decoding by Linear Programming
• Variational Analysis
• Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
• First-Order Methods in Optimization
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification

This page was built for publication: Global convergence and acceleration of projection methods for feasibility problems involving union convex sets