Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints

DOI10.1016/j.automatica.2020.109156zbMath1448.49021OpenAlexW3046881313MaRDI QIDQ2203094

Fei Chen, Wei Ren

Publication date: 1 October 2020

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2020.109156

zbMATH Keywords

convex optimizationfinite-time convergencenonsmooth controlsign projected gradient

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Methods of reduced gradient type (90C52)

Related Items (4)

Cooperative fixed-time/finite-time distributed robust optimization of multi-agent systems ⋮ Distributed optimization for multi-agent systems with communication delays and external disturbances under a directed network ⋮ Multi-agent control: a graph-theoretic perspective ⋮ Reputation preferences resolve social dilemmas in spatial multigames

Uses Software

• CVX

Cites Work

• Finite-time convergent gradient flows with applications to network consensus
• Hamiltonian and gradient flows, algorithms and control
• Introductory lectures on convex optimization. A basic course.
• Discrete predictor-based event-triggered control of networked control systems
• Graph Implementations for Nonsmooth Convex Programs
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Necessary and sufficient conditions for a penalty method to be exact
• Inexact spectral projected gradient methods on convex sets
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Distributed Coordination of DERs With Storage for Dynamic Economic Dispatch
• Hessian Riemannian Gradient Flows in Convex Programming
• Spectral projected gradient and variable metric methods for optimization with linear inequalities
• Projected Newton Methods for Optimization Problems with Simple Constraints
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• Convex programming in Hilbert space
• On Steepest Descent
• Conditioning of Quasi-Newton Methods for Function Minimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints