Professional Documents
Culture Documents
(1985) On The Relationship Between Fenchel and Lagrange Duality For Optimization Problems in General Spaces
(1985) On The Relationship Between Fenchel and Lagrange Duality For Optimization Problems in General Spaces
(1985) On The Relationship Between Fenchel and Lagrange Duality For Optimization Problems in General Spaces
To cite this article: S. Dietze & M. Schäuble (1985) On the relationship between fenchel and Lagrange duality for
optimization problems in general spaces, Optimization: A Journal of Mathematical Programming and Operations Research,
16:1, 7-14
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained
in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no
representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of
the Content. Any opinions and views expressed in this publication are the opinions and views of the authors,
and are not the views of or endorsed by Taylor & Francis. The accuracy of the Content should not be relied
upon and should be independently verified with primary sources of information. Taylor and Francis shall not be
liable for any losses, actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities
whatsoever or howsoever caused arising directly or indirectly in connection with, in relation to or arising out of
the use of the Content.
This article may be used for research, teaching, and private study purposes. Any substantial or systematic
reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any
form to anyone is expressly forbidden. Terms & Conditions of access and use can be found at http://
www.tandfonline.com/page/terms-and-conditions
Optimization 16 (1985) 1: 7-14
Summary: I n this paper, the t?quivalenct: betweel: a FE?;CHEL and LAGRANGE duality
:heorem for optimization problems in d w l pairs of real 7-ector spaces is prox-ed in a
tiireet way.
Downloaded by [UZH Hauptbibliothek / Zentralbibliothek Zürich] at 19:41 10 July 2014
FENCHEL and LAGRAKGE duality theorems belong to the duality theorems most
frequently appiied in convex optimization. For deducin-g a duality statement to
a given optimizatior, problem, the question is interesting whether a duality
statement derived from the FENCHEL theory can be also derived from the
LAGRA.NGE theory and vice versa.
For finite dimensional optimization problems; there exist several papers which
-"
investigate the relationship between a FESCHEL
A A d b ,
f
, - - -
, '
_Li.--i.-F-.N
and L A G R ~ Gduality
- -r
A N.I.I
E
7 - -1- -
theorem.
7 : - 1 L : +, ,,
,
,
,
-- ;%j. n e s.ilruws rur-ec_:c!v L I J O t x ? u ~ v a l a ~ ~~ ~G rWGGU
L?
The authors are grateful t o one of the referees for drawing their attention to the book [5].
8 Optimization 16 (1983) 1
duality Theorems 1 and 2 of the FENCHEL respectirely LAGRS,TGE type for opti-
m i z a t i o n ~roblems in dual pairs of real vector spaces.
The Theorems I and 2 are very general and only partly com_narahl~with the
related theoren= in [ 5 ] Fnrther. notiw that rhe Theorems 1 a r x j 2 are iymmetrical
duality statements (the dual of the dual problem is equivalent t o the primal
tile
probiem). This s y i i i ~ e t qis connected nith semicoiitiniiit~assiiiiipiivils f o ~
primal problem which influences the equivalence proof. The proof for [Theorem
f?=+TE,enrem I? in Inrincipie is re!ated t: the carreapon&- 0 =roofs
I
iin [4] 2nd c.53
I n contrast to this. the proof of [Theorem i+Theorem 21 is a generalization of the
ahove-mentioned proof in [ 2 ] . JJTefailed in the attempt to transfer ~~L~GNASTZ'S
corresponding proof since we were not able t o verify the semicontinuity assump-
tions necessary for this proof,
Furthermore, let us mention that the proofs f o r the equivdence of the duality
Downloaded by [UZH Hauptbibliothek / Zentralbibliothek Zürich] at 19:41 10 July 2014
stability are not considered. The n ~ t s t i o nused in the present paper is ana!ogci.;s
t c ! t h s t of [I!. We use the standard termindngy and severs! statements of cr,:?-
vex analysis. For this, we generally refer to e.g. [I], [3]. Let us remark that, if
we have a dual pair ( V , V*)of real vector spaces, topological concepts, e.g. on
T7, always refer to some fixec! loca!!y convex topology on V cornpatib!e with the
duality between V and V*.
The authors would like to thank Dr. sc. W. SCHIROTZEK, Technische Universitat
Dresden, for helpful discussions.
Let ( V , V*), (Y, Y * ) be two dual pairs of real vector spaces with respect t o the
bilinear functions (.,.jV, (.,.),, and let A be a continuous linear operator defined
on V with values in Y , i.e., AEL(V, Y ) . Further let F : V--(--, +-I,
G/ : Y - ( - -, + -1 be lower semicontinuous convex functions with P(v)f + co,
G(dz.)i. +- for a t least one ' ~ l f P- As usaal, we denote the a d j o i ~ toperator of
A by A* and the conjugate function of P and G by P* and G*, respectively.
We consider the primal problem
and
hpD: V* -Ri.hFD(v*) inf
=
Y* 6 P*
[G* ( - g *) + F* (A*l*g*
j-c * ) ] (4)
Theorem 1: Let the a.ssztmptions given i n this section be julJilled. Then one has :
a; ( 1 ) i s stabiec[hFp(0) = -hFa:O)c E l , problew ( 2 ) is solvabbj.
b ) ( 2 ) i-5 stablea[hpp(0)= - hFD(OjE R1,problem (1) i~sol'~.'ablej.
Downloaded by [UZH Hauptbibliothek / Zentralbibliothek Zürich] at 19:41 10 July 2014
and
-
hLD: V* Rl,hLD(v*)= inf sup [(v*, v), - J ( v ) (y*, B(vj)rl
-g*EC* vcd
+ (8)
( 2 ) is s t a b i e o ( l 0 ) is stable. ji4)
Downloaded by [UZH Hauptbibliothek / Zentralbibliothek Zürich] at 19:41 10 July 2014
Further it is easy to see that the assumptions of Section 3 imply the assumptions
of Section 2 for the relevant spaces and functions connected with (15). For in-
stance, the function F is lower semicontinuous because Jf is closed and hence
xX is 10%-ersemicontinuous, the function (2-, yl-+ J ( z ) is Lower serniconti~nous,
and the sum of lower semicontinuous functions is also lower semicontinuous.
The procf for the fact that -71 is cicsed ca:: be f o t l d la [ I ] : Charter
r 111,Lemma 5 . 1 .
For the dual problem (2) to (1.5), we need the conjugate functions P* and G*
of (" and Q -from (1 5 ) T.Ve have
Downloaded by [UZH Hauptbibliothek / Zentralbibliothek Zürich] at 19:41 10 July 2014
is equivalent to
h,, : VX Y -- 81,
hFP(5,%) = inf
(v,tI)E V X Y
[ J ( v )+ xx(v, y) + xc ( y - g ) ]
=inf { J ( v )j V E A -, 9 - B ( v ) E C , y - ~ E C ) .
As for fixed i j Y~ and v E A [(there is a y E Y with -y - B(v)E C and y -g E C ).c>
o( -8 - R(v)E C)], we obtain
References
[I] EEELAND,I.; TEMAM, R.: Convex analysis and variational problems. Xorth-Holland
Publishing Company, Amsterdam, Oxford, American Elsevier Publishing Company,
Inc., New York 1976.
[2] ELSTER,K.-H.; REINHARDT,R. ; SCHLOBLE,M.; DONATH,G.: Einfiihrung in die
nichtlineare Optimierung. Mathematisch-Naturwissenschaftliche Bibliothek, Band 63.
Teubner, Leipzig 19 77.
[3] LAURENT, P . J . : Approximation et optimisation. Hermann, Paris 1972.
[41 MAGNANTI, T. L.: FENCHELand LAGRANGE duality are equivalent. Mathematical
Programming, 7 (1974), 253-258.
[ 5 ] PONSTEIN, J. : Approaches to the theory of optimization. Cambridge University Press,
Cambridge, London, New York, New Rochelle, Melbourne, Sidney 1980.
[G] PONSTEIN, J. : Comments on the general duality survey by J, TINDand L. A. WOLSEY.
LMathematical Programming, 25 (1983), 240- 244.
['i] ROCKABELLAR, R . T. : Conjugate duality and optimization. Regional conference series
in applied mathematics, 16. SI.451, Philadelphia, Penn.
14 Optimization i6 (i985j i
[8] SCHACBLE,A i . ; WLRTH,G.: Zur Aquivalenz zentraler SBtze der konvexen Analysis I
and II. Wiss. Zei~schrifrder P H Haiie, S T X ji980j, 10-i2, and XX ji9S2j, 3- 5 .
[9] TUY,H.: Convex inequalities and the HBEX- BASACH theorem Dissertationes Math.
X C ~ I I ,T V ~ E Z ~ . . V ~$97 2 .