A convergence analysis result for constrained convex minimization problem

DOI10.1080/02331934.2013.840620MaRDI QIDQ3453420zbMATH OpenOpenAlexFDO

Authors Y. Shehu

Publication date 27 November 2015

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2013.840620

zbMATH Keywords

constrained convex minimizationgradient-projection methodstrong convergence

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)

Recommendations

• Convergence analysis of some methods for minimizing a nonsmooth convex function
• Convergence of some algorithms for convex minimization
• scientific article; zbMATH DE number 4193471
• Convergence of discrete approximations for constrained minimization
• A Convergent Procedure for Convex Programming
• scientific article; zbMATH DE number 854129
• Convergence of the constrained gradient method for a class of nonconvex functions
• CONVERGENCE PROOF OF COORDINATEWISE MINIMIZATION ALGORITHM FOR CONVEX PROGRAMMING PROBLEM WITH UPPER AND LOWER BOUNDED CONSTRAINTS
• Corrigendum
• Convergence analysis of a class of penalty methods for vector optimization problems with cone constraints

Cites work

• A regularized gradient projection method for the minimization problem
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Averaged mappings and the gradient-projection algorithm
• Convergence of the gradient projection method for generalized convex minimization
• Convergence properties of projection and contraction methods for variational inequality problems
• scientific article; zbMATH DE number 1971602 (Why is no real title available?)
• Iterative solution of nonlinear equations involving set-valued uniformly accretive operators.
• Projected gradient methods for linearly constrained problems
• Projection methods for variational inequalities with application to the traffic assignment problem
• Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
• Some iterative methods for finding fixed points and for solving constrained convex minimization problems
• Strong convergence theorems for resolvents of accretive operators in Banach spaces
• Two-Metric Projection Methods for Constrained Optimization

Cited in

(7)

• A convergence analysis for a convex version of Dikin's algorithm
• Iterative approximation of solutions for constrained convex minimization problem
• Approximation of solutions to constrained convex minimization problem in Hilbert spaces
• scientific article; zbMATH DE number 7201315 (Why is no real title available?)
• Descent methods with computational errors in Banach spaces
• Corrigendum
• Stability of the asymptotic behavior for continuous descent methods with a convex objective function

This page was built for publication: A convergence analysis result for constrained convex minimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453420)