Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
Sign Up to like & getrecommendations! Published in 2021 at "Annals of Operations Research"
DOI: 10.1007/s10479-019-03216-z
Abstract: In this article, a mathematical programming problem under affinely parameterized uncertain data with multiple objective functions given by SOS-convex polynomials, denoting by (UMP), is considered; moreover, its robust counterpart, denoting by (RMP), is proposed by… read more here.
Keywords: sos convex; optimization; efficient solutions; multiple objective ... See more keywords
SOS-Convex Semialgebraic Programs and its Applications to Robust Optimization: A Tractable Class of Nonsmooth Convex Optimization
Sign Up to like & getrecommendations! Published in 2017 at "Set-Valued and Variational Analysis"
DOI: 10.1007/s11228-017-0456-1
Abstract: In this paper, we introduce a new class of nonsmooth convex functions called SOS-convex semialgebraic functions extending the recently proposed notion of SOS-convex polynomials. This class of nonsmooth convex functions covers many common nonsmooth functions… read more here.
Keywords: class nonsmooth; sos convex; convex; optimization ... See more keywords