Pages that link to "Item:Q895706"

The following pages link to Transversality and alternating projections for nonconvex sets (Q895706):

Displaying 42 items.

• Projection methods for quantum channel construction (Q496914) (← links)
• Finding a low-rank basis in a matrix subspace (Q517309) (← links)
• A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting (Q670659) (← links)
• Implicit functions: a metric theory (Q683293) (← links)
• About subtransversality of collections of sets (Q683294) (← links)
• A convergent relaxation of the Douglas-Rachford algorithm (Q721957) (← links)
• Primal necessary characterizations of transversality properties (Q830190) (← links)
• Dual sufficient characterizations of transversality properties (Q830339) (← links)
• Transversality and alternating projections for nonconvex sets (Q895706) (← links)
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems (Q1630271) (← links)
• Implicit error bounds for Picard iterations on Hilbert spaces (Q1639952) (← links)
• Transversality in variational analysis (Q1673886) (← links)
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
• About intrinsic transversality of pairs of sets (Q1745916) (← links)
• Frame completion with prescribed norms via alternating projection method (Q1995944) (← links)
• Transversality properties: primal sufficient conditions (Q2045184) (← links)
• Metric inequality conditions on sets and consequences in optimization (Q2046537) (← links)
• A note on the finite convergence of alternating projections (Q2060563) (← links)
• Alternating projections with applications to Gerchberg-Saxton error reduction (Q2070399) (← links)
• A penalized method of alternating projections for weighted low-rank Hankel matrix optimization (Q2088963) (← links)
• Circumcentering approximate reflections for solving the convex feasibility problem (Q2138461) (← links)
• Characterizations of some transversality-type properties (Q2158834) (← links)
• A factorization method for completely positive matrices (Q2174498) (← links)
• Some new characterizations of intrinsic transversality in Hilbert spaces (Q2174919) (← links)
• Geometric and metric characterizations of transversality properties (Q2189629) (← links)
• Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria (Q2220664) (← links)
• A cyclic Douglas-Rachford iteration scheme (Q2250057) (← links)
• Necessary conditions for linear convergence of iterated expansive, set-valued mappings (Q2297639) (← links)
• Extremality, stationarity and generalized separation of collections of sets (Q2315263) (← links)
• On tangential transversality (Q2325979) (← links)
• Local linear convergence for inexact alternating projections on nonconvex sets (Q2330978) (← links)
• Set regularities and feasibility problems (Q2413089) (← links)
• Well-posedness and generalized metric subregularity with respect to an admissible function (Q2423861) (← links)
• REGULARITY PROPERTIES IN VARIATIONAL ANALYSIS AND APPLICATIONS IN OPTIMISATION (Q2814356) (← links)
• METRIC REGULARITY—A SURVEY PART II. APPLICATIONS (Q2976240) (← links)
• On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications (Q5084663) (← links)
• Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings (Q5219693) (← links)
• Linear Convergence of Projection Algorithms (Q5219736) (← links)
• Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow (Q6060145) (← links)
• On the centralization of the circumcentered-reflection method (Q6126653) (← links)
• On a numerical construction of doubly stochastic matrices with prescribed eigenvalues (Q6159104) (← links)
• Provable Phase Retrieval with Mirror Descent (Q6168333) (← links)