Zero duality gap for a class of nonconvex optimization problems
type: Item
instance of: scholarly article
title: Zero duality gap for a class of nonconvex optimization problems
zbMATH Open document ID: 0829.90109
DOI: 10.1007/BF02192229
published in: Journal of Optimization Theory and Applications
publication date: 1995-08-27T00:00:00Z
review text: By an equivalent transformation using the \(p\)th power of the objective function and the constraint, a saddle point can be generated for a general class of nonconvex optimization problems. Zero duality gap is thus guaranteed when the primal-dual method is applied to the constructed equivalent form.
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 790568
zbMATH Keywords: saddle points
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: primal-dual method
Wikidata QID: Q57445571
author: Duan Li
MaRDI profile type: Publication
cites work: Q5630824
cites work: Q3688092
cites work: Multiplier and gradient methods
cites work: Multiplier methods: A survey
cites work: The multiplier method of Hestenes and Powell applied to convex programming
cites work: Convexification procedures and decomposition methods for nonconvex optimization problems
cites work: A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
description: scientific article; zbMATH DE number 790568