Accelerated reflection projection algorithm and its application to the LMI problem
From MaRDI portal
Recommendations
- A finite steps algorithm for solving convex feasibility problems
- On the application of alternating projection under the constraint of linear matrix inequalities
- Acceleration schemes for the method of alternating projections
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
- An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
Cites work
- A finite steps algorithm for solving convex feasibility problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Extrapolation algorithm for affine-convex feasibility problems
- scientific article; zbMATH DE number 1145160 (Why is no real title available?)
- Iterative methods for fixed point problems in Hilbert spaces
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear Matrix Inequalities in System and Control Theory
- Local linear convergence for alternating and averaged nonconvex projections
- Low-order control design for LMI problems using alternating projection methods
- On Projection Algorithms for Solving Convex Feasibility Problems
- Reflection-projection method for convex feasibility problems with an obtuse cone
- The convexity of \(A\) and \(B\) assures \(\text{int} A + B = \text{int}(A + B)\)
- The method of projections for finding the common point of convex sets
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(2)
This page was built for publication: Accelerated reflection projection algorithm and its application to the LMI problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453404)
