Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings

DOI10.1007/978-1-4419-9569-8_17zbMATH Open1263.47088OpenAlexW2246091536MaRDI QIDQ2897289FDOQ2897289

Authors: Isao Yamada, Masahiro Yukawa, 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

Recommendations

• Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
• Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
• Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
• Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
• Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings

zbMATH Keywords

hybrid steepest descent methodMoreau envelopefixed point setnonsmooth convex optimizationquasi-nonexpansive mappingsMoreau-Yosida regulation

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Numerical methods of relaxation type (49M20)

Cites Work

• Duality results and proximal solutions of the Huber \(M\)-estimator problem
• Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings
• The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
• 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
• 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
• Fast Antenna Subset Selection in MIMO Systems
• Parallel proximal decomposition algorithms for robust estimation.
• Title not available (Why is that?)
• Receive antenna selection for mimo spatial multiplexing: theory and algorithms
• Steady-State Mean-Square Performance Analysis of a Relaxed Set-Membership NLMS Algorithm by the Energy Conservation Argument
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Ideal spatial adaptation by wavelet shrinkage
• Title not available (Why is that?)
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Variational Analysis
• On Projection Algorithms for Solving Convex Feasibility Problems
• Robust Estimation of a Location Parameter
• Convex analysis and monotone operator theory in Hilbert spaces
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A Singular Value Thresholding Algorithm for Matrix Completion
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• Compressed sensing
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• De-noising by soft-thresholding
• Hard-constrained inconsistent signal feasibility problems
• Proximal splitting methods in signal processing
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Title not available (Why is that?)
• Signal Recovery by Proximal Forward-Backward Splitting
• An algorithm for total variation minimization and applications
• Nonlinear functional analysis. Fixed point theory and its applications
• The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
• A MANN ITERATIVE REGULARIZATION METHOD FOR ELLIPTIC CAUCHY PROBLEMS
• Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Monotone Operators and the Proximal Point Algorithm
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Title not available (Why is that?)
• 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
• Proximité et dualité dans un espace hilbertien
• Convex programming in Hilbert space
• Fixed points of nonexpanding maps
• Title not available (Why is that?)
• Convergence of hybrid steepest-descent methods for variational inequalities
• Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
• Approximation of fixed points of nonexpansive mappings
• Convexity, monotonicity, and gradient processes in Hilbert space
• Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
• Convergence theorems for sequences of nonlinear operators in Banach spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• A relaxed projection method for variational inequalities
• Iteration methods for convexly constrained ill-posed problems in hilbert space
• Title not available (Why is that?)
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
• Title not available (Why is that?)
• The method of projections for finding the common point of convex sets
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Mean Value Methods in Iteration
• Sparse image and signal processing. Wavelets, curvelets, morphological diversity
• Best approximation in inner product spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Regularization of nonlinear ill-posed variational inequalities and convergence rates
• Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
• Robust Wideband Beamforming by the Hybrid Steepest Descent Method
• The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
• Convexly constrained linear inverse problems: Iterative least-squares and regularization
• A sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings
• A proximal decomposition method for solving convex variational inverse problems
• Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
• 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
• On the Mann Iterative Process
• Decomposition through formalization in a product space
• Title not available (Why is that?)
• Ill-posed problems with a priori information
• Minimization of unsmooth functionals
• Title not available (Why is that?)
• NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
• Title not available (Why is that?)
• A note on segmenting Mann iterates
• Convergence of sequential and asynchronous nonlinear paracontractions
• Title not available (Why is that?)
• Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
• Nonstrictly Convex Minimization over the Bounded Fixed Point Set of a Nonexpansive Mapping
• An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
• Title not available (Why is that?)
• The Baillon-Haddad theorem revisited
• Title not available (Why is that?)
• Pairwise Optimal Weight Realization—Acceleration Technique for Set-Theoretic Adaptive Parallel Subgradient Projection Algorithm
• Convex optimization techniques for the efficient recovery of a sparsely corrupted low-rank matrix
• Block-iterative surrogate projection methods for convex feasibility problems
• Hybrid steepest descent methods for zeros of nonlinear operators with applications to variational inequalities
• Title not available (Why is that?)
• On Effective Methods for Implicit Piecewise Smooth Surface Recovery
• Title not available (Why is that?)
• Extension of the Hybrid Steepest Descent Method to a Class of Variational Inequalities and Fixed Point Problems with Nonself-Mappings
• Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
• The Linear l₁ Estimator and the Huber M-Estimator

Cited In (24)

• Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization
• A novel algorithm for convex bi-level optimization problems in Hilbert spaces with applications
• Regularization by denoising via fixed-point projection (RED-PRO)
• Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
• A first order method for solving convex bilevel optimization problems
• Moreau Envelope of Supremum Functions with Applications to Infinite and Stochastic Programming
• An algorithm for solving the variational inequality problem over the fixed point set of a quasi-nonexpansive operator in Euclidean space
• Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization
• Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
• Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
• Two stochastic optimization algorithms for convex optimization with fixed point constraints
• Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
• Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription
• On critical points of the difference of two maximal monotone operators
• Iterative methods for solving variational inequalities in Euclidean space
• Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints
• On the quantitative asymptotic behavior of strongly nonexpansive mappings in Banach and geodesic spaces
• Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function
• Iterative regularization via dual diagonal descent
• Incremental proximal method for nonsmooth convex optimization with fixed point constraints of quasi-nonexpansive mappings
• The method of cyclic intrepid projections: convergence analysis and numerical experiments
• A modified hybrid algorithm for solving a composite minimization problem in Banach spaces
• On a conjecture in Moreau-Yosida approximation of a nonsmooth convex function
• Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition

This page was built for publication: Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897289)