Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints
From MaRDI portal
Publication:2073009
DOI10.1186/s13660-021-02734-4zbMath1490.90220OpenAlexW4200275590MaRDI QIDQ2073009
Tipsuda Arunrat, Nimit Nimana, Nawarat Ekkarntrong
Publication date: 26 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-021-02734-4
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Monotone operators and generalizations (47H05) Numerical methods based on nonlinear programming (49M37)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- Iterative methods for fixed point problems in Hilbert spaces
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets
- Convergence analysis for proximal split feasibility problems and fixed point problems
- Extension of Fenchel's duality theorem for convex functions
- Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings
- Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation
- Robust Wideband Beamforming by the Hybrid Steepest Descent Method
- Hierarchical Convex Optimization With Primal-Dual Splitting
- First-Order Methods in Optimization
- An efficient iterative method for finding common fixed point and variational inequalities in Hilbert spaces
- Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation
- A descent SQP alternating direction method for minimizing the sum of three convex functions
- Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions
- Iterative methods for parallel convex optimization with fixed point constraints
- Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- Convex analysis and monotone operator theory in Hilbert spaces
