A model-hybrid approach for unconstrained optimization problems
From MaRDI portal
The authors present a model-hybrid approach for unconstrained optimization problems based on the trust region method and a quasi-Newton method. Under certain assumptions, the global and local convergence analysis of the proposed new algorithm are established. Some preliminary numerical results are provided to illustrate the competitiveness of the model-hybrid approach.
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
Cites work
- A Conic Algorithm for Optimization
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- A global optimization using linear relaxation for generalized geometric programming
- A hybrid algorithm for nonlinear minimax problems
- A New Algorithm for Unconstrained Optimization
- A new nonmonotone adaptive trust region method based on simple quadratic models
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values
- A nonmonotone trust region method with new inexact line search for unconstrained optimization
- A quasi-Newton trust-region method
- An adaptive approach of conic trust-region method for unconstrained optimization problems
- An algorithm for solving new trust region subproblem with conic model
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Benchmarking optimization software with performance profiles.
- Computing a Trust Region Step
- Conic Approximations and Collinear Scalings for Optimizers
- Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
- scientific article; zbMATH DE number 1382459 (Why is no real title available?)
- scientific article; zbMATH DE number 1186893 (Why is no real title available?)
- scientific article; zbMATH DE number 3725604 (Why is no real title available?)
- scientific article; zbMATH DE number 3503002 (Why is no real title available?)
- scientific article; zbMATH DE number 1234743 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- Interpolation by conic model for unconstrained optimization
- Nonmonotonic trust region algorithm
- Some investigations in a new algorithm for nonlinear optimization based on conic models of the objective function
- Testing Unconstrained Optimization Software
- The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Trust Region Methods
- Two new unconstrained optimization algorithms which use function and gradient values
Cited in
(7)- Hybrid modelling for robust solving
- New five-step DTZD algorithm for future nonlinear minimization with quartic steady-state error pattern
- Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods
- Continuous and discrete Zhang dynamics for real-time varying nonlinear optimization
- scientific article; zbMATH DE number 4091191 (Why is no real title available?)
- A hybrid trust region algorithm for unconstrained optimization
- Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization
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)
