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

DOI10.1186/S13660-016-1289-4zbMATH Open1357.58024OpenAlexW2568992082WikidataQ41081466 ScholiaQ41081466MaRDI QIDQ504560FDOQ504560

Authors: Ming Tian, Hui-Fang Zhang 

Publication date: 17 January 2017

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-016-1289-4

Recommendations

• Regularized gradient-projection methods for finding the minimum-norm solution of equilibrium and the constrained convex minimization problem
• A regularized gradient projection method for the minimization problem
• A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem
• A general iterative method for solving constrained convex minimization problems
• On solving of constrained convex minimize problem using gradient projection method

zbMATH Keywords

variational inequalityminimum-normregularized gradient-projection methodthe constrained convex minimization problem

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) 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
• Title not available (Why is that?)
• An iterative approach to quadratic optimization
• 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
• An alternating projection that does not converge in norm
• Viscosity approximation methods for nonexpansive mappings
• Viscosity approximation methods for fixed-points problems
• A general iterative method for nonexpansive mappings in Hilbert spaces
• Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
• Iterative Algorithms for Nonlinear Operators
• Extragradient-projection method for solving constrained convex minimization problems
• General iterative methods for equilibrium and constrained convex minimization problem
• Some iterative methods for finding fixed points and for solving constrained convex minimization problems
• Averaged mappings and the gradient-projection algorithm
• A general iterative algorithm for nonexpansive mappings in Hilbert spaces
• 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
• Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
• Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator

Cited In (19)

• Gradient projection method with a new step size for the split feasibility problem
• Inertial Haugazeau's hybrid subgradient extragradient algorithm for variational inequality problems in Banach spaces
• Methods for solving constrained convex minimization problems and finding zeros of the sum of two operators in Hilbert spaces
• A regularized two-step projection method for constrained minimization problems
• On solving of constrained convex minimize problem using gradient projection method
• A regularized gradient projection method for the minimization problem
• Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
• A sequential constraint method for solving variational inequality over the intersection of fixed point sets
• A gradient algorithm for finding minimum-norm solution of the split feasibility problem
• The Minimal Error Conjugate Gradient Method is a Regularization Method
• Approximation for the complete elliptic integral of the first kind
• A first order method for finding minimal norm-like solutions of convex optimization problems
• A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem
• On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
• Solving minimum norm problems using penalty functions and the gradient method
• Regularized gradient-projection methods for finding the minimum-norm solution of equilibrium and the constrained convex minimization problem
• Minimizing theL^∞Norm of the Gradient with an Energy Constraint
• Title not available (Why is that?)
• Gradient methods with regularization for constrained optimization problems and their complexity estimates

This page was built for publication: Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem

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