Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
From MaRDI portal
Publication:4979877
DOI10.1137/130919052zbMath1296.41011arXiv1304.7965OpenAlexW2129130711WikidataQ59241477 ScholiaQ59241477MaRDI QIDQ4979877
Guoyin Li, Jonathan M. Borwein, Liangjin Yao
Publication date: 19 June 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.7965
distance functionFejér monotone sequenceŁojasiewicz's inequalityHölderian regularityprojector operatorconvex polynomialbasic semialgebraic convex setcyclic projection algorithmvon Neumann alternating projection method
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Best approximation, Chebyshev systems (41A50) Rate of convergence, degree of approximation (41A25)
Related Items
Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems ⋮ On local convergence of the method of alternating projections ⋮ Primal necessary characterizations of transversality properties ⋮ Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems ⋮ Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds ⋮ Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems ⋮ Implicit error bounds for Picard iterations on Hilbert spaces ⋮ On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery ⋮ Hölder-type global error bounds for non-degenerate polynomial systems ⋮ Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee ⋮ Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates ⋮ Perturbation of error bounds ⋮ Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators ⋮ Peaceman-Rachford splitting for a class of nonconvex optimization problems ⋮ Affine Invariant Convergence Rates of the Conditional Gradient Method ⋮ Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity ⋮ Exact convergence rates of alternating projections for nontransversal intersections ⋮ Error bounds and Hölder metric subregularity ⋮ Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property ⋮ Convergence analysis of the generalized Douglas-Rachford splitting method under Hölder subregularity assumptions ⋮ A Privacy-Preserving Method to Optimize Distributed Resource Allocation ⋮ An algorithm for generalized constrained multi-source Weber problem with demand substations ⋮ Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples ⋮ A new projection method for finding the closest point in the intersection of convex sets ⋮ A note on alternating projections for ill-posed semidefinite feasibility problems ⋮ Transversality properties: primal sufficient conditions ⋮ New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors ⋮ A learning-enhanced projection method for solving convex feasibility problems ⋮ Convergence rate analysis of an iterative algorithm for solving the multiple-sets split equality problem ⋮ Moduli of regularity and rates of convergence for Fejér monotone sequences ⋮ Quasi-convex feasibility problems: subgradient methods and convergence rates ⋮ Curiosities and counterexamples in smooth convex optimization ⋮ Iteration process for fixed point problems and zeros of maximal monotone operators ⋮ Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems ⋮ Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
