A modified ODE-based algorithm for unconstrained optimization problems (Q2248961): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: L-BFGS / 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/s11075-013-9703-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992191487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4894424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Algorithms and Timestep Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining trust-region techniques and Rosenbrock methods to compute stationary points / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ODE-based trust region method for unconstrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization theory and methods. Nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convergence of subspace trust region methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotonic trust region algorithm / 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: A Nonmonotone Line Search Technique for Newton’s Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonmonotone trust region method for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unconstrained optimization method using nonmonotone second order Goldstein's line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonmonotone trust-region method of conic model for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone adaptive trust region method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonmonotone line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limited memory BFGS method for large scale optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of quasi-Newton matrices and their use in limited memory methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of nonmonotone stabilization trust region methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank

Latest revision as of 17:18, 8 July 2024

scientific article
Language Label Description Also known as
English
A modified ODE-based algorithm for unconstrained optimization problems
scientific article

    Statements

    A modified ODE-based algorithm for unconstrained optimization problems (English)
    0 references
    0 references
    0 references
    27 June 2014
    0 references
    The authors propose a modified ODE-based trust region method for unconstrained optimization problems. At each iteration, a lower dimensional linear system is solved to obtain a trail step so as to avoid solving a trust region subproblem, and the approximation of the Hessian matrix to be positive definite or semidefinite is not required. The global convergence of the algorithm is established under certain conditions. The computational behavior of the proposed algorithm is illustrated by some numerical results for some testing problems.
    0 references
    0 references
    0 references
    0 references
    0 references
    unconstrained optimization
    0 references
    nonmonotone technique
    0 references
    ODE-based methods
    0 references
    IMPBOT algorithm
    0 references
    global convergence
    0 references
    0 references
    0 references
    0 references
    0 references