Exact bounds for steepest descent algorithms of L-convex function minimization
We analyze minimization algorithms for L♮-convex functions in discrete convex analysis and establish exact bounds for the number of iterations required by the steepest descent algorithm and its variants.
Uložené v:
| Vydané v: | Operations research letters Ročník 42; číslo 5; s. 361 - 366 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.07.2014
|
| Predmet: | |
| ISSN: | 0167-6377, 1872-7468 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We analyze minimization algorithms for L♮-convex functions in discrete convex analysis and establish exact bounds for the number of iterations required by the steepest descent algorithm and its variants. |
|---|---|
| AbstractList | We analyze minimization algorithms for L♮-convex functions in discrete convex analysis and establish exact bounds for the number of iterations required by the steepest descent algorithm and its variants. |
| Author | Murota, Kazuo Shioura, Akiyoshi |
| Author_xml | – sequence: 1 givenname: Kazuo surname: Murota fullname: Murota, Kazuo email: murota@mist.i.u-tokyo.ac.jp organization: Graduate School of Information Science and Technology, University of Tokyo, Tokyo 113-8656, Japan – sequence: 2 givenname: Akiyoshi surname: Shioura fullname: Shioura, Akiyoshi email: shioura@dais.is.tohoku.ac.jp organization: Graduate School of Information Sciences, Tohoku University, Sendai 980-8579, Japan |
| BookMark | eNp9kMtOwzAQRS1UJNrCB7DzDyTYaWwnYoWq8pAq2MDacuwxuErsyjZV4etJKSsWXY1GmjO698zQxAcPCF1TUlJC-c2mDLEvK0LrkvCSEHaGprQRVSFq3kzQdLwRBV8IcYFmKW0IIaKhzRQ9r_ZKZ9yFT28StiHilAG2kDI2kDT4jFX_HqLLH0PCweJ1oYPfwR7bT6-zCx4PzrvBfavDconOreoTXP3NOXq7X70uH4v1y8PT8m6EF1WTC1Y1mrWmtsLYjjOiK0uMBdMZ1nbCdoLXDWlBMKVYRQXpeNu0ltWMk9ZqYRdzRI9_dQwpRbByG92g4pekRB6EyI0chciDEEm4HIWMjPjHaJd_U-eoXH-SvD2SMFbaOYgyaQdeg3ERdJYmuBP0D9Nlftc |
| CitedBy_id | crossref_primary_10_1007_s13160_020_00416_0 crossref_primary_10_1287_moor_2019_0248 crossref_primary_10_1016_j_disopt_2016_01_001 crossref_primary_10_1007_s00245_019_09567_0 crossref_primary_10_1007_s10107_014_0792_y crossref_primary_10_1016_j_disopt_2015_07_001 crossref_primary_10_1145_3291531 crossref_primary_10_15807_jorsj_58_184 crossref_primary_10_15807_jorsj_58_61 crossref_primary_10_15807_jorsj_60_216 crossref_primary_10_15807_jorsj_61_71 crossref_primary_10_1007_s10107_024_02064_5 crossref_primary_10_1111_poms_12658 crossref_primary_10_1007_s13160_017_0246_z crossref_primary_10_1287_moor_2018_0984 |
| Cites_doi | 10.1287/opre.1090.0716 10.1109/TPAMI.1984.4767596 10.1006/jeth.1999.2580 10.2307/1913392 10.1109/TIP.2005.863958 10.1016/0167-6377(91)90027-M 10.1287/opre.1070.0482 10.1109/TIP.2006.888351 10.1257/aer.96.3.602 10.1007/BF02591772 10.1109/34.969114 10.1007/s10851-006-8803-0 10.1007/s10107-013-0643-2 10.1016/j.disopt.2009.04.006 10.1137/S1052623402419005 |
| ContentType | Journal Article |
| Copyright | 2014 Elsevier B.V. |
| Copyright_xml | – notice: 2014 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.orl.2014.06.005 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) |
| EISSN | 1872-7468 |
| EndPage | 366 |
| ExternalDocumentID | 10_1016_j_orl_2014_06_005 S0167637714000844 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1OL 1RT 1~. 1~5 29N 4.4 457 4G. 4R4 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABAOU ABFNM ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNCT ACRLP ADBBV ADEZE ADGUI ADIYS ADMUD AEBSH AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SDS SES SEW SPC SPCBC SSB SSD SSW SSZ T5K TN5 WH7 WUQ XPP XSW ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c328t-528c59d4f7dfb650c2f0dfedbd59b7fb764809e75aa52170b6989f545609fc7f3 |
| ISICitedReferencesCount | 15 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000340221300012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-6377 |
| IngestDate | Sat Nov 29 02:30:16 EST 2025 Tue Nov 18 21:53:12 EST 2025 Fri Feb 23 02:30:14 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | Discrete optimization Steepest descent algorithm Discrete convex function Analysis of algorithm |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c328t-528c59d4f7dfb650c2f0dfedbd59b7fb764809e75aa52170b6989f545609fc7f3 |
| PageCount | 6 |
| ParticipantIDs | crossref_primary_10_1016_j_orl_2014_06_005 crossref_citationtrail_10_1016_j_orl_2014_06_005 elsevier_sciencedirect_doi_10_1016_j_orl_2014_06_005 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-07-01 |
| PublicationDateYYYYMMDD | 2014-07-01 |
| PublicationDate_xml | – month: 07 year: 2014 text: 2014-07-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Operations research letters |
| PublicationYear | 2014 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Zipkin (br000095) 2008; 56 Ausubel (br000005) 2006; 96 Geman, Geman (br000040) 1984; 6 Huh, Janakiraman (br000055) 2010; 58 Kelso, Crawford (br000060) 1982; 50 Boykov, Veksler, Zabih (br000020) 2001; 23 Bioucas-Dias, Valadão (br000010) 2007; 16 Murota, Shioura (br000085) 2013 Murota (br000070) 2003 Gul, Stacchetti (br000045) 2000; 92 Chung, Tcha (br000025) 1991; 10 Murota (br000075) 2003; 14 Murota, Shioura, Yang (br000090) 2013; vol. 8283 Hassin (br000050) 1983; 25 Kolmogorov, Shioura (br000065) 2009; 6 Darbon, Sigelle (br000035) 2006; 26 Blumrosen, Nisan (br000015) 2007 Cramton, Shoham, Steinberg (br000030) 2006 Murota, Shioura (br000080) 2014; 145 Zomet, Levin, Peleg, Weiss (br000100) 2006; 15 Murota (10.1016/j.orl.2014.06.005_br000085) 2013 Kolmogorov (10.1016/j.orl.2014.06.005_br000065) 2009; 6 Ausubel (10.1016/j.orl.2014.06.005_br000005) 2006; 96 Murota (10.1016/j.orl.2014.06.005_br000090) 2013; vol. 8283 Boykov (10.1016/j.orl.2014.06.005_br000020) 2001; 23 Murota (10.1016/j.orl.2014.06.005_br000075) 2003; 14 Gul (10.1016/j.orl.2014.06.005_br000045) 2000; 92 Geman (10.1016/j.orl.2014.06.005_br000040) 1984; 6 Murota (10.1016/j.orl.2014.06.005_br000070) 2003 Zomet (10.1016/j.orl.2014.06.005_br000100) 2006; 15 Hassin (10.1016/j.orl.2014.06.005_br000050) 1983; 25 Darbon (10.1016/j.orl.2014.06.005_br000035) 2006; 26 Blumrosen (10.1016/j.orl.2014.06.005_br000015) 2007 Kelso (10.1016/j.orl.2014.06.005_br000060) 1982; 50 Zipkin (10.1016/j.orl.2014.06.005_br000095) 2008; 56 Chung (10.1016/j.orl.2014.06.005_br000025) 1991; 10 Murota (10.1016/j.orl.2014.06.005_br000080) 2014; 145 Cramton (10.1016/j.orl.2014.06.005_br000030) 2006 Huh (10.1016/j.orl.2014.06.005_br000055) 2010; 58 Bioucas-Dias (10.1016/j.orl.2014.06.005_br000010) 2007; 16 |
| References_xml | – volume: 96 start-page: 602 year: 2006 end-page: 629 ident: br000005 article-title: An efficient dynamic auction for heterogeneous commodities publication-title: Amer. Econ. Rev. – volume: 56 start-page: 937 year: 2008 end-page: 944 ident: br000095 article-title: On the structure of lost-sales inventory models publication-title: Oper. Res. – year: 2003 ident: br000070 article-title: Discrete Convex Analysis – year: 2006 ident: br000030 article-title: Combinatorial Auctions – start-page: 267 year: 2007 end-page: 299 ident: br000015 article-title: Combinatorial auction publication-title: Algorithmic Game Theory – volume: 15 start-page: 969 year: 2006 end-page: 977 ident: br000100 article-title: Seamless image stitching by minimizing false edges publication-title: IEEE Trans. Image Process. – year: 2013 ident: br000085 article-title: On some properties of polyhedral – volume: 6 start-page: 721 year: 1984 end-page: 741 ident: br000040 article-title: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images publication-title: IEEE Trans. Pattern Anal. Mach. Intell. – volume: 10 start-page: 489 year: 1991 end-page: 495 ident: br000025 article-title: A dual algorithm for submodular flow problems publication-title: Oper. Res. Lett. – volume: 26 start-page: 261 year: 2006 end-page: 276 ident: br000035 article-title: Image restoration with discrete constrained total variation, part I: fast and exact optimization publication-title: J. Math. Imaging Vision – volume: vol. 8283 start-page: 468 year: 2013 end-page: 478 ident: br000090 article-title: Computing a Walrasian equilibrium in iterative auctions with multiple differentiated items publication-title: Proc. 24th International Symposium on Algorithms and Computation, ISAAC – volume: 16 start-page: 698 year: 2007 end-page: 709 ident: br000010 article-title: Phase unwrapping via graph cuts publication-title: IEEE Trans. Image Process. – volume: 58 start-page: 486 year: 2010 end-page: 491 ident: br000055 article-title: On the optimal policy structure in serial inventory systems with lost sales publication-title: Oper. Res. – volume: 145 start-page: 163 year: 2014 end-page: 177 ident: br000080 article-title: Dijkstra’s algorithm and publication-title: Math. Program. – volume: 14 start-page: 699 year: 2003 end-page: 707 ident: br000075 article-title: On steepest descent algorithms for discrete convex functions publication-title: SIAM J. Optim. – volume: 25 start-page: 228 year: 1983 end-page: 239 ident: br000050 article-title: The minimum cost flow problem: a unifying approach to dual algorithms and a new tree-search algorithm publication-title: Math. Program. – volume: 6 start-page: 378 year: 2009 end-page: 393 ident: br000065 article-title: New algorithms for convex cost tension problem with application to computer vision publication-title: Discrete Optim. – volume: 92 start-page: 66 year: 2000 end-page: 95 ident: br000045 article-title: The English auction with differentiated commodities publication-title: J. Econom. Theory – volume: 23 start-page: 1222 year: 2001 end-page: 1239 ident: br000020 article-title: Fast approximate energy minimization via graph cuts publication-title: IEEE Trans. Pattern Anal. Mach. Intell. – volume: 50 start-page: 1483 year: 1982 end-page: 1504 ident: br000060 article-title: Job matching, coalition formation and gross substitutes publication-title: Econometrica – volume: 58 start-page: 486 year: 2010 ident: 10.1016/j.orl.2014.06.005_br000055 article-title: On the optimal policy structure in serial inventory systems with lost sales publication-title: Oper. Res. doi: 10.1287/opre.1090.0716 – volume: 6 start-page: 721 year: 1984 ident: 10.1016/j.orl.2014.06.005_br000040 article-title: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images publication-title: IEEE Trans. Pattern Anal. Mach. Intell. doi: 10.1109/TPAMI.1984.4767596 – volume: 92 start-page: 66 year: 2000 ident: 10.1016/j.orl.2014.06.005_br000045 article-title: The English auction with differentiated commodities publication-title: J. Econom. Theory doi: 10.1006/jeth.1999.2580 – volume: 50 start-page: 1483 year: 1982 ident: 10.1016/j.orl.2014.06.005_br000060 article-title: Job matching, coalition formation and gross substitutes publication-title: Econometrica doi: 10.2307/1913392 – volume: 15 start-page: 969 year: 2006 ident: 10.1016/j.orl.2014.06.005_br000100 article-title: Seamless image stitching by minimizing false edges publication-title: IEEE Trans. Image Process. doi: 10.1109/TIP.2005.863958 – year: 2013 ident: 10.1016/j.orl.2014.06.005_br000085 – volume: 10 start-page: 489 year: 1991 ident: 10.1016/j.orl.2014.06.005_br000025 article-title: A dual algorithm for submodular flow problems publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(91)90027-M – year: 2003 ident: 10.1016/j.orl.2014.06.005_br000070 – volume: vol. 8283 start-page: 468 year: 2013 ident: 10.1016/j.orl.2014.06.005_br000090 article-title: Computing a Walrasian equilibrium in iterative auctions with multiple differentiated items – volume: 56 start-page: 937 year: 2008 ident: 10.1016/j.orl.2014.06.005_br000095 article-title: On the structure of lost-sales inventory models publication-title: Oper. Res. doi: 10.1287/opre.1070.0482 – volume: 16 start-page: 698 year: 2007 ident: 10.1016/j.orl.2014.06.005_br000010 article-title: Phase unwrapping via graph cuts publication-title: IEEE Trans. Image Process. doi: 10.1109/TIP.2006.888351 – volume: 96 start-page: 602 year: 2006 ident: 10.1016/j.orl.2014.06.005_br000005 article-title: An efficient dynamic auction for heterogeneous commodities publication-title: Amer. Econ. Rev. doi: 10.1257/aer.96.3.602 – volume: 25 start-page: 228 year: 1983 ident: 10.1016/j.orl.2014.06.005_br000050 article-title: The minimum cost flow problem: a unifying approach to dual algorithms and a new tree-search algorithm publication-title: Math. Program. doi: 10.1007/BF02591772 – volume: 23 start-page: 1222 year: 2001 ident: 10.1016/j.orl.2014.06.005_br000020 article-title: Fast approximate energy minimization via graph cuts publication-title: IEEE Trans. Pattern Anal. Mach. Intell. doi: 10.1109/34.969114 – volume: 26 start-page: 261 year: 2006 ident: 10.1016/j.orl.2014.06.005_br000035 article-title: Image restoration with discrete constrained total variation, part I: fast and exact optimization publication-title: J. Math. Imaging Vision doi: 10.1007/s10851-006-8803-0 – volume: 145 start-page: 163 year: 2014 ident: 10.1016/j.orl.2014.06.005_br000080 article-title: Dijkstra’s algorithm and L-concave function maximization publication-title: Math. Program. doi: 10.1007/s10107-013-0643-2 – volume: 6 start-page: 378 year: 2009 ident: 10.1016/j.orl.2014.06.005_br000065 article-title: New algorithms for convex cost tension problem with application to computer vision publication-title: Discrete Optim. doi: 10.1016/j.disopt.2009.04.006 – year: 2006 ident: 10.1016/j.orl.2014.06.005_br000030 – start-page: 267 year: 2007 ident: 10.1016/j.orl.2014.06.005_br000015 article-title: Combinatorial auction – volume: 14 start-page: 699 year: 2003 ident: 10.1016/j.orl.2014.06.005_br000075 article-title: On steepest descent algorithms for discrete convex functions publication-title: SIAM J. Optim. doi: 10.1137/S1052623402419005 |
| SSID | ssj0007818 |
| Score | 2.1440914 |
| Snippet | We analyze minimization algorithms for L♮-convex functions in discrete convex analysis and establish exact bounds for the number of iterations required by the... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 361 |
| SubjectTerms | Analysis of algorithm Discrete convex function Discrete optimization Steepest descent algorithm |
| Title | Exact bounds for steepest descent algorithms of L-convex function minimization |
| URI | https://dx.doi.org/10.1016/j.orl.2014.06.005 |
| Volume | 42 |
| WOSCitedRecordID | wos000340221300012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-7468 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007818 issn: 0167-6377 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nj9MwELWgywEOiF1ALAvIBw5AFJQPO3aOK1QECBUkFqm3KE5smt1uUiVZ1OXXM_5IGrGAAIlLVEVN6nhex8-TmXkIPQ3KtKCwqfbjJIYNSsESP4-13AvLGaNhLDkXRmyCLRZ8uUw_unTbzsgJsLrm2226-a-mhnNgbF06-xfmHm8KJ-AzGB2OYHY4_pHh51td9ii0XJLpteCBHeUGnL9X2tZNXr7-0rRVvzo3aRzvfZN5vvX0EmfQoNuNnLv6zCl5_bCRrcuccz2CVt7alAN1E7s1vasy-3bRjPGbVQVDtyHcs-qy6VbVNNwQkjE11cXArtTB2LAkuNskdoIs0rpSzoC7EyuaM_haEk0wRSeOM7Yt2d0aHFsllivu3UYaTl82rX5rFBLTejWgu7VszDD8pIekRwQbSK0ZQK6jvYjRlM_Q3vHb-fLduFwzboLA4yMMr75NEuAPP_Rz8jIhJCd30G23k8DHFgH76JqsD9CtSX_JA7TvPHeHn7n24s_vooUBCLYAwQAQPAAEO4DgHUBwo_AAEDwABE8Bcg99fj0_efXGd6oafhFHvPdpxAualkSxUgng50WkglLJUpQ0FUwJlhAepJLRPAdqxwKhJUaVJtpBqgqm4vtoVje1fICwSgTwbRnCfRThZcgF5wT4aMiESESSH6JgmK6scC3ntfLJOhtyC08zmOFMz3Bm8ivpIXoxXrKx_VZ-92Uy2CBzhNESwQwA8-vLHv7bZUfo5u4P8QjN-vZCPkY3iq991bVPHKy-A4DXkC4 |
| linkProvider | Elsevier |
| 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=Exact+bounds+for+steepest+descent+algorithms+of+L-convex+function+minimization&rft.jtitle=Operations+research+letters&rft.au=Murota%2C+Kazuo&rft.au=Shioura%2C+Akiyoshi&rft.date=2014-07-01&rft.pub=Elsevier+B.V&rft.issn=0167-6377&rft.eissn=1872-7468&rft.volume=42&rft.issue=5&rft.spage=361&rft.epage=366&rft_id=info:doi/10.1016%2Fj.orl.2014.06.005&rft.externalDocID=S0167637714000844 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-6377&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-6377&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-6377&client=summon |