Iterative methods for parallel convex optimization with fixed point constraints
From MaRDI portal
(Redirected from Publication:5244136)
Recommendations
- scientific article; zbMATH DE number 1046042
- Parallel optimization algorithm for smooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Parallel interior point schemes for solving multistage convex programming
- Iterative schemes for convex minimization problems with constraints
- A Parallel Algorithm for a Class of Convex Programs
- A parallel descent algorithm for convex programming
- scientific article; zbMATH DE number 3892945
- Parallel algorithms for variational inclusions and fixed points with applications
- Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
Cites work
- scientific article; zbMATH DE number 3192366 (Why is no real title available?)
- scientific article; zbMATH DE number 3108780 (Why is no real title available?)
- A theorem on maximal monotonic sets in Hilbert space
- Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
- Approximation of fixed points of nonexpansive mappings
- Computational method for solving a stochastic linear-quadratic control problem given an unsolvable stochastic algebraic Riccati equation
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Convex analysis and monotone operator theory in Hilbert spaces
- Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Fixed points of nonexpanding maps
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Iterative approximation of fixed points
- Mean Value Methods in Iteration
- Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
- The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(11)- Approximate methods for convex minimization problems with series-parallel structure
- Serial and Parallel Computation of Karush–Kuhn–Tucker Points via Nonsmooth Equations
- Computation time of iterative methods for nonsmooth convex optimization with fixed point constraints of quasi-nonexpansive mappings
- A fixed point result for mean nonexpansive mappings
- scientific article; zbMATH DE number 3965827 (Why is no real title available?)
- scientific article; zbMATH DE number 1046042 (Why is no real title available?)
- Iterative algorithms for system of variational inclusions in Hadamard manifolds
- Two stochastic optimization algorithms for convex optimization with fixed point constraints
- scientific article; zbMATH DE number 1530366 (Why is no real title available?)
- Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints
- PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS
This page was built for publication: Iterative methods for parallel convex optimization with fixed point constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244136)
