Optimization of Subgradient Method Parameters Based on Rank-Two Correction of Metric Matrices
- 1 May 2022
- journal article
- research article
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 16 (3) , 427-439
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.Keywords
This publication has 16 references indexed in Scilit:
- Non-smooth regularization in radial artificial neural networksIOP Conference Series: Materials Science and Engineering, 2018
- ON THE CONVERGENCE RATE OF THE SUBGRADIENT METHOD WITH METRIC VARIATION AND ITS APPLICATIONS IN NEURAL NETWORK APPROXIMATION SCHEMESVestnik Tomskogo Gosudarstvennogo Universiteta. Matematika i Mekhanika, 2018
- Accelerated gradient methods for nonconvex nonlinear and stochastic programmingMathematical Programming, 2015
- Universal gradient methods for convex optimization problemsMathematical Programming, 2014
- Method of conjugate subgradients with constrained memoryAutomation and Remote Control, 2014
- Note on minimization methods employing space stretchingCybernetics and Systems Analysis, 1976
- An extension of davidon methods to non differentiable problems1975
- Note on a method of conjugate subgradients for minimizing nondifferentiable functionsMathematical Programming, 1974
- On a recurrence method for computing normal solutions of linear algebraic equationsUSSR Computational Mathematics and Mathematical Physics, 1972
- Minimization of unsmooth functionalsUSSR Computational Mathematics and Mathematical Physics, 1969