Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
DOI10.1186/S13663-015-0319-0zbMATH Open1338.65161OpenAlexW2157566431WikidataQ59404220 ScholiaQ59404220MaRDI QIDQ288530FDOQ288530
Publication date: 26 May 2016
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13663-015-0319-0
Recommendations
- Two proximal-type algorithms for nonsmooth convex optimization over fixed point sets of nonexpansive mappings
- Parallel optimization algorithm for smooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Parallel subgradient method for nonsmooth convex optimization with a simple constraint
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
parallel algorithmfixed pointnonexpansive mapping[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Krasnosel%27ski%EF%BF%BD%EF%BF%BD-Mann+algorithm&go=Go Krasnosel'ski��-Mann algorithm]nonsmooth convex optimizationsubgradient
Numerical mathematical programming methods (65K05) Convex programming (90C25) Applications of mathematical programming (90C90)
Cites Work
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- On Projection Algorithms for Solving Convex Feasibility Problems
- Convex analysis and monotone operator theory in Hilbert spaces
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Convex Analysis
- Hard-constrained inconsistent signal feasibility problems
- Proximal Splitting Methods in Signal Processing
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- A parallel inertial proximal optimization method
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Algorithms of common solutions for variational inclusions, mixed equilibrium problems and fixed point problems
- Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation
- Distributed Subgradient Methods for Multi-Agent Optimization
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Mean Value Methods in Iteration
- Title not available (Why is that?)
- Title not available (Why is that?)
- Projected subgradient techniques and viscosity methods for optimization with variational inequality constraints
- Title not available (Why is that?)
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
- A viscosity method with no spectral radius requirements for the split common fixed point problem
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings
- Title not available (Why is that?)
- Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation
- A proximal decomposition method for solving convex variational inverse problems
- On Distributed Averaging Algorithms and Quantization Effects
- Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
- Distributed multi-agent optimization with state-dependent communication
Cited In (5)
- Serial and Parallel Computation of Karush–Kuhn–Tucker Points via Nonsmooth Equations
- Iterative methods for parallel convex optimization with fixed point constraints
- Fixed point quasiconvex subgradient method
- Two parallel distribution algorithms for convex constrained minimization problems
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
Uses Software
This page was built for publication: Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288530)
