A descent algorithm without line search for unconstrained optimization
In this paper, a new descent algorithm for solving unconstrained optimization problem is presented. Its search direction is descent and line search procedure can be avoided except for the first iteration. It is globally convergent under mild conditions. The search direction of the new algorithm is g...
Saved in:
| Published in | Applied mathematics and computation Vol. 215; no. 7; pp. 2528 - 2533 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Amsterdam
Elsevier Inc
01.12.2009
Elsevier |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0096-3003 1873-5649 |
| DOI | 10.1016/j.amc.2009.08.058 |
Cover
| Abstract | In this paper, a new descent algorithm for solving unconstrained optimization problem is presented. Its search direction is descent and line search procedure can be avoided except for the first iteration. It is globally convergent under mild conditions. The search direction of the new algorithm is generalized and convergence of corresponding algorithm is also proved. Numerical results show that the algorithm is efficient for given test problems. |
|---|---|
| AbstractList | In this paper, a new descent algorithm for solving unconstrained optimization problem is presented. Its search direction is descent and line search procedure can be avoided except for the first iteration. It is globally convergent under mild conditions. The search direction of the new algorithm is generalized and convergence of corresponding algorithm is also proved. Numerical results show that the algorithm is efficient for given test problems. |
| Author | Zhou, Guangming |
| Author_xml | – sequence: 1 givenname: Guangming surname: Zhou fullname: Zhou, Guangming email: zhougm@xtu.edu.cn organization: School of Mathematics and Computational Science, Xiangtan University, Xiangtan, 411105 Hunan, People’s Republic of China |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22474501$$DView record in Pascal Francis |
| BookMark | eNp9kD1PxDAMhiMEEsfBD2DrwtjitGmaigkhviQkFpgjk7pcTr3klAQQ_HpyHCwMt9iW7eeV_R6xfecdMXbKoeLA5fmywpWpaoC-AlVBq_bYjKuuKVsp-n02ywNZNgDNITuKcQkAneRixm4ui4GiIZcKnF59sGmxKj5y9G-pmKyjIhIGsyhGH4o3Z7yLKWDuD4VfJ7uyX5isd8fsYMQp0slvnrPnm-unq7vy4fH2_uryoTRN3aVSCXzJhZQ9AikcOcpeNFKoFqSsTUOq44bTOCDHVo6qMyhAqYY4id4IaObsbKu7xmhwGgM6Y6NeB7vC8KnrWnSiBZ73uu2eCT7GQKM2Nv1curl-0hz0xja91Nk2vbFNg9LZtkzyf-Sf-C7mYstQfv3dUtDRWHKGBhvIJD14u4P-BsVJh4Y |
| CODEN | AMHCBQ |
| CitedBy_id | crossref_primary_10_1155_2013_802136 crossref_primary_10_1016_j_ocemod_2023_102202 crossref_primary_10_1155_2015_309525 crossref_primary_10_3390_math6040063 crossref_primary_10_4236_jamp_2018_61013 |
| Cites_doi | 10.1016/j.amc.2003.08.058 10.1016/S0377-0427(99)00276-9 10.1093/imanum/23.3.377 10.1093/imamat/11.3.317 10.1023/A:1011986402461 10.1016/S0377-0427(02)00416-8 10.1093/imanum/22.1.1 10.1137/S003614299427315X 10.1145/355934.355936 10.1137/S1052623497330963 10.1137/S1052623494266365 10.1023/A:1012903105391 10.1093/imanum/13.3.321 10.1016/j.amc.2003.12.058 10.1023/A:1013844413130 10.1093/imanum/8.1.141 10.1023/A:1014838419611 10.1016/j.amc.2004.06.097 10.1006/jcph.1999.6224 10.1002/jcc.540140115 |
| ContentType | Journal Article |
| Copyright | 2009 Elsevier Inc. 2015 INIST-CNRS |
| Copyright_xml | – notice: 2009 Elsevier Inc. – notice: 2015 INIST-CNRS |
| DBID | AAYXX CITATION IQODW |
| DOI | 10.1016/j.amc.2009.08.058 |
| DatabaseName | CrossRef Pascal-Francis |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1873-5649 |
| EndPage | 2533 |
| ExternalDocumentID | 22474501 10_1016_j_amc_2009_08_058 S0096300309007899 |
| 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- 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-84ab327669a0e8af1a694364850662c3e871c1efda1a56f87ca40883e1e49c403 |
| IEDL.DBID | AIKHN |
| ISSN | 0096-3003 |
| IngestDate | Mon Jul 21 09:14:21 EDT 2025 Wed Oct 01 04:43:19 EDT 2025 Thu Apr 24 22:59:49 EDT 2025 Fri Feb 23 02:31:13 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Keywords | Line search Unconstrained optimization Numerical result Descent method Convergence Numerical analysis Applied mathematics Optimization method Problem solving Iteration Search algorithm |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c327t-84ab327669a0e8af1a694364850662c3e871c1efda1a56f87ca40883e1e49c403 |
| PageCount | 6 |
| ParticipantIDs | pascalfrancis_primary_22474501 crossref_citationtrail_10_1016_j_amc_2009_08_058 crossref_primary_10_1016_j_amc_2009_08_058 elsevier_sciencedirect_doi_10_1016_j_amc_2009_08_058 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2009-12-01 |
| PublicationDateYYYYMMDD | 2009-12-01 |
| PublicationDate_xml | – month: 12 year: 2009 text: 2009-12-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | Applied mathematics and computation |
| PublicationYear | 2009 |
| Publisher | Elsevier Inc Elsevier |
| Publisher_xml | – name: Elsevier Inc – name: Elsevier |
| References | Sun, Yuan (bib2) 2006 Dai, Yuan, Yuan (bib7) 2002; 22 Liu, Dai (bib10) 2001; 111 Moré, Garbow, Hillstrom (bib25) 1981; 7 Fletcher (bib14) 1990; 25 Glunt, Haydan, Raydan (bib18) 1993; 14 Chen, Sun (bib20) 2002; 146 Dai, Liao (bib8) 2002; 22 Birgin, Martinez, Raydan (bib15) 2000; 10 Raydan (bib12) 1993; 13 Dai, Yuan (bib1) 2000 Barzilai, Borwein (bib4) 1988; 8 Birgin, Chambouleyron, Martinez (bib19) 1999; 151 Shi (bib22) 2004; 157 Shi, Shen (bib3) 2005; 167 Dixon (bib5) 1973; 11 Raydan (bib11) 1997; 7 Nocedal, Stephen (bib24) 1999 Varhatis, Amdroulakis, Lambrinos (bib13) 2000; 114 Friedlander, Martinez, Molina, Raydan (bib16) 1999; 36 Sun, Zhang (bib21) 2001; 103 Shi, Shen (bib23) 2005; 161 Dai, Zhang (bib9) 2001; 27 Dai, Yuan (bib6) 2003; 23 Magoulas (bib17) 2000; 114 Dai (10.1016/j.amc.2009.08.058_bib8) 2002; 22 Magoulas (10.1016/j.amc.2009.08.058_bib17) 2000; 114 Chen (10.1016/j.amc.2009.08.058_bib20) 2002; 146 Shi (10.1016/j.amc.2009.08.058_bib3) 2005; 167 Shi (10.1016/j.amc.2009.08.058_bib22) 2004; 157 Birgin (10.1016/j.amc.2009.08.058_bib19) 1999; 151 Raydan (10.1016/j.amc.2009.08.058_bib11) 1997; 7 Shi (10.1016/j.amc.2009.08.058_bib23) 2005; 161 Moré (10.1016/j.amc.2009.08.058_bib25) 1981; 7 Dai (10.1016/j.amc.2009.08.058_bib6) 2003; 23 Friedlander (10.1016/j.amc.2009.08.058_bib16) 1999; 36 Barzilai (10.1016/j.amc.2009.08.058_bib4) 1988; 8 Raydan (10.1016/j.amc.2009.08.058_bib12) 1993; 13 Dai (10.1016/j.amc.2009.08.058_bib7) 2002; 22 Liu (10.1016/j.amc.2009.08.058_bib10) 2001; 111 Varhatis (10.1016/j.amc.2009.08.058_bib13) 2000; 114 Sun (10.1016/j.amc.2009.08.058_bib2) 2006 Sun (10.1016/j.amc.2009.08.058_bib21) 2001; 103 Glunt (10.1016/j.amc.2009.08.058_bib18) 1993; 14 Fletcher (10.1016/j.amc.2009.08.058_bib14) 1990; 25 Dai (10.1016/j.amc.2009.08.058_bib9) 2001; 27 Dixon (10.1016/j.amc.2009.08.058_bib5) 1973; 11 Nocedal (10.1016/j.amc.2009.08.058_bib24) 1999 Birgin (10.1016/j.amc.2009.08.058_bib15) 2000; 10 Dai (10.1016/j.amc.2009.08.058_bib1) 2000 |
| References_xml | – volume: 8 start-page: 141 year: 1988 end-page: 148 ident: bib4 article-title: Two point step size gradient methods publication-title: IMA J. Numer. Anal. – volume: 22 start-page: 1 year: 2002 end-page: 10 ident: bib8 article-title: R-linear convergence of the Barzilai and Borwein gradient method publication-title: IMA J. Numer. Anal. – volume: 13 start-page: 321 year: 1993 end-page: 326 ident: bib12 article-title: On the Barzilai and Borwein gradient choice of steplength for the gradient method publication-title: IMA J. Numer. Anal. – year: 2000 ident: bib1 article-title: Nonlinear Conjugate Gradient Methods (in Chinese) – volume: 36 start-page: 275 year: 1999 end-page: 289 ident: bib16 article-title: Gradient method with retards and generalizations publication-title: SIAM J. Numer. Anal. – volume: 7 start-page: 17 year: 1981 end-page: 41 ident: bib25 article-title: Testing unconstrained optimization software publication-title: ACM Trans. Math. Software – year: 1999 ident: bib24 article-title: Numerical Optimization – volume: 161 start-page: 753 year: 2005 end-page: 768 ident: bib23 article-title: A new descent algorithm with curve search rule publication-title: Appl. Math. Computat. – volume: 23 start-page: 377 year: 2003 end-page: 393 ident: bib6 article-title: Alternate minimization gradient method publication-title: IMA J. Numer. Anal. – volume: 11 start-page: 317 year: 1973 end-page: 328 ident: bib5 article-title: Conjugate directions without line searches publication-title: J. Inst. Math. Appl. – volume: 25 start-page: 165 year: 1990 end-page: 179 ident: bib14 article-title: Low storage methods for unconstrained optimization publication-title: Lect. Appl. Math. (AMS) – volume: 114 start-page: 367 year: 2000 end-page: 386 ident: bib17 article-title: A class of gradient unconstrained minimization algorithms with adaptive stepsize publication-title: J. Comput. Appl. Math. – volume: 146 start-page: 37 year: 2002 end-page: 45 ident: bib20 article-title: Global convergence of a two-parameter family of conjugate gradient methods without line search publication-title: J. Computat. Appl. Math. – volume: 27 start-page: 377 year: 2001 end-page: 385 ident: bib9 article-title: An adaptive two-point stepsize gradient algorithm publication-title: Numer. Algorithm. – volume: 111 start-page: 359 year: 2001 end-page: 379 ident: bib10 article-title: Minimization algorithms based on supervisor and searcher cooperation publication-title: JOTA – volume: 22 start-page: 103 year: 2002 end-page: 109 ident: bib7 article-title: Modified two-point stepsize gradient methods for unconstrained optimization publication-title: Computat. Optimizat. Appl. – year: 2006 ident: bib2 article-title: Optimization Theory and Methods: Nonlinear Programming – volume: 114 start-page: 367 year: 2000 end-page: 386 ident: bib13 article-title: A class of gradient unconstrained minimization algorithms with adaptive stepsize publication-title: J. Comput. Appl. Math. – volume: 7 start-page: 26 year: 1997 end-page: 33 ident: bib11 article-title: The Barzilai and Borwein method for the large scale unconstrained minimization problem publication-title: SIAM J. Optimizat. – volume: 14 start-page: 114 year: 1993 end-page: 120 ident: bib18 article-title: Molecular conformations from distance matrices publication-title: J. Comput. Chem. – volume: 10 start-page: 1196 year: 2000 end-page: 1211 ident: bib15 article-title: Nonmonotone spectral projected gradient methods on convex sets publication-title: SIAM J. Optim. – volume: 157 start-page: 393 year: 2004 end-page: 405 ident: bib22 article-title: Convergence of line search methods for unconstrained optimization publication-title: Appl. Math. Computat. – volume: 167 start-page: 94 year: 2005 end-page: 107 ident: bib3 article-title: Convergence of descent method without line search publication-title: Appl. Math. Computat. – volume: 151 start-page: 862 year: 1999 end-page: 880 ident: bib19 article-title: Estimation of the optical constants and the thickness of thin films using unconstrained optimization publication-title: J. Comput. Phys. – volume: 103 start-page: 161 year: 2001 end-page: 173 ident: bib21 article-title: Global convergence of conjugate gradient methods without line search publication-title: Ann. Operat. Res. – volume: 157 start-page: 393 year: 2004 ident: 10.1016/j.amc.2009.08.058_bib22 article-title: Convergence of line search methods for unconstrained optimization publication-title: Appl. Math. Computat. doi: 10.1016/j.amc.2003.08.058 – volume: 114 start-page: 367 year: 2000 ident: 10.1016/j.amc.2009.08.058_bib13 article-title: A class of gradient unconstrained minimization algorithms with adaptive stepsize publication-title: J. Comput. Appl. Math. doi: 10.1016/S0377-0427(99)00276-9 – year: 2006 ident: 10.1016/j.amc.2009.08.058_bib2 – year: 1999 ident: 10.1016/j.amc.2009.08.058_bib24 – volume: 23 start-page: 377 year: 2003 ident: 10.1016/j.amc.2009.08.058_bib6 article-title: Alternate minimization gradient method publication-title: IMA J. Numer. Anal. doi: 10.1093/imanum/23.3.377 – volume: 114 start-page: 367 year: 2000 ident: 10.1016/j.amc.2009.08.058_bib17 article-title: A class of gradient unconstrained minimization algorithms with adaptive stepsize publication-title: J. Comput. Appl. Math. doi: 10.1016/S0377-0427(99)00276-9 – volume: 11 start-page: 317 year: 1973 ident: 10.1016/j.amc.2009.08.058_bib5 article-title: Conjugate directions without line searches publication-title: J. Inst. Math. Appl. doi: 10.1093/imamat/11.3.317 – volume: 111 start-page: 359 year: 2001 ident: 10.1016/j.amc.2009.08.058_bib10 article-title: Minimization algorithms based on supervisor and searcher cooperation publication-title: JOTA doi: 10.1023/A:1011986402461 – volume: 146 start-page: 37 year: 2002 ident: 10.1016/j.amc.2009.08.058_bib20 article-title: Global convergence of a two-parameter family of conjugate gradient methods without line search publication-title: J. Computat. Appl. Math. doi: 10.1016/S0377-0427(02)00416-8 – volume: 22 start-page: 1 year: 2002 ident: 10.1016/j.amc.2009.08.058_bib8 article-title: R-linear convergence of the Barzilai and Borwein gradient method publication-title: IMA J. Numer. Anal. doi: 10.1093/imanum/22.1.1 – volume: 36 start-page: 275 year: 1999 ident: 10.1016/j.amc.2009.08.058_bib16 article-title: Gradient method with retards and generalizations publication-title: SIAM J. Numer. Anal. doi: 10.1137/S003614299427315X – volume: 7 start-page: 17 year: 1981 ident: 10.1016/j.amc.2009.08.058_bib25 article-title: Testing unconstrained optimization software publication-title: ACM Trans. Math. Software doi: 10.1145/355934.355936 – volume: 10 start-page: 1196 year: 2000 ident: 10.1016/j.amc.2009.08.058_bib15 article-title: Nonmonotone spectral projected gradient methods on convex sets publication-title: SIAM J. Optim. doi: 10.1137/S1052623497330963 – volume: 7 start-page: 26 year: 1997 ident: 10.1016/j.amc.2009.08.058_bib11 article-title: The Barzilai and Borwein method for the large scale unconstrained minimization problem publication-title: SIAM J. Optimizat. doi: 10.1137/S1052623494266365 – volume: 103 start-page: 161 year: 2001 ident: 10.1016/j.amc.2009.08.058_bib21 article-title: Global convergence of conjugate gradient methods without line search publication-title: Ann. Operat. Res. doi: 10.1023/A:1012903105391 – volume: 13 start-page: 321 year: 1993 ident: 10.1016/j.amc.2009.08.058_bib12 article-title: On the Barzilai and Borwein gradient choice of steplength for the gradient method publication-title: IMA J. Numer. Anal. doi: 10.1093/imanum/13.3.321 – year: 2000 ident: 10.1016/j.amc.2009.08.058_bib1 – volume: 161 start-page: 753 year: 2005 ident: 10.1016/j.amc.2009.08.058_bib23 article-title: A new descent algorithm with curve search rule publication-title: Appl. Math. Computat. doi: 10.1016/j.amc.2003.12.058 – volume: 27 start-page: 377 year: 2001 ident: 10.1016/j.amc.2009.08.058_bib9 article-title: An adaptive two-point stepsize gradient algorithm publication-title: Numer. Algorithm. doi: 10.1023/A:1013844413130 – volume: 8 start-page: 141 year: 1988 ident: 10.1016/j.amc.2009.08.058_bib4 article-title: Two point step size gradient methods publication-title: IMA J. Numer. Anal. doi: 10.1093/imanum/8.1.141 – volume: 22 start-page: 103 year: 2002 ident: 10.1016/j.amc.2009.08.058_bib7 article-title: Modified two-point stepsize gradient methods for unconstrained optimization publication-title: Computat. Optimizat. Appl. doi: 10.1023/A:1014838419611 – volume: 25 start-page: 165 year: 1990 ident: 10.1016/j.amc.2009.08.058_bib14 article-title: Low storage methods for unconstrained optimization publication-title: Lect. Appl. Math. (AMS) – volume: 167 start-page: 94 year: 2005 ident: 10.1016/j.amc.2009.08.058_bib3 article-title: Convergence of descent method without line search publication-title: Appl. Math. Computat. doi: 10.1016/j.amc.2004.06.097 – volume: 151 start-page: 862 year: 1999 ident: 10.1016/j.amc.2009.08.058_bib19 article-title: Estimation of the optical constants and the thickness of thin films using unconstrained optimization publication-title: J. Comput. Phys. doi: 10.1006/jcph.1999.6224 – volume: 14 start-page: 114 year: 1993 ident: 10.1016/j.amc.2009.08.058_bib18 article-title: Molecular conformations from distance matrices publication-title: J. Comput. Chem. doi: 10.1002/jcc.540140115 |
| SSID | ssj0007614 |
| Score | 1.9380968 |
| Snippet | In this paper, a new descent algorithm for solving unconstrained optimization problem is presented. Its search direction is descent and line search procedure... |
| SourceID | pascalfrancis crossref elsevier |
| SourceType | Index Database Enrichment Source Publisher |
| StartPage | 2528 |
| SubjectTerms | Convergence Descent method Exact sciences and technology Line search Mathematical analysis Mathematics Numerical analysis Numerical analysis. Scientific computation Numerical result Sciences and techniques of general use Unconstrained optimization |
| Title | A descent algorithm without line search for unconstrained optimization |
| URI | https://dx.doi.org/10.1016/j.amc.2009.08.058 |
| Volume | 215 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier ScienceDirect customDbUrl: eissn: 1873-5649 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0007614 issn: 0096-3003 databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier ScienceDirect (LUT) customDbUrl: eissn: 1873-5649 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0007614 issn: 0096-3003 databaseCode: ACRLP dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] customDbUrl: eissn: 1873-5649 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0007614 issn: 0096-3003 databaseCode: AIKHN dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1873-5649 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0007614 issn: 0096-3003 databaseCode: AKRWK dateStart: 19930101 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07a8MwED7yWFpK6ZOmj6ChU8GJbMmyNIbQkLY0UwPZjCxLbUpeNMna314plkMDJUM3YyxbnM7fney77wO4z7TIYp3jIJecBlQJEXAjaKAywmmsCZNFtcWA9Yf0eRSPKtAte2FcWaXH_gLTN2jtz7S9NduL8dj1-ArHF0WwcHFOiCrUbfzhvAb1ztNLf7AFZLtTL8iYhSvzwqT8ubkp85JT5VkreQs74fe_w9PRQi6t0UyhdvErBPVO4NjnjqhTTO8UKnp2BoevW-LV5Tn0OigvCJqQnLzP7c7_Y4rct9b5eoVcRokK10Y2V0U2pLns0IlE6BzNLXhMfVfmBQx7j2_dfuClEgJFomQVcCoze8CYkFhzaULJBCWMOj46Fimi7b5IhdrkMpQxMzxRklp8ITrUVCiKySXUZvOZvgIUGS4ZybShOqJ2yTJjFCeYG5mwxL6wDcClhVLlecTdTCdpWTD2mVqjOn1LkTqJy5g34GE7ZFGQaOy7mJZmT3c8IbUgv29Yc2eJtg-yOUpCYxxe_---N3AQeckIHN5CbfW11nc2D1llTai2vsOm97YfIR7cbw |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NT8IwGG4QD2qM8TPiB_bgyWTYrV3XHgmRoAInSLgtXdcqBhiRcfW327IOJTEcvC3LujVvu_dje97nAeA-UTwJVYq8VDDiEcm5xzQnnkwwI6HCVBRoiz7tDMnLKBxVQKvshbGwSuf7C5--8tbuzKOz5uN8PLY9vtzyRWHEbZzjfAfskjCIbAXW-PrBeZg6vaBi5hbkhXD5a3MF8hJT6TgrWQNZ2fe_g9PhXCyMyXShdfErALWPwZHLHGGzmNwJqKjZKTjorWlXF2eg3YRpQc8ExeQtM3X_-xTaL63ZMoc2n4TFxoYmU4UmoNnc0EpEqBRmxnVMXU_mORi2nwatjueEEjyJgyj3GBGJOaCUC6SY0L6gnGBKLBsdDSRWpiqSvtKp8EVINYukIMa7YOUrwiVB-AJUZ9lMXQIYaCYoTpQmKiBmwRKtJcOIaRHRyLyuNYBKC8XSsYjbmU7iEi72ERujWnVLHluBy5DVwMN6yLyg0Nh2MSnNHm_sg9i4-G3D6htLtH6QyVAiEiL_6n_3vQN7nUGvG3ef-6_XYD9w4hHIvwHV_HOpbk1Gkif11Y77BvK93Tc |
| 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=A+descent+algorithm+without+line+search+for+unconstrained+optimization&rft.jtitle=Applied+mathematics+and+computation&rft.au=Zhou%2C+Guangming&rft.date=2009-12-01&rft.issn=0096-3003&rft.volume=215&rft.issue=7&rft.spage=2528&rft.epage=2533&rft_id=info:doi/10.1016%2Fj.amc.2009.08.058&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_amc_2009_08_058 |
| 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 |