Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
From MaRDI portal
Publication:2483087
DOI10.1016/j.camwa.2007.08.038zbMath1183.90387OpenAlexW2026294088MaRDI QIDQ2483087
Publication date: 5 May 2008
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2007.08.038
unconstrained optimizationglobal convergencesuperlinear convergencenonmonotone line searchnonmonotone trust region method
Related Items
An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation ⋮ Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods ⋮ A memory gradient method based on the nonmonotone technique ⋮ A class of nonmonotone Armijo-type line search method for unconstrained optimization ⋮ An ODE-like nonmonotone method for nonsmooth convex optimization ⋮ A nonmonotone ODE-based method for unconstrained optimization ⋮ A nonmonotone trust region method with new inexact line search for unconstrained optimization ⋮ Nonmonotone smoothing Broyden-like method for generalized nonlinear complementarity problems ⋮ A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering ⋮ Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search ⋮ A model-hybrid approach for unconstrained optimization problems ⋮ A class of accelerated conjugate-gradient-like methods based on a modified secant equation ⋮ An adaptive trust region method based on simple conic models ⋮ Conditional gradient method for vector optimization ⋮ On the worst-case evaluation complexity of non-monotone line search algorithms ⋮ A hybrid BB-type method for solving large scale unconstrained optimization ⋮ Combining nonmonotone conic trust region and line search techniques for unconstrained optimization ⋮ Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization ⋮ A hybrid method for solving systems of nonsmooth equations with box constraints ⋮ A smoothing Broyden-like method with a nonmonotone derivative-free line search for nonlinear complementarity problems ⋮ A new nonmonotone adaptive trust region line search method for unconstrained optimization ⋮ A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound ⋮ Nonmonotone adaptive trust region method with line search based on new diagonal updating ⋮ An improved trust region method for unconstrained optimization ⋮ A new nonmonotone trust region Barzilai-Borwein method for unconstrained optimization problems ⋮ A modified nonmonotone trust region line search method ⋮ On efficiency of nonmonotone Armijo-type line searches ⋮ An ODE-based nonmonotone method for unconstrained optimization problems ⋮ A new regularized quasi-Newton method for unconstrained optimization ⋮ Two nonmonotone trust region algorithms based on an improved Newton method ⋮ Nonmonotone conic trust region method with line search technique for bound constrained optimization ⋮ A memory gradient method for non-smooth convex optimization ⋮ A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On a subproblem of trust region algorithms for constrained optimization
- A trust region algorithm for equality constrained optimization
- A class of nonmonotone trust region algorithms for unconstrained optimization problems
- Nonmonotonic trust region algorithm
- Nonmonotone adaptive trust-region method for unconstrained optimization problems
- Nonmonotone trust region method for solving optimization problems
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Testing Unconstrained Optimization Software
- A 'taut string algorithm' for straightening a piecewise linear path in two dimensions
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Maximization by Quadratic Hill-Climbing
- An algorithm for solving linearly constrained optimization problems
- A method for the solution of certain non-linear problems in least squares
- On the nonmonotone line search
