Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
From MaRDI portal
(Redirected from Publication:504560)
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
Cites work
- scientific article; zbMATH DE number 6285844 (Why is no real title available?)
- A general iterative algorithm for nonexpansive mappings in Hilbert spaces
- A general iterative method for nonexpansive mappings in Hilbert spaces
- A multiprojection algorithm using Bregman projections in a product space
- An alternating projection that does not converge in norm
- An iterative approach to quadratic optimization
- Averaged mappings and the gradient-projection algorithm
- Extragradient-projection method for solving constrained convex minimization problems
- General iterative methods for equilibrium and constrained convex minimization problem
- Iterative Algorithms for Nonlinear Operators
- Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
- Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
- Nonlinear functional analysis. Fixed point theory and its applications
- Quadratic optimization of fixed points of nonexpansive mappings in hubert space
- Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
- Viscosity approximation methods for fixed-points problems
- Viscosity approximation methods for nonexpansive mappings
Cited in
(19)- Solving minimum norm problems using penalty functions and the gradient method
- On solving of constrained convex minimize problem using gradient projection method
- A gradient algorithm for finding minimum-norm solution of the split feasibility problem
- The Minimal Error Conjugate Gradient Method is a Regularization Method
- Minimizing theL∞Norm of the Gradient with an Energy Constraint
- A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem
- scientific article; zbMATH DE number 1042861 (Why is no real title available?)
- Gradient projection method with a new step size for the split feasibility problem
- A regularized gradient projection method for the minimization problem
- Approximation for the complete elliptic integral of the first kind
- A sequential constraint method for solving variational inequality over the intersection of fixed point sets
- Gradient methods with regularization for constrained optimization problems and their complexity estimates
- Inertial Haugazeau's hybrid subgradient extragradient algorithm for variational inequality problems in Banach spaces
- A first order method for finding minimal norm-like solutions of convex optimization problems
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
- Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
- Methods for solving constrained convex minimization problems and finding zeros of the sum of two operators in Hilbert spaces
- Regularized gradient-projection methods for finding the minimum-norm solution of equilibrium and the constrained convex minimization problem
- A regularized two-step projection method for constrained minimization problems
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)
