Projection and contraction methods for constrained convex minimization problem and the zero points of maximal monotone operator

DOI10.22436/jnsa.010.02.26zbMath1412.47187OpenAlexW2591349686MaRDI QIDQ4631879

Luo Yi Shi, Yu Jing Wu

Publication date: 23 April 2019

Published in: The Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22436/jnsa.010.02.26

zbMATH Keywords

resolventfixed pointvariational inequalitymaximal monotone operatorconstrained convex minimizationsplit equality problem

Mathematics Subject Classification ID

Variational inequalities (49J40) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25)

Related Items

On solving of constrained convex minimize problem using gradient projection method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative algorithms for finding the zeroes of sums of operators
• Extragradient-projection method for solving constrained convex minimization problems
• On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
• Averaged mappings and the gradient-projection algorithm
• Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
• 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
• Une méthode itérative de résolution d'une inéquation variationnelle
• A multiprojection algorithm using Bregman projections in a product space
• A class of iterative methods for solving nonlinear projection equations
• Equilibrium programming using proximal-like algorithms
• A relaxed alternating CQ-algorithm for convex feasibility problems
• A class of projection and contraction methods for monotone variational inequalities
• Strong convergence of iterative algorithms for the split equality problem
• A family of projective splitting methods for the sum of two maximal monotone operators
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• CONVERGENCE ANALYSIS ON HYBRID PROJECTION ALGORITHMS FOR EQUILIBRIUM PROBLEMS AND VARIATIONAL INEQUALITY PROBLEMS
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• An iterative regularization method for the solution of the split feasibility problem in Banach spaces
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• The relaxed CQ algorithm solving the split feasibility problem
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• Generalized KM theorems and their applications
• A note on the CQ algorithm for the split feasibility problem

This page was built for publication: Projection and contraction methods for constrained convex minimization problem and the zero points of maximal monotone operator