期刊文献+

解可分离结构变分不等式的一种新的交替方向法 被引量:6

A new alternating direction method for solving separable variational inequality problems
原文传递
导出
摘要 交替方向法是求解可分离结构变分不等式问题的经典方法之一,它将一个大型的变分不等式问题分解成若干个小规模的变分不等式问题进行迭代求解.但每步迭代过程中求解的子问题仍然摆脱不了求解变分不等式子问题的瓶颈.从数值计算上来说,求解一个变分不等式并不是一件容易的事情.因此,本文提出一种新的交替方向法,每步迭代只需要求解一个变分不等式子问题和一个强单调的非线性方程组子问题.相对变分不等式问题而言,我们更容易、且有更多的有效算法求解一个非线性方程组问题.在与经典的交替方向法相同的假设条件下,我们证明了新算法的全局收敛性.进一步的数值试验也验证了新算法的有效性. The alternating direction methods are attractive for solving separable variational inequality problems,which solve the original large-scale problems via solving a series of small-scale problems.However,the twosubproblems solved per iteration are still variational inequality problems,which are structurally as difficult tosolve as the original problems.In this paper,we propose a new alternating direction method,which,per iteration,solves a variational inequality problem and a system of nonlinear equations.The nonlinear equation is well-conditioned and many efficient methods,such as Newton-type methods,can be adopted directly to solve it.Moreover,from numerical point of view,nonlinear equations are much easier to solve than variational inequalityproblems in many cases.Under the same mild assumptions as those in classical alternating direction methods,we prove global convergence of the new method.We also present some preliminary numerical results,which showthat our method is efficient.
出处 《中国科学:数学》 CSCD 北大核心 2012年第2期133-149,共17页 Scientia Sinica:Mathematica
基金 国家自然科学基金(批准号:11171159 11071122)资助项目
关键词 变分不等式 交替方向法 全局收敛性 非线性方程组 variational inequality problems alternating direction methods global convergence nonlinearequations
  • 相关文献

参考文献38

  • 1Bertsekas D P, Gafni E M. Projection method for variational inequalities with applications to the traffic assignment problem. Math Programming Study, 1987, 17:139-159.
  • 2Dafermos S. Traffic equilibrium and variational inequalities. Transport Sci, 1980, 14:42-54.
  • 3Fukushima M. Application of the alternating directions method of multipliers to separable convex programming prob- lems. Comput Optim Appl, 1992 2:93-111.
  • 4何炳生.一类广义线性变分不等式的求解与应用[J].中国科学(A辑),1995,25(9):939-945. 被引量:11
  • 5Nagurney A. Network Economics, A Variational Inequality Approach. Dordrect: Kluwer Academics Publishers, 1993.
  • 6Nagurney A, Ramanujam P. Transportation network policy modeling with goal targets and generalized penalty functions. Transport Sci, 1996, 30:3-13.
  • 7Nagurney A, Thore S, Pan J. Spatial market policy modeling with goal targets. Oper Res, 1996, 44:393-406.
  • 8Chen G, Teboulle M. A proximal-based decomposition method for convex minimization problems. Math Program, 1994, 64:81-101.
  • 9Eckstein J, Bertsekas D P. On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math Program, 1992, 55:293-318.
  • 10Eckstein J, Fukushima M. Some reformulation and applications of the alternating directions method of multipliers. In: Hager W W, Hearn D W, Pardalos P M, eds. Large Scale Optimization: State of the Art. Dordrect: Kluwer Academic Publishers, 1994, 115-134.

二级参考文献9

  • 1Bingsheng He. A new method for a class of linear variational inequalities[J] 1994,Mathematical Programming(1-3):137~144
  • 2Bingsheng He. A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming[J] 1992,Applied Mathematics & Optimization(3):247~262
  • 3Patrick T. Harker,Jong-Shi Pang. Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications[J] 1990,Mathematical Programming(1-3):161~220
  • 4R. T. Rockafellar. Computational schemes for large-scale problems in extended linear-quadratic programming[J] 1990,Mathematical Programming(1-3):447~474
  • 5Jong-Shi Pang. Asymmetric variational inequality problems over product sets: Applications and iterative methods[J] 1985,Mathematical Programming(2):206~219
  • 6N. Karmarkar. A new polynomial-time algorithm for linear programming[J] 1984,Combinatorica(4):373~395
  • 7Stella Dafermos. An iterative scheme for variational inequalities[J] 1983,Mathematical Programming(1):40~47
  • 8J. S. Pang,D. Chan. Iterative methods for variational and complementarity problems[J] 1982,Mathematical Programming(1):284~313
  • 9B. C. Eaves. On the basic theorem of complementarity[J] 1971,Mathematical Programming(1):68~75

共引文献10

同被引文献25

引证文献6

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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