A note on alternating projections for ill-posed semidefinite feasibility problems
From MaRDI portal
Publication:517318
Recommendations
- Improving an alternating projection algorithm for semidefinite programming feasibility problem and an implementation for second-order cones
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Alternating Projections on Manifolds
- Solving semidefinite programming problems via alternating direction methods
Cites work
- Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
- Cones, matrices and mathematical programming
- Convex Analysis
- Dykstra's alternating projection algorithm for two sets
- Error Bounds for Linear Matrix Inequalities
- Extreme point inequalities and geometry of the rank sparsity ball
- Facial reduction algorithms for conic optimization problems
- Functional Operators (AM-22), Volume 2
- Generic minimizing behavior in semialgebraic optimization
- Generic nondegeneracy in convex optimization
- Generic optimality conditions for semialgebraic convex programs
- scientific article; zbMATH DE number 3728055 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the convergence of von Neumann's alternating projection algorithm for two sets
- On the generic properties of convex optimization problems in conic form
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Preprocessing and regularization for degenerate semidefinite programs
- Proximality and Chebyshev sets
- Stability of closedness of convex cones under linear mappings
- Stability of closedness of convex cones under linear mappings. II
- Strong duality in conic linear programming: facial reduction and extended duals
- The method of projections for finding the common point of convex sets
Cited in
(19)- Transversality properties: primal sufficient conditions
- A note on the finite convergence of alternating projections
- Kurdyka-Łojasiewicz exponent via inf-projection
- Amenable cones: error bounds without constraint qualifications
- Improving an alternating projection algorithm for semidefinite programming feasibility problem and an implementation for second-order cones
- An alternating projection algorithm for finding feasible points of block-diagonal semidefinite constraints
- Comparing averaged relaxed cutters and projection methods: theory and examples
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Error bounds and singularity degree in semidefinite programming
- 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
- Analytic formulas for alternating projection sequences for the positive semidefinite cone and an application to convergence analysis
- Convergence rate of alternating projection method for the intersection of an affine subspace and the second-order cone
- MFO-RIMS tandem workshop: Optimization, theoretical computer science and algebraic geometry: convexity and beyond. Abstracts from the MFO-RIMS tandem workshop held February 16--21, 2025
- Title not available (Why is no real title available?)
- Construction of a class of sharp Löwner majorants for a set of symmetric matrices
- Primal necessary characterizations of transversality properties
This page was built for publication: A note on alternating projections for ill-posed semidefinite feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517318)
