Iterative approximation of solutions for constrained convex minimization problem
From MaRDI portal
Recommendations
- A convergence analysis result for constrained convex minimization problem
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- Approximation of solutions to constrained convex minimization problem in Hilbert spaces
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- An iterative algorithm for fixed point problem and convex minimization problem with applications
Cites work
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- scientific article; zbMATH DE number 6921240 (Why is no real title available?)
- A multiprojection algorithm using Bregman projections in a product space
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Averaged mappings and the gradient-projection algorithm
- Geometric properties of Banach spaces and nonlinear iterations
- Iterative Algorithms for Nonlinear Operators
- Iterative approximation of fixed points
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- NONEXPANSIVE NONLINEAR OPERATORS IN A BANACH SPACE
- 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
- 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 convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
Cited in
(13)- Approximation of solutions to constrained convex minimization problem in Hilbert spaces
- Mann-type approximation scheme for solving a new class of split inverse problems in Hilbert spaces
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Computing minimum norm solution of a specific constrained convex nonlinear problem
- scientific article; zbMATH DE number 687723 (Why is no real title available?)
- Convergence, stability and data dependence results for contraction and nonexpansive mappings by a new four step algorithm
- Iterative approximation for convex optimization problems with operator constraints in a Hilbert space
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- An iterative algorithm for approximating convex minimization problem
- scientific article; zbMATH DE number 2168917 (Why is no real title available?)
- scientific article; zbMATH DE number 3965827 (Why is no real title available?)
- An iterative algorithm for fixed point problem and convex minimization problem with applications
- General iterative scheme based on the regularization for solving a constrained convex minimization problem
This page was built for publication: Iterative approximation of solutions for constrained convex minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q384553)
