An inner approximation method for a reverse convex programming problem
In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set which is defined by the complement of the interior of a compact convex set X. We propose an inner approximation method to solve the problem in the case where X is not necessarily a po...
Uloženo v:
| Vydáno v: | IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028) Ročník 3; s. 521 - 526 vol.3 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina japonština |
| Vydáno: |
IEEE
20.01.2003
|
| Témata: | |
| ISBN: | 9780780357310, 0780357310 |
| ISSN: | 1062-922X |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set which is defined by the complement of the interior of a compact convex set X. We propose an inner approximation method to solve the problem in the case where X is not necessarily a polytope. The algorithm utilizes inner approximation of X by a sequence of polytopes to generate relaxed problems. It is shown that every accumulation point of the sequence of optimal solutions of relaxed problems is an optimal solution of the original problem. |
|---|---|
| AbstractList | In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set which is defined by the complement of the interior of a compact convex set X. We propose an inner approximation method to solve the problem in the case where X is not necessarily a polytope. The algorithm utilizes inner approximation of X by a sequence of polytopes to generate relaxed problems. It is shown that every accumulation point of the sequence of optimal solutions of relaxed problems is an optimal solution of the original problem. |
| Author | Tatsumi, K. Yamada, S. Tanino, T. Inuiguchi, M. |
| Author_xml | – sequence: 1 givenname: S. surname: Yamada fullname: Yamada, S. organization: Dept. of Electron. & Inf. Syst., Osaka Univ., Japan – sequence: 2 givenname: T. surname: Tanino fullname: Tanino, T. – sequence: 3 givenname: M. surname: Inuiguchi fullname: Inuiguchi, M. – sequence: 4 givenname: K. surname: Tatsumi fullname: Tatsumi, K. |
| BookMark | eNotT9tKAzEUDFjBtvYD9Ck_sGtOLtucx7JYLVR8UMG3km1OaqSbLdlS6t-7UmFgBmYYZiZslLpEjN2BKAEEPqzqt5e6BEQsrVSy0ldshnMrBigzVyBGbAyikgVK-XnDJn3_LYQUGuyYLReJx5Qoc3c45O4cW3eMXeItHb86z0M3GDzTiXJPfNulE535kNtl17Yx7f50s6f2ll0Ht-9p9s9T9rF8fK-fi_Xr06perIsIoHVhtwhgpDOV80Z7460NgWSwXkiJRhtwjdIggjNWBQgNCgfohcVGBrRBTdn9pTcS0eaQh7n5Z3N5rX4B5mFNkg |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/ICSMC.1999.823264 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library (IEL) (UW System Shared) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) |
| EndPage | 526 vol.3 |
| ExternalDocumentID | 823264 |
| GroupedDBID | 29F 6IE 6IF 6IH 6IK 6IL 6IM 6IN AAJGR AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IJVOP IPLJI M43 OCL RIE RIL RIO RNS |
| ID | FETCH-LOGICAL-i1144-8c91152a56ad54d5d88ffe2f8d02295451ab3410fa583f1fb90a19d089b2f98f3 |
| IEDL.DBID | RIE |
| ISBN | 9780780357310 0780357310 |
| ISSN | 1062-922X |
| IngestDate | Tue Aug 26 16:52:51 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English Japanese |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i1144-8c91152a56ad54d5d88ffe2f8d02295451ab3410fa583f1fb90a19d089b2f98f3 |
| OpenAccessLink | https://cir.nii.ac.jp/crid/1873961342464786944 |
| ParticipantIDs | ieee_primary_823264 |
| PublicationCentury | 2000 |
| PublicationDate | 2003-01-20 |
| PublicationDateYYYYMMDD | 2003-01-20 |
| PublicationDate_xml | – month: 01 year: 2003 text: 2003-01-20 day: 20 |
| PublicationDecade | 2000 |
| PublicationTitle | IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028) |
| PublicationTitleAbbrev | ICSMC |
| PublicationYear | 2003 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0020418 ssj0000454786 |
| Score | 1.508936 |
| Snippet | In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set which is defined by the complement of the... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 521 |
| SubjectTerms | Approximation algorithms Approximation methods Electronic mail Information systems Optimization methods |
| Title | An inner approximation method for a reverse convex programming problem |
| URI | https://ieeexplore.ieee.org/document/823264 |
| Volume | 3 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED3RigEWaCniWx4YYDB1EtvxjaiiAgmqSoDUrXJiW-pAQf1A_fk4jhVAYmFLMtiRE_ve2ffeA7i0BXrUjoo6lIJy1JKizDW1vETUGRpRq-s_5qORmkxwHHW2AxfGWhuKz-xNdRnO8s17ua62yvrKh3_JW9DKc1lTtZrtFBaEqWSTazGe1Cw4mVJM00nI2BXLRO7xTBTeae7jaWfCsP8weH4aVBQ-_wuF3n65roSgM9z71-vuQ--bvEfGTVjqwJadd2H3h-5gFzpxRi_JVZSdvj6A4e2cBCMuEnTGN7Oa1Ehqj2niwS3RpBJ8WiwtCcXqGxKru958qyRa0_TgdXj3Mrin0WWBznwuxKkq_XonUi2kNoIbYZRyzqZOGVZZfXOR6MKHOua0UJlLXIFMJ2iYwiJ1qFx2CO35-9weAeHGox1rWVJoyUXJ0fkWlAfGlTWRyfUxdKtRmn7UQhrTeoBO_nx6Cjuhbo4lfiKfQXu1WNtz2C4_V7Pl4iJ8_C9bHKdj |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8MgGP2i00S96OaMv-XgQQ8obYHC0SwuW9yWJc5kt4UWSHZwM_th9udLKamaePFWeqCEQL_3wffeA7g1mXSoXQpsJWeYSsWx5KnChuZSqkRqVqrr99LBQIzHchh0tj0Xxhjji8_MQ_Ho7_L1PF8XR2WPwoV_Trdhh1Eak5KsVR2oEC9Nxatsi9Co5MHxGMs4HvucXZCEpQ7RBOmdqh3uOyMiH7ut136rIPG5ReS_98t3xYed9uG_BnwEzW_6HhpWgakOW2bWgIMfyoMNqIc9vUR3QXj6_hjaTzPkrbiQVxrfTEtaIypdppGDt0ihQvJpsTTIl6tvUKjvene9omBO04S39vOo1cHBZwFPXTZEscjdH4_FinGlGdVMC2Gtia3QpDD7pixSmQt2xComEhvZTBIVSU2EzGIrhU1OoDabz8wpIKod3jGGRJnilOVUWteDcNC4MCfSqTqDRjFLk49SSmNSTtD5n29vYK8z6vcmve7g5QL2fRUdidy2voTaarE2V7Cbf66my8W1XwhfRnSqqg |
| 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%3Abook&rft.genre=proceeding&rft.title=IEEE+SMC%2799+Conference+Proceedings.+1999+IEEE+International+Conference+on+Systems%2C+Man%2C+and+Cybernetics+%28Cat.+No.99CH37028%29&rft.atitle=An+inner+approximation+method+for+a+reverse+convex+programming+problem&rft.au=Yamada%2C+S.&rft.au=Tanino%2C+T.&rft.au=Inuiguchi%2C+M.&rft.au=Tatsumi%2C+K.&rft.date=2003-01-20&rft.pub=IEEE&rft.isbn=9780780357310&rft.issn=1062-922X&rft.volume=3&rft.spage=521&rft.epage=526+vol.3&rft_id=info:doi/10.1109%2FICSMC.1999.823264&rft.externalDocID=823264 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1062-922X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1062-922X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1062-922X&client=summon |