A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
DOI10.1080/02331934.2016.1193738zbMATH Open1384.90119OpenAlexW2515347265MaRDI QIDQ2836086FDOQ2836086
Authors: Ming Tian, Si-Wen Jiao 
Publication date: 7 December 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1193738
Recommendations
- 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 iterative algorithm for finding a common solution of equilibrium and constrained convex minimization problems
- General iterative methods for equilibrium and constrained convex minimization problem
- A general iterative method for solving constrained convex minimization problems
equilibriumfixed pointvariational inequalityconstrained convex minimizationregularization methodsgeneral iterative algorithms
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming in abstract spaces (90C48)
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
- An alternating projection that does not converge in norm
- Viscosity approximation methods for nonexpansive mappings
- 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
- Strong convergence of the CQ method for fixed point iteration processes
- Solving the split feasibility problem without prior knowledge of matrix norms
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- The relaxed CQ algorithm solving the split feasibility problem
- Generalized KM theorems and their applications
- 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
- Averaged mappings and the gradient-projection algorithm
- Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
- A general iterative algorithm for nonexpansive mappings in Hilbert spaces
- Equilibrium programming using proximal-like algorithms
- 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 (13)
- General iterative methods 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
- A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point
- A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems
- A common solution of equilibrium, constrained convex minimization and fixed point problems
- Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
- A general iterative method for solving constrained convex minimization problems
- A general iterative algorithm for finding a common solution of equilibrium and constrained convex minimization problems
- Regularized gradient-projection methods for finding the minimum-norm solution of equilibrium and the constrained convex minimization problem
- Title not available (Why is that?)
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
- Gradient methods with regularization for constrained optimization problems and their complexity estimates
- Title not available (Why is that?)
This page was built for publication: A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836086)
