Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
From MaRDI portal
Abstract: The problem of minimizing the sum of nonsmooth, convex objective functions defined on a real Hilbert space over the intersection of fixed point sets of nonexpansive mappings, onto which the projections cannot be efficiently computed, is considered. The use of proximal point algorithms that use the proximity operators of the objective functions and incremental optimization techniques is proposed for solving the problem. With the focus on fixed point approximation techniques, two algorithms are devised for solving the problem. One blends an incremental subgradient method, which is a useful algorithm for nonsmooth convex optimization, with a Halpern-type fixed point iteration algorithm. The other is based on an incremental subgradient method and the Krasnosel'skiui-Mann fixed point algorithm. It is shown that any weak sequential cluster point of the sequence generated by the Halpern-type algorithm belongs to the solution set of the problem and that there exists a weak sequential cluster point of the sequence generated by the Krasnosel'skiui-Mann-type algorithm, which also belongs to the solution set. Numerical comparisons of the two proposed algorithms with existing subgradient methods for concrete nonsmooth convex optimization show that the proposed algorithms achieve faster convergence.
Recommendations
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Two proximal-type algorithms for nonsmooth convex optimization over fixed point sets of nonexpansive mappings
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- Incremental proximal method for nonsmooth convex optimization with fixed point constraints of quasi-nonexpansive mappings
- Two stochastic optimization algorithms for convex optimization with fixed point constraints
Cites work
- scientific article; zbMATH DE number 3933858 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- 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 block-iterative surrogate constraint splitting method for quadratic signal recovery
- A class of randomized primal-dual algorithms for distributed optimization
- A theorem on maximal monotonic sets in Hilbert space
- A viscosity method with no spectral radius requirements for the split common fixed point problem
- Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
- Algorithms of common solutions for variational inclusions, mixed equilibrium problems and fixed point problems
- Approximate methods for convex minimization problems with series-parallel structure
- Approximation of fixed points of nonexpansive mappings
- 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
- Cooperative distributed multi-agent optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Error stability properties of generalized gradient-type algorithms
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Fixed points of nonexpanding maps
- Hard-constrained inconsistent signal feasibility problems
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Incremental subgradient methods for nondifferentiable optimization
- Incremental subgradients for constrained convex optimization: A unified framework and new methods
- Iterative approximation of fixed points
- Mean Value Methods in Iteration
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Monotone Operators and the Proximal Point Algorithm
- On Distributed Averaging Algorithms and Quantization Effects
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
- Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
- Projected subgradient techniques and viscosity methods for optimization with variational inequality constraints
- Proximal splitting methods in signal processing
- Robust Wideband Beamforming by the Hybrid Steepest Descent Method
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
- VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(20)- Computing proximal points of nonconvex functions
- Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization
- Two proximal-type algorithms for nonsmooth convex optimization over fixed point sets of nonexpansive mappings
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization
- Two new self-adaptive algorithms for solving the split common null point problem with multiple output sets in Hilbert spaces
- Iterative methods for parallel convex optimization with fixed point constraints
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- Fixed point quasiconvex subgradient method
- A new iteration technique for nonlinear operators as concerns convex programming and feasibility problems
- The landscape of the proximal point method for nonconvex-nonconcave minimax optimization
- Two stochastic optimization algorithms for convex optimization with fixed point constraints
- Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints
- Incremental proximal method for nonsmooth convex optimization with fixed point constraints of quasi-nonexpansive mappings
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Proximal point algorithms for zero points of nonlinear operators
- Decentralized hierarchical constrained convex optimization
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- Non-Convex feasibility problems and proximal point methods
This page was built for publication: Proximal point algorithms for nonsmooth 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 Q323195)
