Nonmonotone adaptive trust-region method for unconstrained optimization problems
In this paper, an adaptive trust region method with nonmonotone technique for unconstrained optimization problems is presented and analyzed. The global and local convergence results of the algorithm are established. Numerical results show that the new method is efficient.
Gespeichert in:
| Veröffentlicht in: | Applied mathematics and computation Jg. 163; H. 1; S. 489 - 504 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York, NY
Elsevier Inc
05.04.2005
Elsevier |
| Schlagworte: | |
| ISSN: | 0096-3003, 1873-5649 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In this paper, an adaptive trust region method with nonmonotone technique for unconstrained optimization problems is presented and analyzed. The global and local convergence results of the algorithm are established. Numerical results show that the new method is efficient. |
|---|---|
| AbstractList | In this paper, an adaptive trust region method with nonmonotone technique for unconstrained optimization problems is presented and analyzed. The global and local convergence results of the algorithm are established. Numerical results show that the new method is efficient. |
| Author | Fu, Jinhua Sun, Wenyu |
| Author_xml | – sequence: 1 givenname: Jinhua surname: Fu fullname: Fu, Jinhua email: happycrsky@clong.com – sequence: 2 givenname: Wenyu surname: Sun fullname: Sun, Wenyu email: wyusun@public1.ptt.js.cn |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16530152$$DView record in Pascal Francis |
| BookMark | eNp9kEtLxDAURoOM4MzoD3DXjcvWe5O-Blcy-AJRF7oOaZJqhjYpSWZAf72tIwguZnU351w434LMrLOakHOEDAHLy00meplRgDwDmgHiEZljXbG0KPPVjMwBVmXKANgJWYSwAYCqxHxOXp6c7Z11cXyXCCWGaHY6iX4bYur1u3E26XX8cCppnU-2VjobohfGapW4Ee7Nl4gTNXjXdLoPp-S4FV3QZ793Sd5ub17X9-nj893D-voxlYxWMa2aJkdd5ExT0SBT2EomgFZMilJJrKVSomQCaY5tK8bEhrEcaS2haOoaGrYkF_u_gwhSdK0XVprAB2964T85lgUDLOjI4Z6T3oXgdfuHAJ-m4xs-Tsen6ThQPk43OtU_R5r4kzmldwfNq72px_Sd0Z4HabSVWhmvZeTKmQP2N5zUjGA |
| CODEN | AMHCBQ |
| CitedBy_id | crossref_primary_10_1016_j_amc_2005_10_044 crossref_primary_10_1016_j_amc_2010_10_042 crossref_primary_10_1016_j_camwa_2007_08_038 crossref_primary_10_1142_S0217595911003454 crossref_primary_10_1007_s10589_012_9477_8 crossref_primary_10_1016_j_camwa_2010_04_034 crossref_primary_10_1155_2014_610612 crossref_primary_10_1007_s11075_012_9652_0 crossref_primary_10_1016_j_ejor_2010_09_007 crossref_primary_10_1016_j_amc_2010_10_043 crossref_primary_10_1080_10556788_2013_855761 crossref_primary_10_1016_j_cam_2007_01_027 crossref_primary_10_1177_1077546312436750 crossref_primary_10_1016_j_amc_2005_04_111 crossref_primary_10_1016_j_jkss_2008_05_004 crossref_primary_10_1080_03155986_2025_2467512 crossref_primary_10_1007_s11464_008_0001_5 crossref_primary_10_1016_j_apnum_2016_09_018 crossref_primary_10_1177_1077546311408473 crossref_primary_10_1016_j_cam_2008_10_062 crossref_primary_10_1016_j_cam_2009_02_100 crossref_primary_10_1016_j_amc_2009_05_009 crossref_primary_10_1016_j_camwa_2008_05_010 crossref_primary_10_1155_2015_825839 crossref_primary_10_1016_j_amc_2010_09_044 crossref_primary_10_1016_j_camwa_2008_05_030 crossref_primary_10_1016_j_cam_2014_04_026 crossref_primary_10_1016_j_camwa_2010_08_002 crossref_primary_10_1080_02331934_2023_2234920 crossref_primary_10_1007_s10589_018_0051_x crossref_primary_10_1007_s12190_012_0572_x crossref_primary_10_1108_IJICC_12_2018_0178 crossref_primary_10_1007_s12190_010_0386_7 crossref_primary_10_1142_S0217595910002582 |
| Cites_doi | 10.1137/0720042 10.1016/S0377-0427(02)00420-X 10.1007/BF00940345 10.1016/S0096-3003(98)10103-0 10.1016/S0898-1221(03)00130-5 10.1360/02ys9067 10.1007/BF00932218 10.1145/355934.355936 10.1137/0723046 10.1007/BF00939608 10.1007/BF01385810 10.1007/BF02614518 10.1007/s101070050012 10.1137/0911064 10.1137/S106482759427021X |
| ContentType | Journal Article |
| Copyright | 2004 Elsevier Inc. 2005 INIST-CNRS |
| Copyright_xml | – notice: 2004 Elsevier Inc. – notice: 2005 INIST-CNRS |
| DBID | AAYXX CITATION IQODW |
| DOI | 10.1016/j.amc.2004.02.011 |
| DatabaseName | CrossRef Pascal-Francis |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1873-5649 |
| EndPage | 504 |
| ExternalDocumentID | 16530152 10_1016_j_amc_2004_02_011 S0096300304002371 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 23M 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO ABAOU ABEFU ABFNM ABFRF ABJNI ABMAC ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACRLP ADBBV ADEZE ADGUI ADIYS ADMUD AEBSH AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AI. AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HLZ HMJ HVGLF HZ~ IHE J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SES SEW SME SPC SPCBC SSW SSZ T5K TAE TN5 VH1 VOH WH7 WUQ X6Y XPP ZMT ~02 ~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 AFXIZ AGCQF AGRNS BNPGV IQODW SSH |
| ID | FETCH-LOGICAL-c327t-7bb41e543e2ab13d1fc3a0273ca6dc18cdda63a1241ffa101b334128c05b880b3 |
| ISICitedReferencesCount | 57 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000227044000035&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0096-3003 |
| IngestDate | Mon Jul 21 09:16:40 EDT 2025 Sat Nov 29 02:46:05 EST 2025 Tue Nov 18 21:26:45 EST 2025 Fri Feb 23 02:29:04 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Superlinear convergence Global convergence Unconstrained optimization Nonmonotone methods Trust region method Numerical analysis Applied mathematics Optimization method Algorithm Adaptive method Convergence Mathematical programming |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c327t-7bb41e543e2ab13d1fc3a0273ca6dc18cdda63a1241ffa101b334128c05b880b3 |
| PageCount | 16 |
| ParticipantIDs | pascalfrancis_primary_16530152 crossref_primary_10_1016_j_amc_2004_02_011 crossref_citationtrail_10_1016_j_amc_2004_02_011 elsevier_sciencedirect_doi_10_1016_j_amc_2004_02_011 |
| PublicationCentury | 2000 |
| PublicationDate | 2005-04-05 |
| PublicationDateYYYYMMDD | 2005-04-05 |
| PublicationDate_xml | – month: 04 year: 2005 text: 2005-04-05 day: 05 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY |
| PublicationTitle | Applied mathematics and computation |
| PublicationYear | 2005 |
| Publisher | Elsevier Inc Elsevier |
| Publisher_xml | – name: Elsevier Inc – name: Elsevier |
| References | Schnabel, Eskow (BIB9) 1990; 11 Grippo, Lamparillo, Lucidi (BIB5) 1989; 60 Cai, Sun (BIB1) 2003; 26 Moré (BIB7) 1983 Toint (BIB15) 1996; 17 Steihaug (BIB10) 1983; 20 Sun, Sampaio, Yuan (BIB11) 1999; 105 Yuan (BIB17) 2000; 87 Grippo, Lamparillo, Lucidi (BIB4) 1986; 23 Zhou, Sun (BIB22) 2003; 9 W. Sun, Nonmonotone trust-region method for optimization, Applied Mathematics and Computation (to appear) Dennis, Mei (BIB3) 1979; 28 Zhang, Zhang, Liao (BIB21) 2002; 45 W. Sun, Nonmonotone optimization methods: motivation and development, in: Invited talk represented in International Conference on Numerical Linear Algebra and Optimization, Guilin, China, 7–10 October 2003 Toint (BIB16) 1997; 77 Yuan, Sun (BIB18) 1997 Grippo, Lamparillo, Lucidi (BIB6) 1991; 59 Moré, Garbow, Hillstrom (BIB8) 1981; 7 Zhu (BIB23) 1998; 11 Sun, Han, Sun (BIB12) 2002; 146 Deng, Xiao, Zhou (BIB2) 1993; 26 Zhang (BIB19) 2003; 21 Zhang, Zhang (BIB20) 2003; 45 Steihaug (10.1016/j.amc.2004.02.011_BIB10) 1983; 20 Dennis (10.1016/j.amc.2004.02.011_BIB3) 1979; 28 Grippo (10.1016/j.amc.2004.02.011_BIB4) 1986; 23 Moré (10.1016/j.amc.2004.02.011_BIB8) 1981; 7 Zhang (10.1016/j.amc.2004.02.011_BIB21) 2002; 45 Yuan (10.1016/j.amc.2004.02.011_BIB17) 2000; 87 Grippo (10.1016/j.amc.2004.02.011_BIB6) 1991; 59 Yuan (10.1016/j.amc.2004.02.011_BIB18) 1997 Sun (10.1016/j.amc.2004.02.011_BIB11) 1999; 105 Toint (10.1016/j.amc.2004.02.011_BIB16) 1997; 77 Moré (10.1016/j.amc.2004.02.011_BIB7) 1983 10.1016/j.amc.2004.02.011_BIB14 Zhou (10.1016/j.amc.2004.02.011_BIB22) 2003; 9 Cai (10.1016/j.amc.2004.02.011_BIB1) 2003; 26 Sun (10.1016/j.amc.2004.02.011_BIB12) 2002; 146 Deng (10.1016/j.amc.2004.02.011_BIB2) 1993; 26 Schnabel (10.1016/j.amc.2004.02.011_BIB9) 1990; 11 Grippo (10.1016/j.amc.2004.02.011_BIB5) 1989; 60 Toint (10.1016/j.amc.2004.02.011_BIB15) 1996; 17 Zhang (10.1016/j.amc.2004.02.011_BIB19) 2003; 21 Zhang (10.1016/j.amc.2004.02.011_BIB20) 2003; 45 Zhu (10.1016/j.amc.2004.02.011_BIB23) 1998; 11 10.1016/j.amc.2004.02.011_BIB13 |
| References_xml | – volume: 26 start-page: 16 year: 2003 end-page: 21 ident: BIB1 article-title: A nonmonotone algorithm for minimax problem publication-title: Journal of Nanjing Normal University, Natural Science Edition – volume: 11 start-page: 1136 year: 1990 end-page: 1158 ident: BIB9 article-title: A new modified Cholesky factorization publication-title: SIAM Journal on Scientific Computing – volume: 105 start-page: 183 year: 1999 end-page: 194 ident: BIB11 article-title: Trust region methods with quasi-Newton update for nonsmooth least-squares problems publication-title: Applied Mathematics and Computation – volume: 9 start-page: 153 year: 2003 end-page: 163 ident: BIB22 article-title: Nonmonotone descent algorithm for nonsmooth unconstrained optimization problems publication-title: International Journal of Pure and Applied Mathematics – reference: W. Sun, Nonmonotone optimization methods: motivation and development, in: Invited talk represented in International Conference on Numerical Linear Algebra and Optimization, Guilin, China, 7–10 October 2003 – volume: 28 start-page: 453 year: 1979 end-page: 487 ident: BIB3 article-title: Two new unconstrained optimization algorithms which use function and gradient values publication-title: Journal of Optimization Theory and Applications – year: 1997 ident: BIB18 article-title: Optimization Theory and Methods – volume: 146 start-page: 89 year: 2002 end-page: 98 ident: BIB12 article-title: On global convergence of nonmonotone descent methods publication-title: Journal of Computational and Applied Mathematics – reference: W. Sun, Nonmonotone trust-region method for optimization, Applied Mathematics and Computation (to appear) – volume: 17 start-page: 725 year: 1996 end-page: 739 ident: BIB15 article-title: An assessment of nonmonotone linesearch technique for unconstrained optimization publication-title: SIAM Journal of Scientific Computing – volume: 20 start-page: 626 year: 1983 end-page: 637 ident: BIB10 article-title: The conjugate gradient method and trust region in large scale optimization publication-title: SIAM Journal of Numerical Analysis – volume: 87 start-page: 561 year: 2000 end-page: 573 ident: BIB17 article-title: On the truncated conjugate gradient method publication-title: Mathematical Programming – volume: 26 start-page: 259 year: 1993 end-page: 285 ident: BIB2 article-title: Nonmonotonic trust region algorithm publication-title: Journal of Optimization Theory and Applications – volume: 11 start-page: 375 year: 1998 end-page: 382 ident: BIB23 article-title: A nonmonotone trust region technique for unconstrained optimization publication-title: Systems Science and Mathematical Sciences – volume: 77 start-page: 69 year: 1997 end-page: 94 ident: BIB16 article-title: Non-monotone trust-region algorithm for nonlinear optimization subject to convex constraints publication-title: Mathematical Programming – volume: 60 start-page: 401 year: 1989 end-page: 419 ident: BIB5 article-title: A truncated Newton method with nonmonotone line search for unconstrained optimization publication-title: Journal of Optimization Theory and Applications – volume: 21 start-page: 237 year: 2003 end-page: 246 ident: BIB19 article-title: A nonmonotone trust region algorithm for nonlinear optimization subject to general constraints publication-title: Journal of Computational Mathematics – volume: 45 start-page: 1469 year: 2003 end-page: 1477 ident: BIB20 article-title: A nonmonotone adaptive trust region method and its convergence publication-title: Computers and Mathematics with Applications – volume: 59 start-page: 779 year: 1991 end-page: 805 ident: BIB6 article-title: A class of nonmonotone stabilization methods in unconstrained optimization publication-title: Numerical Mathematics – start-page: 258 year: 1983 end-page: 287 ident: BIB7 article-title: Recent development in algorithm and software for trust region methods publication-title: Mathematical Programming, The State of the Art – volume: 7 start-page: 17 year: 1981 end-page: 41 ident: BIB8 article-title: Testing unconstrained optimization software publication-title: ACM Transactions of Mathematical Software – volume: 23 start-page: 707 year: 1986 end-page: 716 ident: BIB4 article-title: A nonmonotone line search technique for Newton's method publication-title: SIAM Journal of Numerical Analysis – volume: 45 start-page: 620 year: 2002 end-page: 631 ident: BIB21 article-title: An adaptive trust region method and its convergence publication-title: Science in China (Series A) – volume: 20 start-page: 626 year: 1983 ident: 10.1016/j.amc.2004.02.011_BIB10 article-title: The conjugate gradient method and trust region in large scale optimization publication-title: SIAM Journal of Numerical Analysis doi: 10.1137/0720042 – ident: 10.1016/j.amc.2004.02.011_BIB13 – ident: 10.1016/j.amc.2004.02.011_BIB14 – volume: 146 start-page: 89 year: 2002 ident: 10.1016/j.amc.2004.02.011_BIB12 article-title: On global convergence of nonmonotone descent methods publication-title: Journal of Computational and Applied Mathematics doi: 10.1016/S0377-0427(02)00420-X – volume: 60 start-page: 401 year: 1989 ident: 10.1016/j.amc.2004.02.011_BIB5 article-title: A truncated Newton method with nonmonotone line search for unconstrained optimization publication-title: Journal of Optimization Theory and Applications doi: 10.1007/BF00940345 – volume: 105 start-page: 183 year: 1999 ident: 10.1016/j.amc.2004.02.011_BIB11 article-title: Trust region methods with quasi-Newton update for nonsmooth least-squares problems publication-title: Applied Mathematics and Computation doi: 10.1016/S0096-3003(98)10103-0 – volume: 45 start-page: 1469 year: 2003 ident: 10.1016/j.amc.2004.02.011_BIB20 article-title: A nonmonotone adaptive trust region method and its convergence publication-title: Computers and Mathematics with Applications doi: 10.1016/S0898-1221(03)00130-5 – volume: 45 start-page: 620 year: 2002 ident: 10.1016/j.amc.2004.02.011_BIB21 article-title: An adaptive trust region method and its convergence publication-title: Science in China (Series A) doi: 10.1360/02ys9067 – volume: 9 start-page: 153 year: 2003 ident: 10.1016/j.amc.2004.02.011_BIB22 article-title: Nonmonotone descent algorithm for nonsmooth unconstrained optimization problems publication-title: International Journal of Pure and Applied Mathematics – start-page: 258 year: 1983 ident: 10.1016/j.amc.2004.02.011_BIB7 article-title: Recent development in algorithm and software for trust region methods – volume: 26 start-page: 16 year: 2003 ident: 10.1016/j.amc.2004.02.011_BIB1 article-title: A nonmonotone algorithm for minimax problem publication-title: Journal of Nanjing Normal University, Natural Science Edition – volume: 28 start-page: 453 year: 1979 ident: 10.1016/j.amc.2004.02.011_BIB3 article-title: Two new unconstrained optimization algorithms which use function and gradient values publication-title: Journal of Optimization Theory and Applications doi: 10.1007/BF00932218 – volume: 11 start-page: 375 year: 1998 ident: 10.1016/j.amc.2004.02.011_BIB23 article-title: A nonmonotone trust region technique for unconstrained optimization publication-title: Systems Science and Mathematical Sciences – volume: 7 start-page: 17 issue: 1 year: 1981 ident: 10.1016/j.amc.2004.02.011_BIB8 article-title: Testing unconstrained optimization software publication-title: ACM Transactions of Mathematical Software doi: 10.1145/355934.355936 – year: 1997 ident: 10.1016/j.amc.2004.02.011_BIB18 – volume: 23 start-page: 707 year: 1986 ident: 10.1016/j.amc.2004.02.011_BIB4 article-title: A nonmonotone line search technique for Newton's method publication-title: SIAM Journal of Numerical Analysis doi: 10.1137/0723046 – volume: 26 start-page: 259 year: 1993 ident: 10.1016/j.amc.2004.02.011_BIB2 article-title: Nonmonotonic trust region algorithm publication-title: Journal of Optimization Theory and Applications doi: 10.1007/BF00939608 – volume: 59 start-page: 779 year: 1991 ident: 10.1016/j.amc.2004.02.011_BIB6 article-title: A class of nonmonotone stabilization methods in unconstrained optimization publication-title: Numerical Mathematics doi: 10.1007/BF01385810 – volume: 77 start-page: 69 year: 1997 ident: 10.1016/j.amc.2004.02.011_BIB16 article-title: Non-monotone trust-region algorithm for nonlinear optimization subject to convex constraints publication-title: Mathematical Programming doi: 10.1007/BF02614518 – volume: 87 start-page: 561 year: 2000 ident: 10.1016/j.amc.2004.02.011_BIB17 article-title: On the truncated conjugate gradient method publication-title: Mathematical Programming doi: 10.1007/s101070050012 – volume: 11 start-page: 1136 year: 1990 ident: 10.1016/j.amc.2004.02.011_BIB9 article-title: A new modified Cholesky factorization publication-title: SIAM Journal on Scientific Computing doi: 10.1137/0911064 – volume: 17 start-page: 725 year: 1996 ident: 10.1016/j.amc.2004.02.011_BIB15 article-title: An assessment of nonmonotone linesearch technique for unconstrained optimization publication-title: SIAM Journal of Scientific Computing doi: 10.1137/S106482759427021X – volume: 21 start-page: 237 year: 2003 ident: 10.1016/j.amc.2004.02.011_BIB19 article-title: A nonmonotone trust region algorithm for nonlinear optimization subject to general constraints publication-title: Journal of Computational Mathematics |
| SSID | ssj0007614 |
| Score | 2.006146 |
| Snippet | In this paper, an adaptive trust region method with nonmonotone technique for unconstrained optimization problems is presented and analyzed. The global and... |
| SourceID | pascalfrancis crossref elsevier |
| SourceType | Index Database Enrichment Source Publisher |
| StartPage | 489 |
| SubjectTerms | Calculus of variations and optimal control Exact sciences and technology Global convergence Mathematical analysis Mathematics Nonmonotone methods Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming, optimization and calculus of variations Sciences and techniques of general use Superlinear convergence Trust region method Unconstrained optimization |
| Title | Nonmonotone adaptive trust-region method for unconstrained optimization problems |
| URI | https://dx.doi.org/10.1016/j.amc.2004.02.011 |
| Volume | 163 |
| WOSCitedRecordID | wos000227044000035&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: 1873-5649 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007614 issn: 0096-3003 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9VAFB6kdaGI-MRWLbNwZYlkXnksi7So4KVgxbsL80iwpTc3mEbaf--ZV25SabELN-ES8pib78s5X5Iz50PonabUMJPViVW_CS8lSWRDRJIzonihNNxk3mwiXyyK5bI8DmXNvbMTyNu2uLwsu_8KNawDsO3U2TvAPR4UVsBvAB2WADss_wn4xbqFc61tk-19aWTnaoPc1IrEujAA2t412hUYQlazAtH6RIDyXMPGqzAxcz9YzfRT-Ro162ps9trHiXHdMP-ofzQ4gpy2P4cx8n8bXIz7UbdXw-x1g3BVKmIaQktbLJeyWQgNQWrKFR8QuTcICrlVeKvhv8K2f4Nw9kGuXFdJ7tqohiA8a5F9LXWNBYWxVu2sgkNYa01epbRK7aTvbZqLEuLd9sHnw-WXMUvnme_7Hv9O_OLtav-ujeMmzfKokz3cSY23QJnokpMn6HF4oMAHnghP0b26fYYeft0A9BwdTyiBIyXwlBLYUwIDJfCMEnhKCRwp8QJ9Pzo8-fgpCU4aiWY0v0hypTipBWc1lYowQxrNpO1kpGVmNCm0MTJjErQeaRoJF0ExUDe00KlQEOAVe4m2WhjjK4QNkxQeMXmha8IhW5aZYRk3WthOhFzxHZTGa1Xp0GbeDvm8uhGjHfR-3KXzPVZu25hHAKogEr34q4BMt-22NwNrc6JMQI4TdPcug3iNHmzujTdoCxCr36L7-vfFaf9rL1DtD89ilL0 |
| 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=Nonmonotone+adaptive+trust-region+method+for+unconstrained+optimization+problems&rft.jtitle=Applied+mathematics+and+computation&rft.au=Fu%2C+Jinhua&rft.au=Sun%2C+Wenyu&rft.date=2005-04-05&rft.issn=0096-3003&rft.volume=163&rft.issue=1&rft.spage=489&rft.epage=504&rft_id=info:doi/10.1016%2Fj.amc.2004.02.011&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_amc_2004_02_011 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0096-3003&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0096-3003&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0096-3003&client=summon |