Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings (Q2897289)

scientific article

Language	Label	Description	Also known as
English	Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings	scientific article

Statements

instance of

scholarly article

0 references

title

Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings (English)

0 references

0 references

0 references

0 references

Springer Optimization and Its Applications

0 references

publication date

10 July 2012

0 references

zbMATH Keywords

Moreau-Yosida regulation

0 references

hybrid steepest descent method

0 references

Moreau envelope

0 references

nonsmooth convex optimization

0 references

quasi-nonexpansive mappings

0 references

fixed point set

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-1-4419-9569-8_17

0 references

cites work

Q4067292

0 references

On Effective Methods for Implicit Piecewise Smooth Surface Recovery

0 references

Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones

0 references

Q4179429

0 references

Q3725052

0 references

The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space

0 references

On Projection Algorithms for Solving Convex Feasibility Problems

0 references

A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces

0 references

The Baillon-Haddad Theorem Revisited

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems

0 references

Q3843144

0 references

Q4698683

0 references

Parallel proximal decomposition algorithms for robust estimation.

0 references

Q4821526

0 references

Q5517433

0 references

Convergence theorems for sequences of nonlinear operators in Banach spaces

0 references

A unified treatment of some iterative algorithms in signal processing and image reconstruction

0 references

A Singular Value Thresholding Algorithm for Matrix Completion

0 references

Multiaccess Interference Suppression in Orthogonal Space–Time Block Coded MIMO Systems by Adaptive Projected Subgradient Method

0 references

A Flexible Peak-To-Average Power Ratio Reduction Scheme for OFDM Systems by the Adaptive Projected Subgradient Method

0 references

An Adaptive Projected Subgradient Approach to Learning in Diffusion Networks

0 references

Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization

0 references

Q4718793

0 references

An interior point method with Bregman functions for the variational inequality problem with paramonotone operators

0 references

An algorithm for total variation minimization and applications

0 references

Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage

0 references

Q4850462

0 references

Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization

0 references

Solving monotone inclusions via compositions of nonexpansive averaged operators

0 references

Hard-constrained inconsistent signal feasibility problems

0 references

A proximal decomposition method for solving convex variational inverse problems

0 references

Proximal Splitting Methods in Signal Processing

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

0 references

Best approximation in inner product spaces

0 references

Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings

0 references

Q3317655

0 references

De-noising by soft-thresholding

0 references

Compressed sensing

0 references

Ideal spatial adaptation by wavelet shrinkage

0 references

On the Mann Iterative Process

0 references

Convexity, monotonicity, and gradient processes in Hilbert space

0 references

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

0 references

Iteration methods for convexly constrained ill-posed problems in hilbert space

0 references

Q4702909

0 references

Convergence of sequential and asynchronous nonlinear paracontractions

0 references

A MANN ITERATIVE REGULARIZATION METHOD FOR ELLIPTIC CAUCHY PROBLEMS

0 references

A relaxed projection method for variational inequalities

0 references

A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization

0 references

Q3067608

0 references

Tensor completion and low-n-rank tensor recovery via convex optimization

0 references

Fast Antenna Subset Selection in MIMO Systems

0 references

Q3998720

0 references

Q3322631

0 references

Convex programming in Hilbert space

0 references

Q4883218

0 references

Receive antenna selection for mimo spatial multiplexing: theory and algorithms

0 references

A note on segmenting Mann iterates

0 references

Q3137923

0 references

The method of projections for finding the common point of convex sets

0 references

Fixed points of nonexpanding maps

0 references

Q3141900

0 references

Robust Estimation of a Location Parameter

0 references

Block-iterative surrogate projection methods for convex feasibility problems

0 references

Q3995847

0 references

The Linear <i>l</i><sub>1</sub> Estimator and the Huber M-Estimator

0 references

Q4119693

0 references

Splitting Algorithms for the Sum of Two Nonlinear Operators

0 references

Regularization of nonlinear ill-posed variational inequalities and convergence rates

0 references

Extension of the Hybrid Steepest Descent Method to a Class of Variational Inequalities and Fixed Point Problems with Nonself-Mappings

0 references

Mean Value Methods in Iteration

0 references

Duality results and proximal solutions of the Huber \(M\)-estimator problem

0 references

Q5728711

0 references

Proximité et dualité dans un espace hilbertien

0 references

Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers

0 references

NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING

0 references

Nonstrictly Convex Minimization over the Bounded Fixed Point Set of a Nonexpansive Mapping

0 references

Q4681451

0 references

Ergodic convergence to a zero of the sum of monotone operators in Hilbert space

0 references

Q4115737

0 references

Decomposition through formalization in a product space

0 references

Minimization of unsmooth functionals

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Variational Analysis

0 references

Convexly constrained linear inverse problems: iterative least-squares and regularization

0 references

Robust Wideband Beamforming by the Hybrid Steepest Descent Method

0 references

The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings

0 references

Online Kernel-Based Classification Using Adaptive Projection Algorithms

0 references

Adaptive Constrained Learning in Reproducing Kernel Hilbert Spaces: The Robust Beamforming Case

0 references

Sparse Image and Signal Processing

0 references

Q4384476

0 references

A sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings

0 references

Q2762769

0 references

Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings

0 references

Steady-State Mean-Square Performance Analysis of a Relaxed Set-Membership NLMS Algorithm by the Energy Conservation Argument

0 references

Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities

0 references

Ill-posed problems with a priori information

0 references

Q3724211

0 references

Approximation of fixed points of nonexpansive mappings

0 references

Convergence of hybrid steepest-descent methods for variational inequalities

0 references

Q2768033

0 references

Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions

0 references

Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings

0 references

Quadratic optimization of fixed points of nonexpansive mappings in hubert space

0 references

Q4409551

0 references

Q4774550

0 references

Pairwise Optimal Weight Realization—Acceleration Technique for Set-Theoretic Adaptive Parallel Subgradient Projection Algorithm

0 references

Q3149262

0 references

Q3706043

0 references

Q3995594

0 references

Hybrid steepest descent methods for zeros of nonlinear operators with applications to variational inequalities

0 references

Identifiers

zbMATH Open document ID

1263.47088

0 references

DOI

10.1007/978-1-4419-9569-8_17

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2897289