2021
DOI: 10.1109/tac.2020.3001436
|View full text |Cite
|
Sign up to set email alerts
|

Fixed-Time Stable Gradient Flows: Applications to Continuous-Time Optimization

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 69 publications
(33 citation statements)
references
References 32 publications
0
25
0
Order By: Relevance
“…We mentioned the extension to Riemannian manifolds, which should be quite straightforward. More interestingly, finite-and fixed-time gradient flows [5,26] may also be studied on open subsets and, most importantly in the current context, from the point of view of finite and fixed-time ISS in the sense of e.g. [10,21,9].…”
Section: Discussionmentioning
confidence: 99%
“…We mentioned the extension to Riemannian manifolds, which should be quite straightforward. More interestingly, finite-and fixed-time gradient flows [5,26] may also be studied on open subsets and, most importantly in the current context, from the point of view of finite and fixed-time ISS in the sense of e.g. [10,21,9].…”
Section: Discussionmentioning
confidence: 99%
“…In [27], the authors design a modified gradient flow scheme with fixed-time convergence guarantees assuming that the objective function is strongly convex. In [17], modified gradient flow schemes are introduced for unconstrained and constrained convex optimization problems, as well as for min-max problems posed as convex-concave optimization problems. The work in [17] only considered linear equality constraints, and assumed that the objective function is continuously differentiable, and satisfies strong or strict convexity, or is gradient-dominated.…”
Section: Mathematics Subject Classification (2000) 34d20 • 37n40 • 47...mentioning
confidence: 99%
“…In [17], modified gradient flow schemes are introduced for unconstrained and constrained convex optimization problems, as well as for min-max problems posed as convex-concave optimization problems. The work in [17] only considered linear equality constraints, and assumed that the objective function is continuously differentiable, and satisfies strong or strict convexity, or is gradient-dominated. The schemes proposed in this paper apply to a broader class of problems, namely, MVIPs, and non-smooth convex optimization problems arise as special cases of the general framework considered in this paper.…”
Section: Mathematics Subject Classification (2000) 34d20 • 37n40 • 47...mentioning
confidence: 99%
See 1 more Smart Citation
“…The ability to reach the optimum of a cost function of interest in a prescribed time can provide added flexibility in engineering design problems requiring precise synchronous control tasks. In continuous-time systems, gradient-based descent algorithms have been proposed 1,2,3 . In 2,3 1 a class of discontinuous scaled gradient/Hessian dynamical systems was proposed for the design of continuous-time optimization algorithms with finite-time convergence.…”
Section: Introductionmentioning
confidence: 99%