Convexity Conditions and the Legendre-Fenchel Transform for the Product of Finitely Many Positive Definite Quadratic Forms

被引:0
作者
Yun-Bin Zhao
机构
[1] University of Birmingham,School of Mathematics
来源
Applied Mathematics & Optimization | 2010年 / 62卷
关键词
Matrix analysis; Convex analysis; Legendre-Fenchel transform; Quadratic forms; Positive definite matrices; Condition numbers;
D O I
暂无
中图分类号
学科分类号
摘要
While the product of finitely many convex functions has been investigated in the field of global optimization, some fundamental issues such as the convexity condition and the Legendre-Fenchel transform for the product function remain unresolved. Focusing on quadratic forms, this paper is aimed at addressing the question: When is the product of finitely many positive definite quadratic forms convex, and what is the Legendre-Fenchel transform for it? First, we show that the convexity of the product is determined intrinsically by the condition number of so-called ‘scaled matrices’ associated with quadratic forms involved. The main result claims that if the condition number of these scaled matrices are bounded above by an explicit constant (which depends only on the number of quadratic forms involved), then the product function is convex. Second, we prove that the Legendre-Fenchel transform for the product of positive definite quadratic forms can be expressed, and the computation of the transform amounts to finding the solution to a system of equations (or equally, finding a Brouwer’s fixed point of a mapping) with a special structure. Thus, a broader question than the open “Question 11” in Hiriart-Urruty (SIAM Rev. 49, 225–273, 2007) is addressed in this paper.
引用
收藏
页码:411 / 434
页数:23
相关论文
共 37 条
[1]  
Averbakh I.(2007)Explicit reformulations of robust optimization problems with general uncertainty sets SIAM J. Optim. 18 1436-1466
[2]  
Zhao Y.B.(1999)An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming J. Glob. Optim. 15 315-342
[3]  
Benson H.P.(1997)Multiplicative programming problems: analysis and efficient point search heuristic J. Optim. Theory Appl. 94 487-510
[4]  
Benson H.P.(1996)Fast Legendre-Fenchel transform and applications to Hamilton-Jacobi equations and conservation laws SIAM J. Numer. Anal. 33 1534-1558
[5]  
Boger G.M.(1977)A relationship between the second derivatives of a convex function and of its conjugate Math. Program. 13 364-365
[6]  
Corrias L.(1979)The expectation of products of quadratic forms in normal variables Stat. Neerl. 33 73-79
[7]  
Crouzeix J.P.(1996)Recurrence formula for expectations of products of quadratic forms Stat. Probab. Lett. 27 101-109
[8]  
Don F.J.H.(2007)Potpourri of conjectures and open questions in nonlinear analysis and optimization SIAM Rev. 49 255-273
[9]  
Ghazal G.A.(2003)New formulas for the Legendre-Fenchel transform J. Math. Anal. Appl. 288 544-555
[10]  
Hiriart-Urruty J.B.(1996)Expectations of products of quadratic forms in normal variables Stoch. Anal. Appl. 14 149-164