Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
From MaRDI portal
Publication:2483087
DOI10.1016/J.CAMWA.2007.08.038zbMATH Open1183.90387OpenAlexW2026294088MaRDI QIDQ2483087FDOQ2483087
Authors: Neng-Zhu Gu, Jiangtao Mo 
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
Recommendations
- A nonmonotone trust region method for unconstrained optimization
- A new trust region algorithm with a nonmonotone line search technique
- Nonmonotone trust region algorithm for unconstrained optimization problems
- A nonmonotone trust region method with new inexact line search for unconstrained optimization
- An efficient nonmonotone trust-region method for unconstrained optimization
global convergenceunconstrained optimizationnonmonotone trust region methodsuperlinear convergencenonmonotone line search
Cites Work
- Testing Unconstrained Optimization Software
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- A method for the solution of certain non-linear problems in least squares
- A Nonmonotone Line Search Technique for Newton’s Method
- Title not available (Why is that?)
- A trust region algorithm for equality constrained optimization
- Nonmonotonic trust region algorithm
- Nonmonotone trust region method for solving optimization problems
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- On a subproblem of trust region algorithms for constrained optimization
- Title not available (Why is that?)
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- On the nonmonotone line search
- Nonmonotone adaptive trust-region method for unconstrained optimization problems
- A class of nonmonotone trust region algorithms for unconstrained optimization problems
- An algorithm for solving linearly constrained optimization problems
- A 'taut string algorithm' for straightening a piecewise linear path in two dimensions
- Maximization by Quadratic Hill-Climbing
Cited In (41)
- An adaptive trust region method based on simple conic models
- On efficiency of nonmonotone Armijo-type line searches
- A new regularized quasi-Newton method for unconstrained optimization
- A hybrid BB-type method for solving large scale unconstrained optimization
- Conditional gradient method for vector optimization
- An ODE-based nonmonotone method for unconstrained optimization problems
- Nonmonotone adaptive trust region method with line search based on new diagonal updating
- An efficient nonmonotone trust-region method for unconstrained optimization
- A new trust region algorithm with a nonmonotone line search technique
- A class of nonmonotone armijo-type line search method for unconstrained optimization
- An efficient nonmonotone projected Barzilai-Borwein method for nonnegative matrix factorization with extrapolation
- A new nonmonotone adaptive trust region line search method for unconstrained optimization
- A hybrid method for solving systems of nonsmooth equations with box constraints
- A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound
- Nonmonotone conic trust region method with line search technique for bound constrained optimization
- Nonmonotone trust region algorithm for unconstrained optimization problems
- Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search
- A nonmonotone trust region method for unconstrained optimization
- Nonmonotone trust region methods with curvilinear path in unconstrained optimization
- A memory gradient method based on the nonmonotone technique
- A modified nonmonotone trust region line search method
- A memory gradient method for non-smooth convex optimization
- A new nonmonotone optimization method with trust region and second-order line search
- Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering
- On the worst-case evaluation complexity of non-monotone line search algorithms
- A model-hybrid approach for unconstrained optimization problems
- A new nonmonotone trust region Barzilai-Borwein method for unconstrained optimization problems
- A nonmonotone ODE-based method for unconstrained optimization
- An ODE-like nonmonotone method for nonsmooth convex optimization
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization
- An improved trust region method for unconstrained optimization
- Combining nonmonotone conic trust region and line search techniques for unconstrained optimization
- Nonmonotone smoothing Broyden-like method for generalized nonlinear complementarity problems
- A smoothing Broyden-like method with a nonmonotone derivative-free line search for nonlinear complementarity problems
- Two nonmonotone trust region algorithms based on an improved Newton method
- Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg-Marquardt methods
- A nonmonotone trust region method with new inexact line search for unconstrained optimization
- A class of accelerated conjugate-gradient-like methods based on a modified secant equation
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
- A trust-region method using extended nonmonotone technique for unconstrained optimization
Uses Software
This page was built for publication: Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483087)
