Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization
DOI10.1007/s11464-014-0356-8zbMath1311.65077OpenAlexW1970416436MaRDI QIDQ2258098
Lijuan Zhao, Wen-Yu Sun, Raimundo J. B. de Sampaio
Publication date: 2 March 2015
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-014-0356-8
algorithmglobal convergencesuperlinear convergencetrust region methodconic modelnumerical resultlarge scale optimizationnonmonotone technique
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combining nonmonotone conic trust region and line search techniques for unconstrained optimization
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- A self-adaptive trust region method with line search based on a simple subproblem model
- A trust region algorithm for equality constrained optimization
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Nonmonotone trust region method for solving optimization problems
- Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
- Scaled conjugate gradient algorithms for unconstrained optimization
- Optimization theory and methods. Nonlinear programming
- A new nonmonotone adaptive trust region method based on simple quadratic models
- An adaptive approach of conic trust-region method for unconstrained optimization problems
- A new nonmonotone trust-region method of conic model for solving unconstrained optimization
- An adaptive conic trust-region method for unconstrained optimization
- Conic Approximations and Collinear Scalings for Optimizers
- On the Estimation of Sparse Hessian Matrices
- The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
- Numerical Optimization
- Local andQ-superlinear convergence of a class of collinear scaling algorithms that extends quasi-newton methods with broyden's bounded-⊘ class of updates† ‡
- Trust Region Methods
- 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
- A Conic Algorithm for Optimization
- Optimality Conditions for Trust-Region Subproblems Involving a Conic Model
- Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
- A New Algorithm for Unconstrained Optimization
- Benchmarking optimization software with performance profiles.
- On the nonmonotone line search
This page was built for publication: Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization