A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2413500): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3539529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On three-term conjugate gradient algorithms for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace Trust‐Region Methods for Large Bound‐Constrained Nonlinear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Krylov-Subspace Recycling via the POD-Augmented Conjugate-Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3125515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New conjugacy conditions and related nonlinear conjugate gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Barzilai-Borwein conjugate gradient method / 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: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subspace Minimization Method for the Trust-Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function minimization by conjugate gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Limited Memory Conjugate Gradient Method / 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: Q5479892 / 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: Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The conjugate gradient method in extremal problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate gradient algorithms in nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subspace implementation of quasi-Newton trust region methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Riemannian subspace limited-memory SR1 trust region method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subspace conjugate gradient algorithm for large-scale unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modified BFGS Algorithm for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace methods for large scale nonlinear equations and nonlinear least squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4589030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subspace Study on Conjugate Gradient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search / rank
 
Normal rank

Revision as of 14:17, 16 July 2024

scientific article
Language Label Description Also known as
English
A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
scientific article

    Statements

    A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (English)
    0 references
    0 references
    14 September 2018
    0 references
    conjugate gradient method
    0 references
    nonmonotone line search
    0 references
    subspace minimization
    0 references
    unconstrained optimization
    0 references
    global convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers