Distributed constrained optimization via continuous-time mirror design
From MaRDI portal
Publication:1713810
DOI10.1186/s13662-018-1845-yzbMath1448.93015OpenAlexW2897146650WikidataQ129084178 ScholiaQ129084178MaRDI QIDQ1713810
Publication date: 30 January 2019
Published in: Advances in Difference Equations (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13662-018-1845-y
Convex programming (90C25) Nonlinear programming (90C30) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Multi-agent systems (93A16)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems
- Distributed stochastic subgradient projection algorithms for convex optimization
- Stability of primal-dual gradient dynamics and applications to network optimization
- A global linearization approach to solve nonlinear nonsmooth constrained programming problems
- Distributed gradient algorithm for constrained optimization with application to load sharing in power systems
- A geometric method in nonlinear programming
- Stochastic versions of the LaSalle theorem
- A new formulation of the fractional optimal control problems involving Mittag-Leffler nonsingular kernel
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Conditional optimization problems: fractional order case
- Lie symmetry analysis, explicit solutions and conservation laws for the space-time fractional nonlinear evolution equations
- Lie symmetry analysis, exact solutions and conservation laws for the time fractional Caudrey-Dodd-Gibbon-Sawada-Kotera equation
- Existence and discrete approximation for optimization problems governed by fractional differential equations
- A new hybrid algorithm for continuous optimization problem
- High accurate modified WENO method for the solution of Black-Scholes equation
- The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography
- Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
- Distributed Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach
- Diffusion Adaptation Strategies for Distributed Optimization and Learning Over Networks
- Adaptive Penalty-Based Distributed Stochastic Convex Optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Constrained Consensus and Optimization in Multi-Agent Networks
- An Efficient Finite Difference Method for The Time‐Delay Optimal Control Problems With Time‐Varying Delay
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Quantized Subgradient Algorithm and Data-Rate Analysis for Distributed Optimization
This page was built for publication: Distributed constrained optimization via continuous-time mirror design
