A variant of trust-region methods for unconstrained optimization
From MaRDI portal
Publication:2518723
DOI10.1016/j.amc.2008.04.049zbMath1159.65065OpenAlexW1972272528MaRDI QIDQ2518723
Li Wang, Chuan-Long Wang, Ke-Cun Zhang, Fu-Sheng Wang
Publication date: 16 January 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2008.04.049
algorithmunconstrained optimizationconvergencenumerical exampleslinear modelconic modeltrust-region methodsquadratic model
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items (6)
A nonmonotone trust region method based on simple conic models for unconstrained optimization ⋮ A hybrid algorithm for linearly constrained minimax problems ⋮ An adaptive nonmonotone trust-region method with curvilinear search for minimax problem ⋮ A quasi-Newton trust region method based on a new fractional model ⋮ An ODE-based nonmonotone method for unconstrained optimization problems ⋮ Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A nonmonotone trust region method for unconstrained optimization
- A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization
- Linearization method for a class of multiplicative programming with exponent
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Two new unconstrained optimization algorithms which use function and gradient values
- A quasi-Newton trust-region method
- On the convergence of a new trust region algorithm
- Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
- Computing a Trust Region Step
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- On the global convergence of trust region algorithms for unconstrained minimization
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- Conic Approximations and Collinear Scalings for Optimizers
- The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
- Testing Unconstrained Optimization Software
- Computing Optimal Locally Constrained Steps
- Trust Region Methods
- A Conic Algorithm for Optimization
- Optimality Conditions for Trust-Region Subproblems Involving a Conic Model
- A New Algorithm for Unconstrained Optimization
- Hybrid conjugate gradient methods for unconstrained optimization
This page was built for publication: A variant of trust-region methods for unconstrained optimization