Scientific Research An Academic Publisher
OPEN ACCESS
Add your e-mail address to receive free newsletters from SCIRP.
Select Journal AA AAD AAR AASoci AAST ABB ABC ABCR ACES ACS ACT AD ADR AE AER AHS AID AiM AIT AJAC AJC AJCC AJCM AJIBM AJMB AJOR AJPS ALAMT ALC ALS AM AMI AMPC ANP APD APE APM ARS ARSci AS ASM BLR CC CE CellBio ChnStd CM CMB CN CRCM CS CSTA CUS CWEEE Detection EMAE ENG EPE ETSN FMAR FNS GEP GIS GM Graphene GSC Health IB ICA IIM IJAA IJAMSC IJCCE IJCM IJCNS IJG IJIDS IJIS IJMNTA IJMPCERO IJNM IJOC IJOHNS InfraMatics JACEN JAMP JASMI JBBS JBCPR JBiSE JBM JBNB JBPC JCC JCDSA JCPT JCT JDAIP JDM JEAS JECTC JEMAA JEP JFCMV JFRM JGIS JHEPGC JHRSS JIBTVA JILSA JIS JMF JMGBND JMMCE JMP JPEE JQIS JSBS JSEA JSEMAT JSIP JSS JSSM JST JTR JTST JTTs JWARP LCE MC ME MI MME MNSMS MPS MR MRC MRI MSA MSCE NJGC NM NR NS OALib OALibJ ODEM OJA OJAB OJAcct OJAnes OJAP OJApo OJAppS OJAPr OJAS OJBD OJBIPHY OJBM OJC OJCB OJCD OJCE OJCM OJD OJDer OJDM OJE OJEE OJEM OJEMD OJEpi OJER OJF OJFD OJG OJGas OJGen OJI OJIC OJIM OJINM OJL OJM OJMC OJMetal OJMH OJMI OJMIP OJML OJMM OJMN OJMP OJMS OJMSi OJN OJNeph OJO OJOG OJOGas OJOp OJOph OJOPM OJOTS OJPathology OJPC OJPChem OJPed OJPM OJPP OJPS OJPsych OJRA OJRad OJRD OJRM OJS OJSS OJSST OJST OJSTA OJTR OJTS OJU OJVM OPJ POS PP PST PSYCH SAR SCD SGRE SM SN SNL Soft SS TEL TI UOAJ VP WET WJA WJCD WJCMP WJCS WJET WJM WJNS WJNSE WJNST WJV WSN YM
More>>
Grippo, L. and Lucidi, S. (1997) A globally convergent version of the Polak-Ribière gradient method. Mathematical Programming, 78, 375-391. doi:10.1007/BF02614362
has been cited by the following article:
TITLE: A hybrid conjugate gradient method for optimization problems
AUTHORS: Xiangrong Li, Xupei Zhao
KEYWORDS: Line Search; Unconstrained Optimization; Conjugate Gradient Method; Global Convergence
JOURNAL NAME: Natural Science, Vol.3 No.1, January 29, 2011
ABSTRACT: A hybrid method of the Polak-Ribière-Polyak (PRP) method and the Wei-Yao-Liu (WYL) method is proposed for unconstrained optimization pro- blems, which possesses the following properties: i) This method inherits an important property of the well known PRP method: the tendency to turn towards the steepest descent direction if a small step is generated away from the solution, preventing a sequence of tiny steps from happening; ii) The scalar holds automatically; iii) The global convergence with some line search rule is established for nonconvex functions. Numerical results show that the method is effective for the test problems.
Related Articles:
Reconstructions for Continuous-Wave Diffuse Optical Tomography by a Globally Convergent Method
Jianzhong Su, Yueming Liu, Zi-Jing Lin, Steven Teng, Aubrey Rhoden, Natee Pantong, Hanli Liu
DOI: 10.4236/jamp.2014.25025 3,595 Downloads 5,315 Views Citations
Pub. Date: April 25, 2014
Mean Square Heun’s Method Convergent for Solving Random Differential Initial Value Problems of First Order
M. A. Sohaly
DOI: 10.4236/ajcm.2014.45040 3,524 Downloads 4,459 Views Citations
Pub. Date: December 29, 2014
The Sliding Gradient Algorithm for Linear Programming
Hochung Liu, Peizhuang Wang
DOI: 10.4236/ajor.2018.82009 1,082 Downloads 1,971 Views Citations
Pub. Date: March 30, 2018
Validity, Reliability and Convergent Analysis of Brazilian Version of Selection, Optimization and Compensation Questionnaire (QSOC)
Sionara Tamanini de Almeida, Thais de Lima Resende, Claus Dieter Stobäus
DOI: 10.4236/ce.2016.715207 1,276 Downloads 2,118 Views Citations
Pub. Date: September 13, 2016
On Decompositions of Real Polynomials Using Mathematical Programming Methods
Janez Povh
DOI: 10.4236/am.2011.23036 3,839 Downloads 7,752 Views Citations
Pub. Date: March 24, 2011
