Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator

DOI10.1186/S13663-015-0258-9zbMATH Open1309.47084OpenAlexW2148886965WikidataQ59436072 ScholiaQ59436072MaRDI QIDQ2017669FDOQ2017669

Authors: Ming Tian, Si-Wen Jiao 

Publication date: 23 March 2015

Published in: Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13663-015-0258-9

Recommendations

• Projection and contraction methods for constrained convex minimization problem and the zero points of maximal monotone operator
• Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
• Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
• Regularized gradient-projection methods for finding the minimum-norm solution of equilibrium and the constrained convex minimization problem
• A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
• Regularized projection and conditional gradient methods in convex finite-dimensional optimization problems
• scientific article; zbMATH DE number 7141475
• scientific article; zbMATH DE number 2205653
• Iterative algorithms with the regularization for the constrained convex minimization problem and maximal monotone operators
• Modified gradient-projection methods for critical points of a constrained nonconvex minimization problem

zbMATH Keywords

fixed pointresolventstrong convergencevariational inequalityconstrained convex minimizationequilibrium problemiterative methodmaximal monotone operator

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Variational inequalities (global problems) in infinite-dimensional spaces (58E35)

Cites Work

• A multiprojection algorithm using Bregman projections in a product space
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• Iterative oblique projection onto convex sets and the split feasibility problem
• Nonlinear functional analysis. Fixed point theory and its applications
• An alternating projection that does not converge in norm
• Viscosity approximation methods for fixed-points problems
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
• A general iterative method for nonexpansive mappings in Hilbert spaces
• Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
• A general iterative method for hierarchical variational inequality problems in Hilbert spaces and applications
• Solving the split feasibility problem without prior knowledge of matrix norms
• Approximating zero points of accretive operators in general Banach spaces
• Extragradient-projection method for solving constrained convex minimization problems
• Title not available (Why is that?)
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Title not available (Why is that?)
• The relaxed CQ algorithm solving the split feasibility problem
• Generalized KM theorems and their applications
• General iterative methods for equilibrium and constrained convex minimization problem
• Some iterative methods for finding fixed points and for solving constrained convex minimization problems
• A note on the CQ algorithm for the split feasibility problem
• Strong convergence theorems for maximal monotone operators with nonlinear mappings in Hilbert spaces
• Averaged mappings and the gradient-projection algorithm
• Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
• Equilibrium programming using proximal-like algorithms
• Convex analysis \& approximation of fixed points
• Title not available (Why is that?)
• Strong and weak convergence theorems for common solutions of generalized equilibrium problems and zeros of maximal monotone operators
• CONVERGENCE ANALYSIS ON HYBRID PROJECTION ALGORITHMS FOR EQUILIBRIUM PROBLEMS AND VARIATIONAL INEQUALITY PROBLEMS
• An explicit method for systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings

Cited In (1)

• Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem

This page was built for publication: Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator

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