论文信息 - A method for minimizing convex functions based on continuous approximations to the subdifferential

A method for minimizing convex functions based on continuous approximations to the subdifferential

A numerical method for unconstrained minization of nondifferentiable convex functions is proposed and studied. This method is based on a continuous approximations to the subdifferential. An algorithm for the construction of the continuous approximations is described. Results of numerical experiments are presented

Adil M. Bagirov | A. Bagirov

[1] Naum Zuselevich Shor,et al. Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[2] D. Mayne,et al. Algorithm Models for Nondifferentiable Optimization , 1985 .

[3] Claude Lemaréchal,et al. An Algorithm for Minimizing Convex Functions , 1974, IFIP Congress.

[4] Philip Wolfe,et al. Finding the nearest point in A polytope , 1976, Math. Program..

[5] R. Mifflin. Semismooth and Semiconvex Functions in Constrained Optimization , 1977 .

[6] Adil M. Bagirov,et al. A method of approximating a quasidifferential , 1992 .