Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1176.90464
Tseng, Paul
Some convex programs without a duality gap. (English)
[J] Math. Program. 116, No. 1-2 (B), 553-578 (2009). ISSN 0025-5610; ISSN 1436-4646/e

The author studies the convex programming problem:$$ v_{P} = \min f_o(x) \text{ s.t. } f_{i}(x) \le 0,\ i=1,\ldots,m\tag{P}$$ where each $f_i:\bbfR^{n}\rightarrow (-\infty,\infty)$ is a proper convex lower semicontinuous function and its associated dual: $$v_{D} = \max q(\mu) \text{ where } q(\mu) = \inf_{x}\{f_o(x)+ \sum _{i=1}^m f_{i}(x)\}, \mu \ge 0.\tag{D}$$ The main result concerns the non-existence of the duality gap i.e. $v_{P} = v_{D}$. It is shown that for separable functions $f_o, f_1,\ldots,f_m$ the relation $v_{P} = v_{D}$ holds under the assumption of $\text{dom } f_o \subseteq \bigcap_{1=1}^{m} \text{ dom } f_{i}$ where $\text{dom } f = \{x|f(x) < \infty\}$. The author gives also a sufficient condition involving weakly analytic functions.
[R. N. Kaul (Delhi)]

MSC 2000:: *90C25 Convex programming
90C46 Optimality conditions, duality

Keywords: separable convex program; recession direction; duality gap; Hoffman's error bound; weakly analytic function

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]