Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
From MaRDI portal
Publication:2829569
Recommendations
- Incremental proximal method for nonsmooth convex optimization with fixed point constraints of quasi-nonexpansive mappings
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Incremental subgradient methods for nondifferentiable optimization in a Hilbert space
- Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
Cites work
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- A Convergent Incremental Gradient Method with a Constant Step Size
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- A proximal decomposition method for solving convex variational inverse problems
- Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- 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
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Convex analysis and monotone operator theory in Hilbert spaces
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Incremental subgradient methods for nondifferentiable optimization
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Iterative algorithm for triple-hierarchical constrained nonconvex optimization problem and its application to network bandwidth allocation
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces
- 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
(25)- Path-based incremental target level algorithm on Riemannian manifolds
- Computation time of iterative methods for nonsmooth convex optimization with fixed point constraints of quasi-nonexpansive mappings
- Stochastic subgradient algorithm for nonsmooth nonconvex optimization
- scientific article; zbMATH DE number 2196506 (Why is no real title available?)
- Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
- Incremental gradient projection algorithm for constrained composite minimization problems
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem
- Iterative methods for parallel convex optimization with fixed point constraints
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization
- Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization
- Fixed point quasiconvex subgradient method
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- Incremental subgradient methods for nondifferentiable optimization in a Hilbert space
- Two stochastic optimization algorithms for convex optimization with fixed point constraints
- Primal-dual incremental gradient method for nonsmooth and convex optimization problems
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Nonsmooth projection-free optimization with functional constraints
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
- String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images
- Parallel subgradient method for nonsmooth convex optimization with a simple constraint
- Incremental subgradients for constrained convex optimization: A unified framework and new methods
- 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
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
This page was built for publication: Incremental subgradient method 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 Q2829569)
