A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method (Q1825603): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5604794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4073134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient line search for nonlinear least squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A derivative-free bracketing scheme for univariate minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5657612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5553606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rates of convergence of a one-dimensional search based on interpolating polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Conjugate Gradient Method for Linear and Nonlinear Operator Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the conjugate gradient method with computationally convenient modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Correction Concerning the Convergence Rate for the Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical convergence conditions for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence conditions for restarted conjugate gradient methods with inaccurate line searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory / 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: A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent method for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for nonlinear constraints that use lagrangian functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new three-term conjugate gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate Gradient Methods with Inexact Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134790 / rank
 
Normal rank

Latest revision as of 11:18, 20 June 2024

scientific article
Language Label Description Also known as
English
A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method
scientific article

    Statements

    A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method (English)
    0 references
    0 references
    1989
    0 references
    The author develops a derivative-based univariate minimization algorithm which combines a bracketing strategy, the bisection method and Hermite cubic interpolation. It is proved that the proposed algorithm achieves quadratic convergence using one function and one derivative evaluation each iteration. Also the author proposes an efficient conjugate gradient search scheme which incorporate the derivative-based univariate algorithm. Some experimental results are presented.
    0 references
    0 references
    numerical examples
    0 references
    derivative-based univariate minimization algorithm
    0 references
    bracketing strategy
    0 references
    bisection method
    0 references
    Hermite cubic interpolation
    0 references
    quadratic convergence
    0 references
    conjugate gradient search scheme
    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
    0 references
    0 references
    0 references