Approximation of solutions to constrained convex minimization problem in Hilbert spaces
From MaRDI portal
(Redirected from Publication:496478)
Recommendations
- A convergence analysis result for constrained convex minimization problem
- Iterative approximation of solutions for constrained convex minimization problem
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- A general approximation method for a kind of convex optimization problems in Hilbert spaces
- Iterative approximation for convex optimization problems with operator constraints in a Hilbert space
Cites work
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 3958059 (Why is no real title available?)
- scientific article; zbMATH DE number 6921240 (Why is no real title available?)
- scientific article; zbMATH DE number 3923 (Why is no real title available?)
- A note on the gradient projection method with exact stepsize rule
- 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
- Geometric properties of Banach spaces and nonlinear iterations
- Hankel determinant for a class of analytic functions involving a generalized linear differential operator
- Iterative approximation of fixed points
- Nonlinear optimization.
- 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
- Shorter Notes: Some Operator Monotone Functions
- 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
- Two-Metric Projection Methods for Constrained Optimization
- Variant gradient projection methods for the minimization problems
Cited in
(5)- Iterative approximation for convex optimization problems with operator constraints in a Hilbert space
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- Iterative approximation of solutions for constrained convex minimization problem
- A general approximation method for a kind of convex optimization problems in Hilbert spaces
- A viscosity-proximal gradient method with inertial extrapolation for solving certain minimization problems in Hilbert space.
This page was built for publication: Approximation of solutions to constrained convex minimization problem in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496478)
