Algorithms for a class of nondifferentiable problems

Papavassilopoulos, G

dc.contributor.author	Papavassilopoulos, G	en
dc.date.accessioned	2014-03-01T01:38:17Z
dc.date.available	2014-03-01T01:38:17Z
dc.date.issued	1981	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/22006
dc.subject	Necessary and Sufficient Condition	en
dc.subject	Nonlinear Programming	en
dc.subject	Optimal Algorithm	en
dc.title	Algorithms for a class of nondifferentiable problems	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/BF00933357	en
heal.identifier.secondary	http://dx.doi.org/10.1007/BF00933357	en
heal.publicationDate	1981	en
heal.abstract	A nonlinear programming problem with nondifferentiabilities is considered. The nondifferentiabilities are due to terms of the form min(f1(x),...,fn(x)), which may enter nonlinearly in the cost and the constraints. Necessary and sufficient conditions are developed. Two algorithms for solving this problem are described, and their convergence is studied. A duality framework for interpretation of the algorithms is also developed.	en
heal.journalName	Journal of Optimization Theory and Applications	en
dc.identifier.doi	10.1007/BF00933357	en