期刊文献+

一类最大特征值函数优化问题的UV-分解方法

UV-decomposition method for a class of maximum eigenvalue optimizations
下载PDF
导出
摘要 研究一类最大特征值函数与一个仿射映射复合后的函数与一个二次连续可微的凸函数的和的无约束优化问题,许多的实际应用问题的约束优化问题可以转化为这种形式的无约束问题来求解。将处理非光滑问题的UV-分解方法应用于这一类无约束优化问题,先给出目标函数在某一点处的3种形式的UV-空间分解,证明了3种空间分解形式是等价的。其次,给出目标函数的U-Lagrange函数及它的一阶和二阶展开式。最后,基于UV-空间分解理论给出解决这样一类无约束优化问题的UV-分解算法,并证明此算法是超线性收敛的。文章结论为解决最大特征值函数的联合函数的优化问题提供了一种新的途径。 This paper is concerned with the unconstrained problem in which the object function is the sum of the composite function of the maximum eigenvalue function and an affine mapping and a finite-valued convex twice continuously differentiable function. The actual application problem of the constrained optimization problem can be solved by transforming it into this kind of unconstrained problem. We will apply UV-spaee theory which can solve nonsmooth optimization problem to the unconstrained problem. Firstly, three kinds of UV-space decomposition of the object function and the proof of the equivalency about the three kinds of UV-space decomposition were introduced. Moreover, the U- Lagrangian of the object function and its first order and second order expansions were shown later. Finally, an UV- decomposition algorithm with superlinear convergence is presented which is based on the UV-space decomposition theory. The conclusions in this paper provide a new method to solve the optimization problem of a class of maximum eigenvalue function.
出处 《沈阳师范大学学报(自然科学版)》 CAS 2015年第2期173-176,共4页 Journal of Shenyang Normal University:Natural Science Edition
基金 国家自然科学基金资助项目(11171138)
关键词 最大特征值函数 UV-空间分解 U-Lagrange函数 超线性收敛 maximum eigenvalue functions UV-space decomposition U-Lagrangian superlinear convergence
  • 相关文献

参考文献10

  • 1DIAAZ A R, KIKUCHI N. Solution to shape and topology eigenvalue optimization problems using a homogenizationmethod[J]. UNME, 2005,35(7):1487- 1502.
  • 2ZHAO Z, BRAAMS B Z, FUKUDA M. The reduced density matrix method for electronic structure caculations and the role of three-index representability conditions[J]. J Phys Chem, 2004,120(5) :2095 - 2104.
  • 3PUKELSHEIM F. Optimal design of experiments[M]. New York: John Wiley Sons, 1993:35 - 50.
  • 4VANDENBERGHE L E, WOLFE P. The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices[J]. Math Prog Study, 1975,3 : 35 - 55.
  • 5POLAK E, WARDI Y. A nondifferential optimization algorithm for the design of control systems subject to singular value inequalities over the frequency range[J]. Automatica, 1982,18:267- 283.
  • 6FLETCHER tL Semi-definite matrix constraints in optimization[J]. SIAM J Control Optim, 1985,23 : 493 - 513.
  • 7OUSTRY F. The U-Lagrangian of the maximum eigenvalue functions[J]. SIAM J Optim, 1999,9(2) :526 - 549.
  • 8CHEN X, QI L Q, QI H D. Smooth convex approximation to the maximum eigenvalue Iunetion[J]. J oI Global Optimization, 2004,3 :253 - 270.
  • 9王炜,高晶晶,张玲玲.近似非精确加速迫近梯度方法求解一类最大特征值函数极小化问题[J].辽宁师范大学学报(自然科学版),2013,36(3):314-317. 被引量:2
  • 10LEMARCHAL C, OUSTRY F, SAGASTIZABAL C. The U-Lagrangian of a convex function[J]. Trans AMS, 2000,352(2) :711 - 729.

二级参考文献4

  • 1JIANG Kaifeng, SUN Defeng. An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP[J]. SIAM J Optim, 2012,22(3) : 1042-1064.
  • 2CHEN Xin. Smooth convex approximation to the maximum eigenvalue function[J]. Journal of Global. Optimization, 2004,3 z 253-270.
  • 3NESTEROV Yurii. Smoothing technique and its applications in semide-nite optimization[J] Mathematical Programming, 2007, 110:245-259.
  • 4BECK Amir, TEBOULLE Marc. A fast iterative shrinkage-threshilding algorithm for linear in-verse problems[J]. SIAM J Ima- ging Sciences, 2009,2 : 183-202.

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部