Iterative schemes for convex minimization problems with constraints
From MaRDI portal
Recommendations
- Convex minimization with constraints of systems of variational inequalities, mixed equilibrium, variational inequality, and fixed point problems
- Some iterative algorithms for constrained convex minimization, generalized mixed equilibrium and fixed point problems
- A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems
- Solving generalized mixed equilibria, variational inequalities, and constrained convex minimization
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
Cites work
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- A hybrid iterative scheme for mixed equilibrium problems and fixed point problems
- A new completely general class of variational inclusions with noncompact valued mappings
- A new hybrid-extragradient method for generalized mixed equilibrium problems, fixed point problems and variational inequality problems
- A relaxed extragradient-like method for a generalized mixed equilibrium problem, a general system of generalized equilibria and a fixed point problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Algorithms of common solutions for generalized mixed equilibria, variational inclusions, and constrained convex minimization
- Averaged mappings and the gradient-projection algorithm
- Characterization of \(H\)-monotone operators with applications to variational inclusions
- Convergence of hybrid steepest-descent methods for variational inequalities
- Convergence theorem for equilibrium problems and fixed point problems of infinite family of nonexpansive mappings
- Hybrid extragradient-like methods for generalized mixed equilibrium problems, systems of generalized equilibrium problems and optimization problems
- Iterative approaches to convex feasibility problems in Banach spaces
- Mann type hybrid extragradient method for variational inequalities, variational inclusions and fixed point problems
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
Cited in
(12)- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Iterative approximation for convex optimization problems with operator constraints in a Hilbert space
- 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?)
- General iterative algorithms for solving unconstrained convex optimization problems
- scientific article; zbMATH DE number 4101955 (Why is no real title available?)
- A scheme of iterative minimization methods
- scientific article; zbMATH DE number 2168917 (Why is no real title available?)
- Iterative methods for parallel convex optimization with fixed point constraints
- Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
- Iterative Optimization with Equality Constraints
This page was built for publication: Iterative schemes for convex minimization problems with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1722348)
