An unconstrained optimization method using nonmonotone second order Goldstein's line search (Q2464310): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1389061
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Wen-Yu Sun / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: minpack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11425-007-0072-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107854223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curvilinear path steplength algorithms for minimization which use directions of negative curvature / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification of Armijo's step-size rule for negative curvature / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of directions of negative curvature in a modified newton method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonmonotone Line Search Technique for Newton’s Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of nonmonotone descent methods for unconstrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4463308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotonic trust region algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone adaptive trust-region method for unconstrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone trust region method for solving optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone curvilinear line search methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5440598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization theory and methods. Nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank

Latest revision as of 14:31, 27 June 2024

scientific article
Language Label Description Also known as
English
An unconstrained optimization method using nonmonotone second order Goldstein's line search
scientific article

    Statements

    An unconstrained optimization method using nonmonotone second order Goldstein's line search (English)
    0 references
    0 references
    0 references
    19 December 2007
    0 references
    The authors consider the problem of unconstrained minimization of a real-valued twice continuously differentiable function of \(n\) variables. They propose a new unconstrained optimization method using the non-monotone second-order Goldstein linear search, which is different from both the nonmonotone Goldstein step size rule and the curvilinear line search rule. Under mild conditions, the sequence generated by the proposed algorithm is proved to converge to a stationary point satisfying the second-order optimality conditions. Numerical tests presented in the concluding part of the paper show a good numerical behavior of the method in comparison with some other methods from the literature. The method is efficient and robust especially for some ill-conditioned problems.
    0 references
    0 references
    nonmonotone method
    0 references
    direction of negative curvature
    0 references
    line search
    0 references
    descent pair
    0 references
    unconstrained optimization
    0 references
    numerical examples
    0 references
    algorithm
    0 references
    ill-conditioned problems
    0 references
    0 references