Distributed subgradient methods for non-convex non-smooth constrained optimization problems
From MaRDI portal
Cites work
- A bundle-Newton method for nonsmooth unconstrained minimization
- A Convergent Incremental Gradient Method with a Constant Step Size
- A Fixed Point Theorem for Asymptotically Nonexpansive Mappings
- A new trust region method for nonsmooth nonconvex optimization
- A parallel inertial proximal optimization method
- A proximal bundle algorithm for nonsmooth optimization on Riemannian manifolds
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A trust region algorithm for minimization of locally Lipschitzian functions
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex Optimization in Signal Processing and Communications
- Cooperative distributed multi-agent optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Distributed Optimization With Local Domains: Applications in MPC and Network Flows
- Distributed Subgradient Methods for Multi-Agent Optimization
- Error stability properties of generalized gradient-type algorithms
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Functional analysis, Sobolev spaces and partial differential equations
- Generalized Monotone Maps
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 3108780 (Why is no real title available?)
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Incremental subgradient methods for nondifferentiable optimization
- Introduction to nonsmooth optimization. Theory, practice and software
- Iterative approximation of fixed points
- Iterative construction of the resolvent of a sum of maximal monotone operators
- Joint Multicast Beamforming and Antenna Selection
- Lectures on convex optimization
- Mean Value Methods in Iteration
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Multi-agent reinforcement learning: a selective overview of theories and algorithms
- Nonsmooth analysis
- Nonsmooth optimization via quasi-Newton methods
- Numerical Optimization
- On Distributed Averaging Algorithms and Quantization Effects
- Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings
- Prox-regular functions in variational analysis
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- Proximal splitting methods in signal processing
- Real and complex monotone communication games
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- Semidefinite programs for completely bounded norms
- Signal Recovery by Proximal Forward-Backward Splitting
- The solution by iteration of nonlinear functional equations in Banach spaces
- Variational Analysis
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
This page was built for publication: Distributed subgradient methods for non-convex non-smooth constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7404330)
