Set regularities and feasibility problems
From MaRDI portal
alternating projectionsCHIPClarke regularityDouglas-RachfordfeasibilityHölder regularitymetric regularitynormal conenormal qualification conditionprox-regularitytransversalityweak-sharp minima
Set-valued and variational analysis (49J53) Sensitivity, stability, well-posedness (49K40) Numerical methods based on necessary conditions (49M05) Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30)
Abstract: We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of regularities are presented which shed light on the relations between seemingly different ideas and point to possible necessary conditions for local linear convergence of fundamental algorithms.
It is the first successful attempt to unify different concepts of the regularity for sets and collections of sets following their importance especially in the feasibility problems. The immediate projections for the convex sets, cones and the manifolds conclude this research work together with reliable references.
Recommendations
- Regularity of collections of sets and convergence of inexact alternating projections
- On the regularity condition in a convex feasibility problem
- Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
Cites work
- A covering theorem for set-valued mappings
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- A survey on error bounds for lower semicontinuous functions
- A unified theory for metric regularity of multifunctions
- Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
- About regularity of collections of sets
- About stationarity and regularity in variational analysis
- About subtransversality of collections of sets
- About uniform regularity of collections of sets.
- Alternating Projections on Manifolds
- Approximate subdifferentials and applications 3: the metric theory
- Asymptotic constraint qualifications and global error bounds for convex inequalities.
- Best approximation in inner product spaces
- Calculus without derivatives
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Constrained best approximation in Hilbert space
- Convex analysis and monotone operator theory in Hilbert spaces
- Differential Topology
- Error bounds and metric subregularity
- Error bounds: necessary and sufficient conditions
- scientific article; zbMATH DE number 3562121 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 2190119 (Why is no real title available?)
- Implicit Functions and Solution Mappings
- Linear convergence of the Douglas-Rachford method for two closed sets
- Linear regularity and \(\phi\)-regularity of nonconvex sets
- Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces
- Local differentiability of distance functions
- Local linear convergence for alternating and averaged nonconvex projections
- Metric inequality, subdifferential calculus and applications
- Metric regularity and subdifferential calculus
- Metric subregularity and calmness for nonconvex generalized equations in Banach spaces
- Metric subregularity for nonclosed convex multifunctions in normed spaces
- Metric subregularity for proximal generalized equations in Hilbert spaces
- Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
- On gradients of functions definable in o-minimal structures
- On metric and calmness qualification conditions in subdifferential calculus
- On Projection Algorithms for Solving Convex Feasibility Problems
- On subregularity properties of set-valued mappings
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Quantitative characterizations of regularity properties of collections of sets
- Regularities and their relations to error bounds
- Regularity of collections of sets and convergence of inexact alternating projections
- Restricted normal cones and the method of alternating projections: applications
- Restricted normal cones and the method of alternating projections: theory
- Strong CHIP, normality, and linear regularity of convex sets
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- The Duality of Pairs of Wedges
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Transversality and alternating projections for nonconvex sets
- Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets
- Variational Analysis
- Variational Analysis and Generalized Differentiation I
- Weak Sharp Minima in Mathematical Programming
- Weak sharp minima revisited. I: Basic theory
- Weak sharp minima revisited. II: Application to linear regularity and error bounds
Cited in
(50)- On the regularity condition in a convex feasibility problem
- Transversality in variational analysis
- About intrinsic transversality of pairs of sets
- Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval
- Transversality properties: primal sufficient conditions
- Metric inequality conditions on sets and consequences in optimization
- The projection onto the cross
- Characterizations of some transversality-type properties
- Geometric and metric characterizations of transversality properties
- Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators
- Subregular recourse in nonlinear multistage stochastic optimization
- Necessary conditions for linear convergence of iterated expansive, set-valued mappings
- Extremality, stationarity and generalized separation of collections of sets
- On tangential transversality
- Perturbation of error bounds
- Regularity and stability for a convex feasibility problem
- An improved stability result on the metric regularity under Lipschitz set-valued perturbations
- Regularity of collections of sets and convergence of inexact alternating projections
- 1-Determinacy of Feasible Sets
- Regularity properties of non-negative sparsity sets
- Random function iterations for consistent stochastic feasibility
- Phase retrieval with sparse phase constraint
- Sufficient condition for tangential transversality
- Nonlinear transversality of collections of sets: dual space necessary characterizations
- Convergence Analysis of the Relaxed Douglas--Rachford Algorithm
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- About uniform regularity of collections of sets.
- Projection methods for high numerical aperture phase retrieval
- Regularity of sets under a reformulation in a product space with reduced dimension
- A successive centralized circumcentered-reflection method for the convex feasibility problem
- Exact convergence rates of alternating projections for nontransversal intersections
- Fuzzy multiplier, sum and intersection rules in non-Lipschitzian settings: decoupling approach revisited
- A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis
- Generalized alternating projections on manifolds and convex sets
- A finitely convergent circumcenter method for the convex feasibility problem
- Subtransversality and strong CHIP of closed sets in Asplund spaces
- Extremality of families of sets
- About subtransversality of collections of sets
- A new projection method for finding the closest point in the intersection of convex sets
- Convergence rate of alternating projection method for the intersection of an affine subspace and the second-order cone
- On a robust approach to ``split feasibility problems: solvability and global error bound conditions
- Quasioptimal alternating projections and their use in low-rank approximation of matrices and tensors
- Directionally variational analysis and second-order optimality conditions for mathematical programs with switching constraints
- Generalized Moreau-Rockafellar type theorem for cone paraconvex multifunctions
- An efficient algorithm for the _p norm based metric nearness problem
- Linearization of differential inclusions
- A convergent relaxation of the Douglas-Rachford algorithm
- Revisiting implicit variables in mathematical optimization: simplified modeling and a numerical evidence
- Primal necessary characterizations of transversality properties
- Dual sufficient characterizations of transversality properties
This page was built for publication: Set regularities and feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413089)
