A model-hybrid approach for unconstrained optimization problems
DOI10.1007/S11075-013-9757-0zbMATH Open1300.65043OpenAlexW2060779062MaRDI QIDQ403087FDOQ403087
Authors: Fu-Sheng Wang, Jinbao Jian, Chuanlong Wang
Publication date: 29 August 2014
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-013-9757-0
Recommendations
- A hybrid trust region algorithm for unconstrained optimization
- A variant of trust-region methods for unconstrained optimization
- scientific article; zbMATH DE number 721738
- A quasi-Newton trust region method with a new conic model for the unconstrained optimization
- scientific article; zbMATH DE number 773160
nonlinear programmingalgorithmglobal convergencenumerical resultunconstrained optimizationlocal convergencequasi-Newton methodtrust region methodshybrid approachapproximate model
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51) Methods of quasi-Newton type (90C53)
Cites Work
- Computing a Trust Region Step
- Testing Unconstrained Optimization Software
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Trust Region Methods
- Conic Approximations and Collinear Scalings for Optimizers
- Nonmonotonic trust region algorithm
- A quasi-Newton trust-region method
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values
- An adaptive approach of conic trust-region method for unconstrained optimization problems
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Title not available (Why is that?)
- A New Algorithm for Unconstrained Optimization
- A global optimization using linear relaxation for generalized geometric programming
- Title not available (Why is that?)
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- Title not available (Why is that?)
- A hybrid algorithm for nonlinear minimax problems
- A nonmonotone trust region method with new inexact line search for unconstrained optimization
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Some investigations in a new algorithm for nonlinear optimization based on conic models of the objective function
- Two new unconstrained optimization algorithms which use function and gradient values
- Interpolation by conic model for unconstrained optimization
- Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
- A new nonmonotone adaptive trust region method based on simple quadratic models
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- Title not available (Why is that?)
- The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
- Title not available (Why is that?)
- A Conic Algorithm for Optimization
- An algorithm for solving new trust region subproblem with conic model
Cited In (7)
- Hybrid modelling for robust solving
- A hybrid trust region algorithm for unconstrained optimization
- New five-step DTZD algorithm for future nonlinear minimization with quartic steady-state error pattern
- Continuous and discrete Zhang dynamics for real-time varying nonlinear optimization
- Title not available (Why is that?)
- Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods
- Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization
Uses Software
This page was built for publication: A model-hybrid approach for unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403087)