Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings
Publication:2897289
DOI10.1007/978-1-4419-9569-8_17zbMath1263.47088MaRDI QIDQ2897289
Masahiro Yukawa, Isao Yamada, Masao Yamagishi
Publication date: 10 July 2012
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-9569-8_17
fixed point set; Moreau envelope; hybrid steepest descent method; quasi-nonexpansive mappings; nonsmooth convex optimization; Moreau-Yosida regulation
65K10: Numerical optimization and variational techniques
47H10: Fixed-point theorems
47H09: Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc.
47N10: Applications of operator theory in optimization, convex analysis, mathematical programming, economics
49M20: Numerical methods of relaxation type
Related Items
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Convergence of hybrid steepest-descent methods for variational inequalities
- Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings
- Hybrid steepest descent methods for zeros of nonlinear operators with applications to variational inequalities
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Approximation of fixed points of nonexpansive mappings
- Convergence of sequential and asynchronous nonlinear paracontractions
- Convexity, monotonicity, and gradient processes in Hilbert space
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Regularization of nonlinear ill-posed variational inequalities and convergence rates
- Duality results and proximal solutions of the Huber \(M\)-estimator problem
- Block-iterative surrogate projection methods for convex feasibility problems
- An algorithm for total variation minimization and applications
- Parallel proximal decomposition algorithms for robust estimation.
- Ill-posed problems with a priori information
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- Convergence theorems for sequences of nonlinear operators in Banach spaces
- A note on segmenting Mann iterates
- Convexly constrained linear inverse problems: iterative least-squares and regularization
- Hard-constrained inconsistent signal feasibility problems
- A MANN ITERATIVE REGULARIZATION METHOD FOR ELLIPTIC CAUCHY PROBLEMS
- Proximal Splitting Methods in Signal Processing
- The Baillon-Haddad Theorem Revisited
- A Singular Value Thresholding Algorithm for Matrix Completion
- Tensor completion and low-n-rank tensor recovery via convex optimization
- A sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings
- The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
- Extension of the Hybrid Steepest Descent Method to a Class of Variational Inequalities and Fixed Point Problems with Nonself-Mappings
- A proximal decomposition method for solving convex variational inverse problems
- Decomposition through formalization in a product space
- A relaxed projection method for variational inequalities
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- Monotone Operators and the Proximal Point Algorithm
- Ideal spatial adaptation by wavelet shrinkage
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- Variational Analysis
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
- Quadratic optimization of fixed points of nonexpansive mappings in hubert space
- The Linear l1 Estimator and the Huber M-Estimator
- Nonstrictly Convex Minimization over the Bounded Fixed Point Set of a Nonexpansive Mapping
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
- Robust Wideband Beamforming by the Hybrid Steepest Descent Method
- Multiaccess Interference Suppression in Orthogonal Space–Time Block Coded MIMO Systems by Adaptive Projected Subgradient Method
- Online Kernel-Based Classification Using Adaptive Projection Algorithms
- An Adaptive Projected Subgradient Approach to Learning in Diffusion Networks
- Steady-State Mean-Square Performance Analysis of a Relaxed Set-Membership NLMS Algorithm by the Energy Conservation Argument
- Adaptive Constrained Learning in Reproducing Kernel Hilbert Spaces: The Robust Beamforming Case
- A Flexible Peak-To-Average Power Ratio Reduction Scheme for OFDM Systems by the Adaptive Projected Subgradient Method
- Pairwise Optimal Weight Realization—Acceleration Technique for Set-Theoretic Adaptive Parallel Subgradient Projection Algorithm
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers
- De-noising by soft-thresholding
- Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
- Receive antenna selection for mimo spatial multiplexing: theory and algorithms
- Fast Antenna Subset Selection in MIMO Systems
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- On Effective Methods for Implicit Piecewise Smooth Surface Recovery
- Signal Recovery by Proximal Forward-Backward Splitting
- Robust Estimation of a Location Parameter
- Proximité et dualité dans un espace hilbertien
- Convex programming in Hilbert space
- Fixed points of nonexpanding maps
- The method of projections for finding the common point of convex sets
- On the Mann Iterative Process
- Minimization of unsmooth functionals
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Mean Value Methods in Iteration
- Convex analysis and monotone operator theory in Hilbert spaces
- Compressed sensing
- Sparse Image and Signal Processing
- Best approximation in inner product spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item