A deep monotone approximation operator based on the best quadratic lower bound of convex functions

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E91-A, Issue 8, 2008, Pages 1858-1866

  Yamagishin, Masao ^a   Yamada, Isao ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Adaptive filtering; Attracting mapping; Convex feasibility problem; Monotone approximation; Subgradient projection

Indexed keywords

ADAPTIVE FILTERING; ADAPTIVE FILTERS; SIGNAL PROCESSING;

APPROXIMATION OPERATORS; CLOSED FORM SOLUTIONS; COMPUTATIONALLY EFFICIENT; CONVEX FEASIBILITY PROBLEM; LIPSCHITZ CONTINUOUS; MONOTONE APPROXIMATION; SIGNAL PROCESSING ALGORITHMS; SUBGRADIENT PROJECTIONS;

FUNCTIONS;

EID: 70349217603     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e91-a.8.1858     Document Type: Article

References (18)

1. B.T. Polyak, "Minimization of unsmooth functionals" USSR Computational Mathematics and Mathematical Physics, vol.9, no.3, pp.14-29, 1969.
2. P.L. Combettes, "The foundation of set theoretic estimation," Proc. IEEE, vol.81, pp.182-208, 1993.
3. H.H. Bauschke and J.M. Borwein, "On projection algorithm for solving convex feasibility problems," SIAM Review, vol.38, pp.367-426, 1996.
4. P.L. Combettes, "Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections," IEEE Trans. Image Process., vol.6, no.4, pp.493-506, 1997.
5. H.H. Bauschke and P.L. Combettes, "A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert space," Math. Oper. Res., pp.248-264, 2001.
6. I. Yamada, K. Slavakis, and K. Yamada, "An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniques," IEEE Trans. Signal Process., vol.50, no.5, pp.1091-1101, 2002.
7. I. Yamada and N. Ogura, "Hybrid steepest descent method for variational inequality problem over the fixed point set of certain quasinonexpansive mappings," Numerical Functional Analysis and Optimization, vol.25, no.7, pp.619-655, 2004.
8. D. Mandic and I. Yamada, Tutorial Textbook: Machine Learning and signal processing applications of fixed point theory, IEEE ICASSP, 2007.
9. D.C. Youla and H. Webb, "Image restoration by the method of convex projections: Part 1 -Theory," IEEE Trans. Med. Imaging, vol.1, no.2, pp.81-94, 1982.
10. H. Stark and Y. Yang, Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics, Wiley, 1998.
11. I. Yamada and N. Ogura, "Adaptive projected subgradient method for asymptotic minimization of sequence of nonnegative convex functions," Numerical Functional Analysis and Optimization, vol.25, no.7, pp.593-617, 2004.
12. N. Ogura and I. Yamada, "A deep outer approximating half space of the level set of certain quadratic functions," J. Nonlinear and Convex Analysis, vol.6, no.1, pp.187-201, 2005.
13. Y. Censor and S.A. Zenios, Parallel Optimization: Theory, Algorithm, and Optimization, Oxford University Press, 1997.
14. F. Deutsch, Best Approximation in Inner Product Spaces, Springer, New York, 2001.
15. C.L. Byrne, Applied iterative methods, A K Peters, Ltd., Wellesley, Massachusettes, 2007.
16. I. Yamada, T. Miyamura, and K. Sakaniwa, "Restricted leaming algorithms and improved excluding hyperspheres," IEICE Trans. Inf. & Syst. (Japanese Edition), vol.J77-D-II, no.9, pp.1859-1881, Sept. 1994.
17. D.P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982.
18. L. Elsner, L. Koltracht, and M. Neumann, "Convergence of sequential and asynchronous nonlinear paracontractions" Numerische Mathematik, vol.62, pp.305-319, 1992.