Set regularities and feasibility problems

From MaRDI portal
Publication:2413089

DOI10.1007/s10107-016-1039-xzbMath1390.49012arXiv1602.04935OpenAlexW3099645558MaRDI QIDQ2413089

Nguyen Hieu Thao, D. Russell Luke, Alexander Y. Kruger

Publication date: 6 April 2018

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.04935




Related Items (31)

Primal necessary characterizations of transversality propertiesDual sufficient characterizations of transversality propertiesThe projection onto the crossCharacterizations of some transversality-type propertiesTransversality in variational analysisPerturbation of error boundsAn improved stability result on the metric regularity under Lipschitz set-valued perturbationsGeometric and metric characterizations of transversality propertiesRegularity of sets under a reformulation in a product space with reduced dimensionA successive centralized circumcentered-reflection method for the convex feasibility problemExact convergence rates of alternating projections for nontransversal intersectionsFuzzy multiplier, sum and intersection rules in non-Lipschitzian settings: decoupling approach revisitedDistributed algorithms for computing a fixed point of multi-agent nonexpansive operatorsRandom Function Iterations for Consistent Stochastic FeasibilitySubregular recourse in nonlinear multistage stochastic optimizationAbout intrinsic transversality of pairs of setsAbout subtransversality of collections of setsA new projection method for finding the closest point in the intersection of convex setsA convergent relaxation of the Douglas-Rachford algorithmConvex combination of alternating projection and Douglas-Rachford operators for phase retrievalUnnamed ItemUnnamed ItemTransversality properties: primal sufficient conditionsMetric inequality conditions on sets and consequences in optimizationNecessary conditions for linear convergence of iterated expansive, set-valued mappingsConvergence Analysis of the Relaxed Douglas--Rachford AlgorithmQuantitative Convergence Analysis of Iterated Expansive, Set-Valued MappingsExtremality, stationarity and generalized separation of collections of setsOn tangential transversalityProjection methods for high numerical aperture phase retrievalPhase Retrieval with Sparse Phase Constraint



Cites Work


This page was built for publication: Set regularities and feasibility problems