Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
From MaRDI portal
Publication:2017669
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
- Regularized gradient-projection algorithm for solving one-parameter nonexpansive semigroup, constrained convex minimization and generalized equilibrium problems
- 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
Cites work
- scientific article; zbMATH DE number 5305574 (Why is no real title available?)
- scientific article; zbMATH DE number 1090020 (Why is no real title available?)
- scientific article; zbMATH DE number 2182576 (Why is no real title available?)
- 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 note on the CQ algorithm for the split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- An alternating projection that does not converge in norm
- An explicit method for systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings
- Approximating zero points of accretive operators in general Banach spaces
- Averaged mappings and the gradient-projection algorithm
- CONVERGENCE ANALYSIS ON HYBRID PROJECTION ALGORITHMS FOR EQUILIBRIUM PROBLEMS AND VARIATIONAL INEQUALITY PROBLEMS
- Convex analysis \& approximation of fixed points
- Equilibrium programming using proximal-like algorithms
- 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
- Iterative oblique projection onto convex sets and the split feasibility problem
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
- Nonlinear functional analysis. Fixed point theory and its applications
- Solving the split feasibility problem without prior knowledge of matrix norms
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Strong and weak convergence theorems for common solutions of generalized equilibrium problems and zeros of maximal monotone operators
- Strong convergence theorems for maximal monotone operators with nonlinear mappings in Hilbert spaces
- The relaxed CQ algorithm solving the split feasibility problem
- Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
- Viscosity approximation methods for fixed-points problems
Cited in
(4)- Methods for solving constrained convex minimization problems and finding zeros of the sum of two operators in Hilbert spaces
- Projection and contraction methods for 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
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)
