In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

In this paper, we propose a new iteration method based on the hybrid steepest descent method and Ishikawa-type method for seeking a solution of a variational inequality involving a Lipschitz continuous and strongly monotone mapping on the set of common fixed points for a finite family of Lipschitz continuous and quasi-pseudocontractive mappings in a real Hilbert space. MSC: Primary 41A65; 47H17...

This article studies the classical MDS and dwMDS location algorithm.On this basis, steepest descent algorithm is introduced to replace SMACOF algorithm as optimization objective function. The results show that the steepest descent method as the optimization objective function is simple and easy to implement. Compared with the dwMDS method based on SMACOF algorithm, the distributed MDS positioni...