Pages that link to "Item:Q467418"
From MaRDI portal
The following pages link to A general iterative method for solving constrained convex minimization problems (Q467418):
Displaying 13 items.
- A regularized gradient projection method for the minimization problem (Q410905) (← links)
- Extragradient-projection method for solving constrained convex minimization problems (Q428477) (← links)
- Variant gradient projection methods for the minimization problems (Q448815) (← links)
- Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem (Q504560) (← links)
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems (Q555046) (← links)
- Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem (Q1725170) (← links)
- A hybrid gradient-projection algorithm for averaged mappings in Hilbert spaces (Q1760833) (← links)
- Generalized \(\gamma\)-valid cut procedure for concave minimization (Q1807817) (← links)
- An iterative algorithm for approximating convex minimization problem (Q2371476) (← links)
- A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems (Q2836086) (← links)
- A general iterative scheme with applications to convex optimization and related fields (Q3361812) (← links)
- (Q3734173) (← links)
- (Q4675032) (← links)
