A note on alternating projections for ill-posed semidefinite feasibility problems
From MaRDI portal
Publication:517318
DOI10.1007/s10107-016-1048-9zbMath1360.90188OpenAlexW2461651802WikidataQ59241419 ScholiaQ59241419MaRDI QIDQ517318
Dmitriy Drusvyatskiy, Henry Wolkowicz, Guoyin Li
Publication date: 23 March 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-016-1048-9
regularityerror boundsalternating projectionslinear matrix inequality (LMI)sublinear convergencesemi-definite program (SDP)
Semidefinite programming (90C22) Numerical optimization and variational techniques (65K10) Numerical methods of relaxation type (49M20)
Related Items
Primal necessary characterizations of transversality properties, Kurdyka-Łojasiewicz exponent via inf-projection, Revisiting degeneracy, strict feasibility, stability, in linear programming, On the centralization of the circumcentered-reflection method, Exact convergence rates of alternating projections for nontransversal intersections, Amenable cones: error bounds without constraint qualifications, Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples, Transversality properties: primal sufficient conditions, A note on the finite convergence of alternating projections, Construction of a class of sharp Löwner majorants for a set of symmetric matrices, Error Bounds and Singularity Degree in Semidefinite Programming, Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facial reduction algorithms for conic optimization problems
- Extreme point inequalities and geometry of the rank sparsity ball
- Polyhedral and semidefinite programming methods in combinatorial optimization
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Dykstra's alternating projection algorithm for two sets
- Proximality and Chebyshev sets
- Cones, matrices and mathematical programming
- Generic Minimizing Behavior in Semialgebraic Optimization
- Generic Optimality Conditions for Semialgebraic Convex Programs
- Error Bounds for Linear Matrix Inequalities
- On Projection Algorithms for Solving Convex Feasibility Problems
- Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
- Generic nondegeneracy in convex optimization
- Convex Analysis
- The method of projections for finding the common point of convex sets
- Preprocessing and Regularization for Degenerate Semidefinite Programs
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
- Functional Operators (AM-22), Volume 2
- On the generic properties of convex optimization problems in conic form
