Iterative methods for parallel convex optimization with fixed point constraints
From MaRDI portal
Publication:5244136
DOI10.23952/JNVA.3.2019.2.01zbMATH Open1433.90116OpenAlexW4250090602MaRDI QIDQ5244136FDOQ5244136
Takayuki Jimba, Kaito Sakurai, Hideaki Iiduka
Publication date: 20 November 2019
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.23952/jnva.3.2019.2.01
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
- Convex analysis and monotone operator theory in Hilbert spaces
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
- Fixed points of nonexpanding maps
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Title not available (Why is that?)
- The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces
- Approximation of fixed points of nonexpansive mappings
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Mean Value Methods in Iteration
- Title not available (Why is that?)
- Iterative approximation of fixed points
- A theorem on maximal monotonic sets in Hilbert space
- Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
- Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation
- Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions
Cited In (9)
- Approximate methods for convex minimization problems with series-parallel structure
- Serial and Parallel Computation of Karush–Kuhn–Tucker Points via Nonsmooth Equations
- A fixed point result for mean nonexpansive mappings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Iterative algorithms for system of variational inclusions in Hadamard manifolds
- Title not available (Why is that?)
- 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)
