A regularized penalty method for solving convex semi-infinite programs

A regularized penalty method for solving convex semi-infinite programs

This paper is concerned with the stable solution of ill-posed convex semi-infinite problems on the base of their sequential approximation by finite dimensional convex problems on a sequence of grids. These auxiliary programs are constructed by using the iterative Prox-regularization and for solving...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization 1992-01, Vol.26 (3-4), p.215-228
Hauptverfasser: Kaplan, A.A., Tichatschike, R.
Format: Artikel
Sprache:eng
Schlagworte:
Ill-posed Semi-infinite Programs
Numerical Algorithms for Convex Semi-infinite Programs
Penalization
Regularization
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 228
container_issue 3-4
container_start_page 215
container_title Optimization
container_volume 26
creator Kaplan, A.A.
Tichatschike, R.
description This paper is concerned with the stable solution of ill-posed convex semi-infinite problems on the base of their sequential approximation by finite dimensional convex problems on a sequence of grids. These auxiliary programs are constructed by using the iterative Prox-regularization and for solving each of them only one step of a penalty method is applied. A simple deletion procedure of inactive constraints is suggested. The choice of the control parameters secure the convergence of the methods and a linear convergence rate is obtained
doi_str_mv 10.1080/02331939208843853
format Article
fullrecord <record><control><sourceid>crossref_infor</sourceid><recordid>TN_cdi_crossref_primary_10_1080_02331939208843853</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1080_02331939208843853</sourcerecordid><originalsourceid>FETCH-LOGICAL-c211t-c4a3852782ab745e8b121f949514e55e57b8b9116390294a890ae5ed81bbbfe23</originalsourceid><addsrcrecordid>eNp1kM1KAzEUhYMoWKsP4C4vMJqbn04CbkqxKhTc6HpIZm5qZGYyJGO1Pr1T6k5cncU93-XjEHIN7AaYZreMCwFGGM60lkIrcUJmwLgppJHqlMwO92IqyHNykfM7YxwWXM7IekkTbj9am8I3NnTA3rbjnnY4vsWG-phoju0u9Ftax36HXzRjF4rQ-9CHEemQ4jbZLl-SM2_bjFe_OSev6_uX1WOxeX54Wi03Rc0BxqKWdnLjpebWlVKhdsDBG2kUSFQKVem0MwALYSZ3abVhFhU2GpxzHrmYEzj-rVPMOaGvhhQ6m_YVsOowRPVniIm5OzKTdUyd_YypbarR7tuYfLJ9HXIl_sd_AO1xY1I</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A regularized penalty method for solving convex semi-infinite programs</title><source>Taylor &amp; Francis Journals Complete</source><creator>Kaplan, A.A. ; Tichatschike, R.</creator><creatorcontrib>Kaplan, A.A. ; Tichatschike, R.</creatorcontrib><description>This paper is concerned with the stable solution of ill-posed convex semi-infinite problems on the base of their sequential approximation by finite dimensional convex problems on a sequence of grids. These auxiliary programs are constructed by using the iterative Prox-regularization and for solving each of them only one step of a penalty method is applied. A simple deletion procedure of inactive constraints is suggested. The choice of the control parameters secure the convergence of the methods and a linear convergence rate is obtained</description><identifier>ISSN: 0233-1934</identifier><identifier>EISSN: 1029-4945</identifier><identifier>DOI: 10.1080/02331939208843853</identifier><language>eng</language><publisher>Gordon and Breach Science Publishers</publisher><subject>Ill-posed Semi-infinite Programs ; Numerical Algorithms for Convex Semi-infinite Programs ; Penalization ; Regularization</subject><ispartof>Optimization, 1992-01, Vol.26 (3-4), p.215-228</ispartof><rights>Copyright Taylor &amp; Francis Group, LLC 1992</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c211t-c4a3852782ab745e8b121f949514e55e57b8b9116390294a890ae5ed81bbbfe23</citedby><cites>FETCH-LOGICAL-c211t-c4a3852782ab745e8b121f949514e55e57b8b9116390294a890ae5ed81bbbfe23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.tandfonline.com/doi/pdf/10.1080/02331939208843853$$EPDF$$P50$$Ginformaworld$$H</linktopdf><linktohtml>$$Uhttps://www.tandfonline.com/doi/full/10.1080/02331939208843853$$EHTML$$P50$$Ginformaworld$$H</linktohtml><link.rule.ids>314,780,784,27922,27923,59645,60434</link.rule.ids></links><search><creatorcontrib>Kaplan, A.A.</creatorcontrib><creatorcontrib>Tichatschike, R.</creatorcontrib><title>A regularized penalty method for solving convex semi-infinite programs</title><title>Optimization</title><description>This paper is concerned with the stable solution of ill-posed convex semi-infinite problems on the base of their sequential approximation by finite dimensional convex problems on a sequence of grids. These auxiliary programs are constructed by using the iterative Prox-regularization and for solving each of them only one step of a penalty method is applied. A simple deletion procedure of inactive constraints is suggested. The choice of the control parameters secure the convergence of the methods and a linear convergence rate is obtained</description><subject>Ill-posed Semi-infinite Programs</subject><subject>Numerical Algorithms for Convex Semi-infinite Programs</subject><subject>Penalization</subject><subject>Regularization</subject><issn>0233-1934</issn><issn>1029-4945</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><recordid>eNp1kM1KAzEUhYMoWKsP4C4vMJqbn04CbkqxKhTc6HpIZm5qZGYyJGO1Pr1T6k5cncU93-XjEHIN7AaYZreMCwFGGM60lkIrcUJmwLgppJHqlMwO92IqyHNykfM7YxwWXM7IekkTbj9am8I3NnTA3rbjnnY4vsWG-phoju0u9Ftax36HXzRjF4rQ-9CHEemQ4jbZLl-SM2_bjFe_OSev6_uX1WOxeX54Wi03Rc0BxqKWdnLjpebWlVKhdsDBG2kUSFQKVem0MwALYSZ3abVhFhU2GpxzHrmYEzj-rVPMOaGvhhQ6m_YVsOowRPVniIm5OzKTdUyd_YypbarR7tuYfLJ9HXIl_sd_AO1xY1I</recordid><startdate>19920101</startdate><enddate>19920101</enddate><creator>Kaplan, A.A.</creator><creator>Tichatschike, R.</creator><general>Gordon and Breach Science Publishers</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19920101</creationdate><title>A regularized penalty method for solving convex semi-infinite programs</title><author>Kaplan, A.A. ; Tichatschike, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c211t-c4a3852782ab745e8b121f949514e55e57b8b9116390294a890ae5ed81bbbfe23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Ill-posed Semi-infinite Programs</topic><topic>Numerical Algorithms for Convex Semi-infinite Programs</topic><topic>Penalization</topic><topic>Regularization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kaplan, A.A.</creatorcontrib><creatorcontrib>Tichatschike, R.</creatorcontrib><collection>CrossRef</collection><jtitle>Optimization</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kaplan, A.A.</au><au>Tichatschike, R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A regularized penalty method for solving convex semi-infinite programs</atitle><jtitle>Optimization</jtitle><date>1992-01-01</date><risdate>1992</risdate><volume>26</volume><issue>3-4</issue><spage>215</spage><epage>228</epage><pages>215-228</pages><issn>0233-1934</issn><eissn>1029-4945</eissn><abstract>This paper is concerned with the stable solution of ill-posed convex semi-infinite problems on the base of their sequential approximation by finite dimensional convex problems on a sequence of grids. These auxiliary programs are constructed by using the iterative Prox-regularization and for solving each of them only one step of a penalty method is applied. A simple deletion procedure of inactive constraints is suggested. The choice of the control parameters secure the convergence of the methods and a linear convergence rate is obtained</abstract><pub>Gordon and Breach Science Publishers</pub><doi>10.1080/02331939208843853</doi><tpages>14</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0233-1934
ispartof Optimization, 1992-01, Vol.26 (3-4), p.215-228
issn 0233-1934
1029-4945
language eng
recordid cdi_crossref_primary_10_1080_02331939208843853
source Taylor & Francis Journals Complete
subjects Ill-posed Semi-infinite Programs
Numerical Algorithms for Convex Semi-infinite Programs
Penalization
Regularization
title A regularized penalty method for solving convex semi-infinite programs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T06%3A13%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_infor&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20regularized%20penalty%20method%20for%20solving%20convex%20semi-infinite%20programs&rft.jtitle=Optimization&rft.au=Kaplan,%20A.A.&rft.date=1992-01-01&rft.volume=26&rft.issue=3-4&rft.spage=215&rft.epage=228&rft.pages=215-228&rft.issn=0233-1934&rft.eissn=1029-4945&rft_id=info:doi/10.1080/02331939208843853&rft_dat=%3Ccrossref_infor%3E10_1080_02331939208843853%3C/crossref_infor%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