Accelerated Algorithms for a Class of Optimization Problems with Equality and Box Constraints

Accelerated Algorithms for a Class of Optimization Problems with Equality and Box Constraints

Convex optimization with equality and inequality constraints is a ubiquitous problem in several optimization and control problems in large-scale systems. Recently there has been a lot of interest in establishing accelerated convergence of the loss function. A class of high-order tuners was recently...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Parashar, Anjali, Srivastava, Priyank, Annaswamy, Anuradha M
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Learning
Mathematics - Optimization and Control
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Parashar, Anjali
Srivastava, Priyank
Annaswamy, Anuradha M
description Convex optimization with equality and inequality constraints is a ubiquitous problem in several optimization and control problems in large-scale systems. Recently there has been a lot of interest in establishing accelerated convergence of the loss function. A class of high-order tuners was recently proposed in an effort to lead to accelerated convergence for the case when no constraints are present. In this paper, we propose a new high-order tuner that can accommodate the presence of equality constraints. In order to accommodate the underlying box constraints, time-varying gains are introduced in the high-order tuner which leverage convexity and ensure anytime feasibility of the constraints. Numerical examples are provided to support the theoretical derivations.
doi_str_mv 10.48550/arxiv.2305.04433
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2305_04433</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2305_04433</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-1255d6480fc2206989ebfcf09839298275d53147ab02bebb4b6e14074b03f4f43</originalsourceid><addsrcrecordid>eNotz7tOwzAYhmEvDKhwAUz8N5Dg-JDDGKJykCqVoSuKfid2a8mJi22g5eopLdO3vPqkh5C7guailpI-YDjYr5xxKnMqBOfX5L0dBu10wKRHaN3WB5t2UwTjAyB0DmMEb2C9T3ayP5isn-EteOX0Kfo-tbD8-ERn0xFwHuHRH6Dzc0wB7ZziDbky6KK-_d8F2TwtN91Ltlo_v3btKsOy4lnBpBxLUVMzMEbLpm60MoOhTc0b1tSskqPkhahQUaa0UkKVuhC0EopyI4zgC3J_uT37-n2wE4Zj_-fsz07-C6IpTbo</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Accelerated Algorithms for a Class of Optimization Problems with Equality and Box Constraints</title><source>arXiv.org</source><creator>Parashar, Anjali ; Srivastava, Priyank ; Annaswamy, Anuradha M</creator><creatorcontrib>Parashar, Anjali ; Srivastava, Priyank ; Annaswamy, Anuradha M</creatorcontrib><description>Convex optimization with equality and inequality constraints is a ubiquitous problem in several optimization and control problems in large-scale systems. Recently there has been a lot of interest in establishing accelerated convergence of the loss function. A class of high-order tuners was recently proposed in an effort to lead to accelerated convergence for the case when no constraints are present. In this paper, we propose a new high-order tuner that can accommodate the presence of equality constraints. In order to accommodate the underlying box constraints, time-varying gains are introduced in the high-order tuner which leverage convexity and ensure anytime feasibility of the constraints. Numerical examples are provided to support the theoretical derivations.</description><identifier>DOI: 10.48550/arxiv.2305.04433</identifier><language>eng</language><subject>Computer Science - Learning ; Mathematics - Optimization and Control</subject><creationdate>2023-05</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2305.04433$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2305.04433$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Parashar, Anjali</creatorcontrib><creatorcontrib>Srivastava, Priyank</creatorcontrib><creatorcontrib>Annaswamy, Anuradha M</creatorcontrib><title>Accelerated Algorithms for a Class of Optimization Problems with Equality and Box Constraints</title><description>Convex optimization with equality and inequality constraints is a ubiquitous problem in several optimization and control problems in large-scale systems. Recently there has been a lot of interest in establishing accelerated convergence of the loss function. A class of high-order tuners was recently proposed in an effort to lead to accelerated convergence for the case when no constraints are present. In this paper, we propose a new high-order tuner that can accommodate the presence of equality constraints. In order to accommodate the underlying box constraints, time-varying gains are introduced in the high-order tuner which leverage convexity and ensure anytime feasibility of the constraints. Numerical examples are provided to support the theoretical derivations.</description><subject>Computer Science - Learning</subject><subject>Mathematics - Optimization and Control</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz7tOwzAYhmEvDKhwAUz8N5Dg-JDDGKJykCqVoSuKfid2a8mJi22g5eopLdO3vPqkh5C7guailpI-YDjYr5xxKnMqBOfX5L0dBu10wKRHaN3WB5t2UwTjAyB0DmMEb2C9T3ayP5isn-EteOX0Kfo-tbD8-ERn0xFwHuHRH6Dzc0wB7ZziDbky6KK-_d8F2TwtN91Ltlo_v3btKsOy4lnBpBxLUVMzMEbLpm60MoOhTc0b1tSskqPkhahQUaa0UkKVuhC0EopyI4zgC3J_uT37-n2wE4Zj_-fsz07-C6IpTbo</recordid><startdate>20230507</startdate><enddate>20230507</enddate><creator>Parashar, Anjali</creator><creator>Srivastava, Priyank</creator><creator>Annaswamy, Anuradha M</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20230507</creationdate><title>Accelerated Algorithms for a Class of Optimization Problems with Equality and Box Constraints</title><author>Parashar, Anjali ; Srivastava, Priyank ; Annaswamy, Anuradha M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-1255d6480fc2206989ebfcf09839298275d53147ab02bebb4b6e14074b03f4f43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Learning</topic><topic>Mathematics - Optimization and Control</topic><toplevel>online_resources</toplevel><creatorcontrib>Parashar, Anjali</creatorcontrib><creatorcontrib>Srivastava, Priyank</creatorcontrib><creatorcontrib>Annaswamy, Anuradha M</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Parashar, Anjali</au><au>Srivastava, Priyank</au><au>Annaswamy, Anuradha M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Accelerated Algorithms for a Class of Optimization Problems with Equality and Box Constraints</atitle><date>2023-05-07</date><risdate>2023</risdate><abstract>Convex optimization with equality and inequality constraints is a ubiquitous problem in several optimization and control problems in large-scale systems. Recently there has been a lot of interest in establishing accelerated convergence of the loss function. A class of high-order tuners was recently proposed in an effort to lead to accelerated convergence for the case when no constraints are present. In this paper, we propose a new high-order tuner that can accommodate the presence of equality constraints. In order to accommodate the underlying box constraints, time-varying gains are introduced in the high-order tuner which leverage convexity and ensure anytime feasibility of the constraints. Numerical examples are provided to support the theoretical derivations.</abstract><doi>10.48550/arxiv.2305.04433</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2305.04433
ispartof
issn
language eng
recordid cdi_arxiv_primary_2305_04433
source arXiv.org
subjects Computer Science - Learning
Mathematics - Optimization and Control
title Accelerated Algorithms for a Class of Optimization Problems with Equality and Box Constraints
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T00%3A29%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Accelerated%20Algorithms%20for%20a%20Class%20of%20Optimization%20Problems%20with%20Equality%20and%20Box%20Constraints&rft.au=Parashar,%20Anjali&rft.date=2023-05-07&rft_id=info:doi/10.48550/arxiv.2305.04433&rft_dat=%3Carxiv_GOX%3E2305_04433%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true