Konnov, I. V. Application of the method of successive relaxation to solution of extremal problems with semismooth functions. (Russian) Zbl 0713.90060 Issled. Prikl. Mat. 15, 24-30 (1988). The author modifies early personal results about successive relaxation algorithms solving convex minimization problems to obtain a new algorithm solving nonconvex optimization problems. Concepts of generalized subgradient and local Lipschitzian function are used to describe the problem and the proposed algorithm. Convergence of the method is proved. Reviewer: X.Zhang Cited in 1 ReviewCited in 1 Document MSC: 90C26 Nonconvex programming, global optimization 90C30 Nonlinear programming 90-08 Computational methods for problems pertaining to operations research and mathematical programming Keywords:semismooth optimization; successive relaxation algorithms; nonconvex optimization; generalized subgradient; local Lipschitzian function; Convergence PDFBibTeX XMLCite \textit{I. V. Konnov}, Issled. Prikl. Mat. 15, 24--30 (1988; Zbl 0713.90060) Full Text: EuDML