Abstract
We establish a relaxation subgradient method (RSM) that includes parameter optimization using rank-two correction of metric matrices with a structure similar to that in quasi-Newtonian (QN) methods. The metric matrix transformation consists in suppressing orthogonal and amplifying collinear components of the minimum-length subgradient vector. The problem of constructing a metric matrix is stated as a problem of solving an involved system of inequalities. Solving such a system is based on a new learning algorithm. An estimate for its convergence rate is obtained depending on the parameters of the subgradient set. A new RSM has been developed and investigated on this basis. Computational experiments on complex large-dimension functions confirm the efficiency of the algorithm proposed.

This publication has 16 references indexed in Scilit: