Accelerated reflection projection algorithm and its application to the LMI problem

DOI10.1080/02331934.2014.959012zbMath1327.47064OpenAlexW2076306369MaRDI QIDQ3453404

Shin-Ya Matsushita, Li Xu

Publication date: 27 November 2015

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2014.959012

zbMATH Keywords

nonexpansive mappinglinear matrix inequalityHilbert spaceobtuse coneconvex feasibility problemalternating projection method

Mathematics Subject Classification ID

Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Numerical methods of relaxation type (49M20)

Related Items

On the finite termination of the Douglas-Rachford method for the convex feasibility problem

Cites Work

• Unnamed Item
• Iterative methods for fixed point problems in Hilbert spaces
• Reflection-projection method for convex feasibility problems with an obtuse cone
• Local linear convergence for alternating and averaged nonconvex projections
• Low-order control design for LMI problems using alternating projection methods
• The convexity of \(A\) and \(B\) assures \(\text{int} A + B = \text{int}(A + B)\)
• A finite steps algorithm for solving convex feasibility problems
• Extrapolation algorithm for affine-convex feasibility problems
• Lectures on Modern Convex Optimization
• Linear Matrix Inequalities in System and Control Theory
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• On Projection Algorithms for Solving Convex Feasibility Problems
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• The method of projections for finding the common point of convex sets
• Convex analysis and monotone operator theory in Hilbert spaces