A general iterative method for solving constrained convex minimization problems
DOI10.1007/S10957-013-0413-6zbMATH Open1298.90073OpenAlexW1991274744MaRDI QIDQ467418FDOQ467418
Publication date: 3 November 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0413-6
Recommendations
- A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
- General iterative scheme based on the regularization for solving a constrained convex minimization problem
- Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
fixed pointnonexpansive mappingsvariational inequalityconstrained convex minimizationregularization algorithmaveraged mapping
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Iterative methods for finding minimum-norm fixed points of nonexpansive mappings with applications
- Averaged mappings and the gradient-projection algorithm
- A general iterative algorithm for nonexpansive mappings in Hilbert spaces
- A hybrid approximation method for equilibrium and fixed point problems for a monotone mapping and a nonexpansive mapping
- Strong convergence of composite iterative methods for equilibrium problems and fixed point problems
Cited In (6)
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- A general iterative scheme with applications to convex optimization and related fields
- An iterative algorithm for approximating convex minimization problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized \(\gamma\)-valid cut procedure for concave minimization
This page was built for publication: A general iterative method for solving constrained convex minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q467418)
