A nonmonotone conic trust region method based on line search for solving unconstrained optimization
DOI10.1016/J.CAM.2008.05.028zbMATH Open1160.90008OpenAlexW2037454731MaRDI QIDQ1002190FDOQ1002190
Authors: Shaojian Qu, Qing-Pu Zhang, Yueting Yang 
Publication date: 25 February 2009
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2008.05.028
Recommendations
- Nonmonotone conic trust region method with line search technique for bound constrained optimization
- Combining nonmonotone conic trust region and line search techniques for unconstrained optimization
- A nonmonotone trust region method with new inexact line search for unconstrained optimization
- A nonmonotone trust-region method of conic model for unconstrained optimization
- A new nonmonotone trust-region method of conic model for solving unconstrained optimization
- A nonmonotone trust region method based on simple conic models for unconstrained optimization
- A new nonmonotone adaptive trust region line search method for unconstrained optimization
- A nonmonotone trust-region line search method for large-scale unconstrained optimization
- A nonmonotone adaptive trust region method based on conic model for unconstrained optimization
- A nonmonotone adaptive trust region method for unconstrained optimization based on conic model
convergencealgorithmunconstrained optimizationnumerical experimentstrust region methodnonmonotone techniqueline search techniqueconic model
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Cites Work
- Testing Unconstrained Optimization Software
- A Nonmonotone Line Search Technique for Newton’s Method
- Conic Approximations and Collinear Scalings for Optimizers
- A nonmonotone trust region method for unconstrained optimization
- Title not available (Why is that?)
- On the global convergence of trust region algorithms for unconstrained minimization
- Title not available (Why is that?)
- Global convergence of conjugate gradient methods without line search
- Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
- A nonmonotone adaptive trust region method and its convergence
- Title not available (Why is that?)
- A nonmonotone trust region method for nonlinear programming with simple bound constraints
- Global convergence of a two-parameter family of conjugate gradient methods without line search
- A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy
- A nonmonotone trust-region method of conic model for unconstrained optimization
Cited In (6)
- Nonmonotone conic trust region method with line search technique for bound constrained optimization
- On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization
- A nonmonotone line search method based on a simple conic model function
- Combining nonmonotone conic trust region and line search techniques for unconstrained optimization
- A nonmonotone self-adaptive conic trust region algorithm for unconstrained optimization
- A nonmonotone trust region method with new inexact line search for unconstrained optimization
Uses Software
This page was built for publication: A nonmonotone conic trust region method based on line search for solving unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1002190)
