This essay studied the stability problems of time-invariant-delay system and time-varying-delay system by constructing the Lyapunov-Razumikhn equation, in order to intuitively obtain the difference between time-invariant-delay system and time-varying-delay system, and obtain the upper bound of stability by solving a quadratic equation of one variable.
When the classical Rosen’s method is applied to solving the dual of a convex programming problem, calculating the projection gradient direction at each iteration involves solving a minimization problem of Lagrangian function. By employing any parallel algorithms, an approximate solution can be obtained, which can approach any accuracy of the optimal solution. It is illustrated that, if the sequence of accuracies are properly chosen, the value of the dual variable at the -th iterate, generated by the modified Rosen’s method, converges to the optimal solution to the dual problem and the generated sequence also converges to the optimal solution to the original convex programming problem.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.