Methods for solving constrained convex minimization problems and finding zeros of the sum of two operators in Hilbert spaces
From MaRDI portal
(Redirected from Publication:264970)
Recommendations
- Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
- Iterative algorithms with the regularization for the constrained convex minimization problem and maximal monotone operators
- Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
- A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces
- Weak convergence theorems for split feasibility problems on zeros of the sum of monotone operators and fixed point sets in Hilbert spaces
Cites work
- A general iterative method for hierarchical variational inequality problems in Hilbert spaces and applications
- A general iterative method for nonexpansive mappings in Hilbert spaces
- A multiprojection algorithm using Bregman projections in a product space
- A unified hybrid iterative method for hierarchical minimization problems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- An alternating projection that does not converge in norm
- Approximating zero points of accretive operators in general Banach spaces
- Averaged mappings and the gradient-projection algorithm
- Construction of fixed points of nonlinear mappings in Hilbert space
- Convergence theorems of fixed points for \(\kappa \)-strict pseudo-contractions in Hilbert spaces
- Extragradient-projection method for solving constrained convex minimization problems
- General iterative methods for equilibrium and constrained convex minimization problem
- Generalized KM theorems and their applications
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
- Multistep hybrid extragradient method for triple hierarchical variational inequalities
- Nonlinear functional analysis. Fixed point theory and its applications
- On a strongly nonexpansive sequence in Hilbert spaces
- On the maximal monotonicity of subdifferential mappings
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Strong convergence of composite iterative schemes for zeros of \(m\)-accretive operators in Banach spaces
- Strong convergence theorems for maximal monotone operators with nonlinear mappings in Hilbert spaces
- Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
- Viscosity approximation methods for fixed-points problems
- Viscosity approximation methods for nonexpansive mappings
- Viscosity approximation methods for strongly positive and monotone operators
Cited in
(4)- Inertial hybrid algorithm for variational inequality problems in Hilbert spaces
- Iterative algorithms with the regularization for the constrained convex minimization problem and maximal monotone operators
- Projection and contraction methods for constrained convex minimization problem and the zero points of maximal monotone operator
- Inertial Haugazeau's hybrid subgradient extragradient algorithm for variational inequality problems in Banach spaces
This page was built for publication: Methods for solving constrained convex minimization problems and finding zeros of the sum of two operators in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264970)
