Abstract
ABSTRACT In this paper, generalized predefined/prescribed‐time stability theory is first put forward, where i) the powers of the upper bound of the derivative of Lyapunov function are no longer confined to and with ; ii) the upper bound of the settling‐time function is simplified and directly deduced by Euler's reflection formula. In addition, the upper bound of the settling‐time function is still irrelevant to the initial states, and can be arbitrarily tuned in advance. As an application, a predefined/prescribed‐time algorithm is proposed for solving the nonconvex‐nonconcave min‐max optimization issue. Under the two‐sided Polyak‐Lojasiewicz (PL) inequality and the Lipschitz continuous gradient, a new dynamical system is established to ensure that the solution of the dynamic system can reach the saddle point of the min‐max optimization issue in a predefined/prescribed time. Two examples are applied to validate the predefined/prescribed‐time algorithm of nonconvex‐nonconcave min‐max optimization.
Affiliated Institutions
Related Publications
On the Maximum Common Rate Achievable in a Coordinated Network
We quantify the ultimate performance limits of inter-cell coordinatation in a cellular downlink network. The goal is to achieve fairness by maximizing the minimum rate in the ne...
An Analysis of Several Heuristics for the Traveling Salesman Problem
Several polynomial time algorithms finding “good,” but not necessarily optimal, tours for the traveling salesman problem are considered. We measure the closeness of a tour by th...
How much training is needed in multiple-antenna wireless links?
Multiple-antenna wireless communication links promise very high data rates with low error probabilities, especially when the wireless channel response is known at the receiver. ...
Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy
In this paper, a new algorithm for computing optimal (s, S) policies is derived based upon a number of new properties of the infinite horizon cost function c(s, S) as well as a ...
Fractional Programming for Communication Systems—Part I: Power Control and Beamforming
This two-part paper explores the use of FP in the design and optimization of communication systems. Part I of this paper focuses on FP theory and on solving continuous problems....
Publication Info
- Year
- 2025
- Type
- article
- Citations
- 0
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
0
OpenAlex
Cite This
Zhibao Song
(2025).
Predefined/Prescribed‐Time Convergence Algorithm of Nonconvex‐Nonconcave Min‐Max Optimization.
International Journal of Robust and Nonlinear Control
.
https://doi.org/10.1002/rnc.70328
Identifiers
- DOI
- 10.1002/rnc.70328