Pages that link to "Item:Q2018475"
From MaRDI portal
The following pages link to Gradient-free method for nonsmooth distributed optimization (Q2018475):
Displaying 15 items.
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm (Q1653265) (← links)
- Stochastic mirror descent method for distributed multi-agent optimization (Q1670526) (← links)
- Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks (Q1694193) (← links)
- An objective penalty function-based method for inequality constrained minimization problem (Q1721383) (← links)
- Distributed convex optimization with coupling constraints over time-varying directed graphs (Q1983757) (← links)
- Gradient-free distributed optimization with exact convergence (Q2165968) (← links)
- Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs (Q2181641) (← links)
- Sparsity-promoting distributed charging control for plug-in electric vehicles over distribution networks (Q2295316) (← links)
- A fully distributed ADMM-based dispatch approach for virtual power plant problems (Q2295330) (← links)
- Incremental gradient-free method for nonsmooth distributed optimization (Q2411165) (← links)
- Distributed subgradient method for multi-agent optimization with quantized communication (Q2978003) (← links)
- Strong consistency of random gradient‐free algorithms for distributed optimization (Q5346596) (← links)
- A gradient‐free distributed optimization method for convex sum of nonconvex cost functions (Q6069332) (← links)
