A conic Newton method is attractive because it converges to a local minimizzer rapidly from any sufficiently good initial guess. However, it may be expensive to solve the conic Newton equation at each iterate. In this...
Supported by NNSF of China and NSF of Jiangsu Province
A Class of Collinear Scaling Algorithms for Unconstrained Optimization. An appealing approach to the solution of nonlinear optimization problems based on conic models of the objective function has been in troduced by ...