A conjugate gradient method for unconstrained optimization problems (Q963493): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q928230
Created claim: DBLP publication ID (P1635): journals/ijmmsc/Yuan09, #quickstatements; #temporary_batch_1731461124002
 
(9 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Gong Lin Yuan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CG_DESCENT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CUTE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: minpack / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CUTEr / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2140096898 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58648434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New line search methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function minimization by conjugate gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generalized conjugate gradient algorithms. I: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3125512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization. Algorithms and consistent approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonmonotone conjugate gradient algorithm for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5479892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convergence properties of some new conjugate gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified PRP conjugate gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restart procedures for the conjugate gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of the Fletcher-Reeves algorithm with inexact linesearch / rank
 
Normal rank
Property / cites work
 
Property / cites work: The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient hybrid conjugate gradient techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence result for conjugate gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another hybrid conjugate gradient algorithm for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid conjugate gradient algorithm for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3313210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTE / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ijmmsc/Yuan09 / rank
 
Normal rank

Latest revision as of 02:42, 13 November 2024

scientific article
Language Label Description Also known as
English
A conjugate gradient method for unconstrained optimization problems
scientific article

    Statements

    A conjugate gradient method for unconstrained optimization problems (English)
    0 references
    20 April 2010
    0 references
    Summary: A hybrid method combining the FR conjugate gradient method and the WYL conjugate gradient method is proposed for unconstrained optimization problems. The presented method possesses the sufficient descent property under the strong Wolfe-Powell (SWP) line search rule relaxing the parameter \(\sigma <1\). Under the suitable conditions, the global convergence with the SWP line search rule and the weak Wolfe-Powell (WWP) line search rule is established for nonconvex function. Numerical results show that this method is better than the FR method and the WYL method.
    0 references
    hybrid method
    0 references
    strong Wolfe-Powell line search rule
    0 references
    global convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers