Fixed-Time Algorithms for Time-Varying Convex Optimization
To resolve the time-varying convex optimization problems with the cost function, the constraints or both being time dependent, in this brief we investigate a novel type of fixed-time algorithms. First, with the unconstrained time-varying optimization problem considered, a general framework algorithm...
Saved in:
Published in | IEEE transactions on circuits and systems. II, Express briefs Vol. 70; no. 2; pp. 616 - 620 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.02.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | To resolve the time-varying convex optimization problems with the cost function, the constraints or both being time dependent, in this brief we investigate a novel type of fixed-time algorithms. First, with the unconstrained time-varying optimization problem considered, a general framework algorithm is developed for tracking its optimal trajectory within fixed time, which contains the gradient flow-based scheme and Newton-type method as its special cases. Then, considering the equality constraint being involved in the time-varying optimization problem, we design another algorithm with fixed-time convergence, which includes Newton-type scheme as its special case. To verify that the given approach achieves fixed-time convergence, the simulation result is given with first-order Euler discretization. |
---|---|
AbstractList | To resolve the time-varying convex optimization problems with the cost function, the constraints or both being time dependent, in this brief we investigate a novel type of fixed-time algorithms. First, with the unconstrained time-varying optimization problem considered, a general framework algorithm is developed for tracking its optimal trajectory within fixed time, which contains the gradient flow-based scheme and Newton-type method as its special cases. Then, considering the equality constraint being involved in the time-varying optimization problem, we design another algorithm with fixed-time convergence, which includes Newton-type scheme as its special case. To verify that the given approach achieves fixed-time convergence, the simulation result is given with first-order Euler discretization. |
Author | Wang, He Jiang, Guo-Ping Yu, Wenwu Hong, Huifen |
Author_xml | – sequence: 1 givenname: Huifen orcidid: 0000-0002-0649-8116 surname: Hong fullname: Hong, Huifen email: honghuifen@njupt.edu.cn organization: College of Automation, College of Artificial Intelligence, and the Jiangsu Engineering Lab for IOT Intelligent Robots, Nanjing University of Posts and Telecommunications, Nanjing, China – sequence: 2 givenname: Wenwu orcidid: 0000-0001-6406-2399 surname: Yu fullname: Yu, Wenwu email: wwyu@seu.edu.cn organization: School of Automation and Electrical Engineering, Linyi University, Linyi, China – sequence: 3 givenname: Guo-Ping orcidid: 0000-0001-9448-0989 surname: Jiang fullname: Jiang, Guo-Ping email: jianggp@njupt.edu.cn organization: College of Automation, College of Artificial Intelligence, and the Jiangsu Engineering Lab for IOT Intelligent Robots, Nanjing University of Posts and Telecommunications, Nanjing, China – sequence: 4 givenname: He surname: Wang fullname: Wang, He email: wanghe@seu.edu.cn organization: School of Mathematics, Southeast University, Nanjing, China |
BookMark | eNo9kNFLwzAQxoNMcJv-A_pS8LnzkrRJ49soTgeDPTh9Dem8zIy1mUkn07_e1olwcMfxffcdvxEZNL5BQq4pTCgFdbcqn-fzCQPGJpyBZLI4I0Oa50XKpaKDfs5UKmUmL8goxi0AU8DZkNzP3BHf0pWrMZnuNj649r2OifUh6XfpqwlfrtkkpW8-8Zgs962r3bdpnW8uybk1u4hXf31MXmYPq_IpXSwf5-V0ka6Zytt0bSk1BVXIRYEIrALIpahslmXCChQ5GC6RCltVICpmrLR5QTNuKEghUfAxuT3d3Qf_ccDY6q0_hKaL1ExKmvMMKHQqdlKtg48xoNX74Orue01B94z0LyPdM9J_jDrTzcnkEPHfoArFu-I_q85jPw |
CODEN | ITCSFK |
CitedBy_id | crossref_primary_10_1109_TAC_2023_3335004 crossref_primary_10_1109_TII_2024_3353848 crossref_primary_10_1109_TCSII_2023_3287182 crossref_primary_10_1088_1674_1056_aceeeb |
Cites_doi | 10.1016/j.automatica.2006.06.015 10.1109/TAC.2009.2028959 10.1109/TAC.2011.2179869 10.1109/72.641452 10.1016/j.automatica.2020.109289 10.1109/TCSII.2018.2886298 10.1109/TAC.2020.3001436 10.1109/TSMC.2016.2623634 10.3182/20130925-2-DE-4044.00055 10.1016/j.automatica.2018.05.032 10.1109/TAC.2016.2593899 10.1109/JPROC.2020.3003156 10.1017/CBO9780511804441 10.1109/TSP.2017.2728498 10.1137/S0363012903425593 10.1109/TAC.2017.2760256 10.1109/TAC.2017.2673240 10.1109/TSP.2016.2568161 10.1109/TAC.2014.2298140 10.1137/090762634 10.1109/CDC.2011.6161503 10.1109/TCSII.2017.2661380 10.1016/j.automatica.2015.01.021 10.1109/TCST.2016.2519838 10.1080/03081088708817789 |
ContentType | Journal Article |
Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023 |
Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023 |
DBID | 97E RIA RIE AAYXX CITATION 7SP 8FD L7M |
DOI | 10.1109/TCSII.2022.3207278 |
DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998-Present IEEE Xplore CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace |
DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts |
DatabaseTitleList | Technology Research Database |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISSN | 1558-3791 |
EndPage | 620 |
ExternalDocumentID | 10_1109_TCSII_2022_3207278 9893893 |
Genre | orig-research |
GrantInformation_xml | – fundername: Natural Science Foundation of Jiangsu Province grantid: BK20210591; BK20210216 funderid: 10.13039/501100004608 – fundername: National Natural Science Foundation of China grantid: 62233004; 61873326; 62073076; 62203112; 62203232 funderid: 10.13039/501100001809 – fundername: Smart Grid Joint Fund of State Key Program of National Natural Science Foundation of China grantid: U2066203 funderid: 10.13039/501100001809 – fundername: University Science Research Project of Jiangsu Province grantid: 21KJB510044 funderid: 10.13039/501100018615 |
GroupedDBID | 0R~ 29I 4.4 5VS 6IK 6J9 97E AAJGR AASAJ ABQJQ ABVLG ACIWK AETIX AIBXA AKJIK ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD IFIPE IPLJI JAVBF M43 OCL PZZ RIA RIE RIG RNS RXW TAE TAF VJK XFK AAYXX CITATION 7SP 8FD L7M |
ID | FETCH-LOGICAL-c295t-cf11a819e368ee02b00576bf4446f6e650a37e16fbb06b2af7f58143a10767e63 |
IEDL.DBID | RIE |
ISSN | 1549-7747 |
IngestDate | Thu Oct 10 18:21:44 EDT 2024 Fri Aug 23 00:45:06 EDT 2024 Wed Jun 26 19:28:41 EDT 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 2 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c295t-cf11a819e368ee02b00576bf4446f6e650a37e16fbb06b2af7f58143a10767e63 |
ORCID | 0000-0001-9448-0989 0000-0001-6406-2399 0000-0002-0649-8116 |
PQID | 2771534010 |
PQPubID | 85412 |
PageCount | 5 |
ParticipantIDs | proquest_journals_2771534010 crossref_primary_10_1109_TCSII_2022_3207278 ieee_primary_9893893 |
PublicationCentury | 2000 |
PublicationDate | 2023-02-01 |
PublicationDateYYYYMMDD | 2023-02-01 |
PublicationDate_xml | – month: 02 year: 2023 text: 2023-02-01 day: 01 |
PublicationDecade | 2020 |
PublicationPlace | New York |
PublicationPlace_xml | – name: New York |
PublicationTitle | IEEE transactions on circuits and systems. II, Express briefs |
PublicationTitleAbbrev | TCSII |
PublicationYear | 2023 |
Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
References | ref13 ref12 ref15 ref11 ref10 ref2 ref1 ref17 ref16 ref19 ref18 Romero (ref14) ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref8 ref7 ref9 ref4 ref3 ref6 ref5 |
References_xml | – ident: ref13 doi: 10.1016/j.automatica.2006.06.015 – ident: ref2 doi: 10.1109/TAC.2009.2028959 – ident: ref15 doi: 10.1109/TAC.2011.2179869 – ident: ref1 doi: 10.1109/72.641452 – ident: ref24 doi: 10.1016/j.automatica.2020.109289 – ident: ref19 doi: 10.1109/TCSII.2018.2886298 – ident: ref22 doi: 10.1109/TAC.2020.3001436 – start-page: 8200 volume-title: Proc. Int. Conf. Mach. Learn. ident: ref14 article-title: Finite-time convergence in continuous-time optimization contributor: fullname: Romero – ident: ref18 doi: 10.1109/TSMC.2016.2623634 – ident: ref17 doi: 10.3182/20130925-2-DE-4044.00055 – ident: ref23 doi: 10.1016/j.automatica.2018.05.032 – ident: ref9 doi: 10.1109/TAC.2016.2593899 – ident: ref11 doi: 10.1109/JPROC.2020.3003156 – ident: ref26 doi: 10.1017/CBO9780511804441 – ident: ref6 doi: 10.1109/TSP.2017.2728498 – ident: ref12 doi: 10.1137/S0363012903425593 – ident: ref8 doi: 10.1109/TAC.2017.2760256 – ident: ref10 doi: 10.1109/TAC.2017.2673240 – ident: ref5 doi: 10.1109/TSP.2016.2568161 – ident: ref3 doi: 10.1109/TAC.2014.2298140 – ident: ref4 doi: 10.1137/090762634 – ident: ref7 doi: 10.1109/CDC.2011.6161503 – ident: ref21 doi: 10.1109/TCSII.2017.2661380 – ident: ref20 doi: 10.1016/j.automatica.2015.01.021 – ident: ref16 doi: 10.1109/TCST.2016.2519838 – ident: ref25 doi: 10.1080/03081088708817789 |
SSID | ssj0029032 |
Score | 2.4303029 |
Snippet | To resolve the time-varying convex optimization problems with the cost function, the constraints or both being time dependent, in this brief we investigate a... |
SourceID | proquest crossref ieee |
SourceType | Aggregation Database Publisher |
StartPage | 616 |
SubjectTerms | Algorithms Asymptotic stability Computational geometry Convergence Convex functions Convexity Cost function Design optimization equality constraint Fixed-time stability Gradient flow nonlinear system Prediction algorithms Stability criteria Time dependence time-varying optimization Trajectory optimization |
Title | Fixed-Time Algorithms for Time-Varying Convex Optimization |
URI | https://ieeexplore.ieee.org/document/9893893 https://www.proquest.com/docview/2771534010 |
Volume | 70 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwED4VJhh4FUR5KQMbJDhOYsdsqKICJGCgRWyR7dhQQVvUplLFr-ecpBWvASlDFCWSded7fPF9dwDHRAqeJJIiLCGxHydaoM0J5edpZKmKQm2rAtk7dtWLb56SpwacLrgwxpiy-MwE7rY8y89Heup-lZ0JDK54LcFSSmjF1VqAK0HKYWSu4xhmjDGfE2SIOOu2H66vEQpSGkSUYMBOvwWhcqrKL1dcxpfOOtzOV1aVlbwG00IF-uNH08b_Ln0D1upE07uodsYmNMxwC1a_tB9swnmnPzO571gg3sXb82jcL14GEw_TWM898x_l2JGgvLarTJ959-hdBjVtcxt6nctu-8qvZyn4moqk8LUNQ4nR30QsNYZQZ32cKRsjHLTMYJ4mI25CZpUiTFFpuU1SzKUkwkPGDYt2YHk4Gppd8HKmlFFSKxfaJRcitiFXTKtIKcp13IKTuXCz96plRlZCDSKyUhWZU0VWq6IFTSetxZu1oFpwMNdHVlvVJKOco4NGREj2_v5qH1bcOPiqqvoAlovx1Bxi0lCoo3K3fALm670l |
link.rule.ids | 315,786,790,802,27955,27956,55107 |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwED7xGICBN6JQIAMbpDhOYtdsqKJqeQ60qFtkuzZU0BaVVKr49ZyTtOI1IGWIokSy7nz33RffA-CYSMHjWFKkJSTyo1gLtDmh_G41tFSFgbZ5guwda7Sjq07cmYPTWS2MMSZLPjMVd5ud5XeHeux-lZ0JBFe85mERcZ7wvFprRq8EycaRuZ5jGDNGfFoiQ8RZq_bQbCIZpLQSUoKQXf0GQ9lclV_OOEOY-hrcTteWJ5a8VMapquiPH20b_7v4dVgtQk3vIt8bGzBnBpuw8qUB4Rac13sT0_VdHYh38fo0HPXS5_67h4Gs5575j3LkyqC8mstNn3j36F_6ReHmNrTrl61awy-mKfiaijj1tQ0CifhvQlY1hlBnf5wpGyEhtMxgpCZDbgJmlSJMUWm5jasYTUmUNOOGhTuwMBgOzC54XaaUUVIrB-6SCxHZgCumVagU5ToqwclUuMlb3jQjycgGEUmmisSpIilUUYItJ63Zm4WgSlCe6iMp7Oo9oZyji0ZOSPb-_uoIlhqt25vkpnl3vQ_Lbjh8nmNdhoV0NDYHGEKk6jDbOZ8NzcB5 |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fixed-Time+Algorithms+for+Time-Varying+Convex+Optimization&rft.jtitle=IEEE+transactions+on+circuits+and+systems.+II%2C+Express+briefs&rft.au=Hong%2C+Huifen&rft.au=Yu%2C+Wenwu&rft.au=Guo-Ping%2C+Jiang&rft.au=Wang%2C+He&rft.date=2023-02-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1549-7747&rft.eissn=1558-3791&rft.volume=70&rft.issue=2&rft.spage=616&rft_id=info:doi/10.1109%2FTCSII.2022.3207278&rft.externalDBID=NO_FULL_TEXT |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1549-7747&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1549-7747&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1549-7747&client=summon |