References
- Ben-Tal A, Nemirovski A. Lectures on modern convex optimization: analysis, algorithms, and engineering applications. Philadelphia (PA): SIAM; 2001.
- Boyd S, Ghaoui LE, Feron E, Balakrishnan V. Linear matrix inequalities in system and control theory. Philadelphia (PA): SIAM; 1994.
- Skelton RE, Iwasaki T, Grigoriadis KM. A unified algebraic approach to linear control design. London: Taylor & Francis; 1998.
- Bregman LM. The method of successive projection for finding a common point of convex sets. Soviet Math. Dokl. 1965;6:688–692.
- von Neumann J. Functional operators, Vol. II. Princeton (NJ): Princeton University Press; 1950.
- Stark H, Yang Y. Vector space projections: a numerical approach to signal and image processing, neural nets, and optics. New York (NY): Wiley; 1998.
- Grigoriadis KM, Skelton RE. Low-order control design for LMI problems using alternating projection methods. Automatica. 1996;32:1117–1125.
- Bauschke HH, Borwein JM. On projection algorithms for solving convex feasibility problems. SIAM Rev. 1996;38:367–426.
- Bauschke HH, Combettes PL. Convex analysis and monotone operator theory in Hilbert spaces. New York (NY): Springer; 2011.
- Bauschke HH, Combettes PL, Kruk SG. Extrapolation algorithm for affine-convex feasibility problems. Numer. Algorithms. 2006;41:239–274.
- Bauschke HH, Kruk SG. Reflection-projection method for convex feasibility problems with an obtuse cone. J. Optim. Theory Appl. 2004;120:503–531.
- Cegielski A. Iterative methods for fixed point problems in Hilbert spaces. Heidelberg: Springer; 2012.
- Deutsch F. Best approximation in inner product spaces. New York (NY): Springer; 2001.
- Escalante R, Raydan M. Alternating projection methods. Philadelphia (PA): SIAM; 2011.
- Gubin LG, Polyak BT, Raik EV. The method of projections for finding the common point of convex sets. USSR Comput. Math. Math. Phys. 1967;7:1–24.
- Rami MA, Helmke U, Moore JB. A finite steps algorithm for solving convex feasibility problems. J. Global. Optim. 2007;38:143–160.
- Orsi R, Rami MA, Moore JB. A finite step projective algorithm for solving linear matrix inenqualities. Proceedings of the 42nd Conference on Decision and Control; Maui, Hawaii, USA; 2003. p. 4979–4984.
- Lewis AS, Luke DR, Malick J. Local linear convergence for alternating and averaged nonconvex projections. Found. Comput. Math. 2009;9:485–513.
- Sturm JF. Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 1999;11:625–653.
- Takahashi W. Nonlinear functional analysis. fixed points theory and its application. Yokohama: Yokohama Publishers; 2000.
- Moreau J-J. Décomposition orthogonale d’un espace hilbertien selon deux cônes mutuellement polaires. C. R. Acad. Sci. Paris Sér. A Math. 1962;255:23840.
- Goebel K, Reich S. Uniformly convexity, hyperbolic geometry, and nonexpansive mappings. New York (NY): Marcel Dekker; 1984.
- Opial Z. Weak convergence of the sequence of successive approximation for nonexpansive mappings. Bull. Am. Math. Soc. 1967;73:591–597.
- Tanaka T, Kuroiwa D. The convexity of A and B assures intA + B = int(A + B). Appl. Math. Lett. 1993;6:83–86.
- Luenberger D. Optimization by Vector Space Methods. New York (NY): Wiley; 1969.