A general iterative method for solving constrained convex minimization problems

DOI10.1007/S10957-013-0413-6MaRDI QIDQ467418zbMATH OpenOpenAlexFDO

Authors Ming Tian, Min-Min Li

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

zbMATH Keywords

fixed pointnonexpansive mappingsvariational inequalityconstrained convex minimizationregularization algorithmaveraged mapping

Mathematics Subject Classification ID

Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming in abstract spaces (90C48)

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

Cites work

• scientific article; zbMATH DE number 4015993 (Why is no real title available?)
• scientific article; zbMATH DE number 47597 (Why is no real title available?)
• scientific article; zbMATH DE number 3398324 (Why is no real title available?)
• 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
• A multiprojection algorithm using Bregman projections in a product space
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• Averaged mappings and the gradient-projection algorithm
• Iterative methods for finding minimum-norm fixed points of nonexpansive mappings with applications
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Strong convergence of composite iterative methods for equilibrium problems and fixed point problems

Cited in

(16)

• Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem
• Extragradient-projection method for solving constrained convex minimization problems
• A regularized gradient projection method for the minimization problem
• 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
• scientific article; zbMATH DE number 3965827 (Why is no real title available?)
• A hybrid gradient-projection algorithm for averaged mappings in Hilbert spaces
• scientific article; zbMATH DE number 2168917 (Why is no real title available?)
• Iterative methods for constrained convex minimization problem in Hilbert spaces
• General iterative scheme based on the regularization for solving a constrained convex minimization problem
• Variant gradient projection methods for the minimization problems
• A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
• Generalized \(\gamma\)-valid cut procedure for concave minimization
• A general iterative method for minimizing the sum of two convex functions
• Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem

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)