A general duality scheme for nonconvex minimization problems with a strict inequality constraint
type: Item
instance of: scholarly article
title: A general duality scheme for nonconvex minimization problems with a strict inequality constraint
zbMATH Open document ID: 0934.90058
DOI: 10.1023/A:1008285930026
author: K. Appert
published in: Journal of Global Optimization
publication date: 2000-04-25T00:00:00Z
review text: Let \(g\) and \(k\) be two extended-real-valued convex functions defined over a locally convex topological vector space \(X\). Let \(f\) and \(h\) belong to the class of functions on \(X\) that can be written as lower envelope of an arbitrary family of convex functions. The authors establish a duality formula for the minimization problem: \[ \text{minimize }\{f(x)+ g(x)\text{ subject to } h(x) +k(x)<0\}. \] Applications in D.C. and Lipschitzian optimization are considered. The present paper is an extension of a previous work by the same authors [Nonconvex Optimization and Its Applications 27, 331-345 (1998)].
reviewed by: Alberto Seeger
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 49N15
zbMATH DE Number: 1228658
zbMATH Keywords: duality theory
zbMATH Keywords: D. C. optimization
zbMATH Keywords: Lipschitzian optimization
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1228658