Application of the successive relaxation method to solve extremal problems with semismooth functions

DOI10.1007/BF01097341zbMath0784.90056MaRDI QIDQ1316573

Igor V. Konnov

Publication date: 21 February 1994

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/69092

zbMATH Keywords

convergencenonconvex optimizationgeneralized subgradientlocal Lipschitzian functionsemismooth optimizationsuccessive relaxation algorithms

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
• Semismooth and Semiconvex Functions in Constrained Optimization
• An Algorithm for Constrained Optimization with Semismooth Functions

This page was built for publication: Application of the successive relaxation method to solve extremal problems with semismooth functions