A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization
From MaRDI portal
Publication:856089
DOI10.1016/j.amc.2006.01.087zbMath1106.65054OpenAlexW1994391611MaRDI QIDQ856089
Xiaolong Tan, Fu-Sheng Wang, Ke-Cun Zhang
Publication date: 7 December 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.01.087
Related Items (3)
Nonmonotone algorithm for minimax optimization problems ⋮ A hybrid algorithm for nonlinear minimax problems ⋮ A variant of trust-region methods for unconstrained optimization
Uses Software
Cites Work
- On incomplete Lagrange function and saddle point optimality criteria in mathematical programming
- An approximate approach for fractional programming with absolute-value functions
- Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
- Conic Approximations and Collinear Scalings for Optimizers
- The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
- Testing Unconstrained Optimization Software
- Unnamed Item
- Unnamed Item
This page was built for publication: A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization