Language:   Search:   Contact
World of
Mathematics
Database
»ZBMATH«
MSC 2000
MSC 2010
Reviewer
Service
Subscription
»ZBMATH«
ZBMATH Database | Advanced Search Print
Read more | Try MathML | Hide
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

ZBMATH Database Simple Search Advanced Search Command Search

Advanced Search

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 1134.90462
Jeyakumar, V.
The strong conical hull intersection property for convex programming.
(English)
[J] Math. Program. 106, No. 1 (A), 81-92 (2006). ISSN 0025-5610; ISSN 1436-4646/e

Summary: The strong conical hull intersection property (CHIP) is a geometric property of a collection of finitely many closed convex intersecting sets. This basic property, which was introduced by Deutsch et al. in 1999, is one of the central ingredients in the study of constrained interpolation and best approximation. In this paper we establish that the strong CHIP of intersecting sets of constraints is the key characterizing property for optimality and strong duality of convex programming problems. We first show that a sharpened strong CHIP is necessary and sufficient for a complete Lagrange multiplier characterization of optimality for the convex programming model problem $$(P_f)\quad \min\{f(x)\mid x\in C, -g(x) \in S \}$$ where $C$ is a closed convex subset of a Banach space $X$, $S$ is a closed convex cone which does not necessarily have non-empty interior, $Y$ is a Banach space, $f : X \to \Bbb R$ is a continuous convex function and $g : X \rightarrow Y$ is a continuous $S$-convex function. We also show that the strong CHIP completely characterizes the strong duality for partially finite convex programs, where $Y$ is finite dimensional and $g(x)= -Ax+b$ and $S$ is a polyhedral convex cone. Global sufficient conditions which are strictly weaker than the Slater type conditions are given for the strong CHIP and for the sharpened strong CHIP.
MSC 2000:
*90C25 Convex programming
49J53 Set-valued and variational analysis

Keywords: Strong conical hull intersection property; global constraint qualification; strong duality; optimality conditions; constrained approximation

Login Username: Password:

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

Master Server

Zentralblatt MATH Berlin [Germany]

© FIZ Karlsruhe GmbH

Zentralblatt MATH master server is maintained by the Editorial Office in Berlin, Section Mathematics and Computer Science of FIZ Karlsruhe and is updated daily.

Other Mirror Sites



Copyright © 2013 Zentralblatt MATH | European Mathematical Society | FIZ Karlsruhe | Heidelberg Academy of Sciences
Published by Springer-Verlag | Webmaster