期刊文献+

非线性约束优化问题的一个修正Lagrangian算法 被引量:1

A Modified Lagrangian Algorithm for Solving Nonlinear Constrained Optimization Problems
下载PDF
导出
摘要 基于一个含有控制参数的修正Lagrangian函数,该文建立了一个求解非线性约束优化问题的修正Lagrangian算法.在一些适当的条件下,证明了控制参数存在一个阀值,当控制参数小于这一阀值时,由这一算法产生的序列解局部收敛于问题的Kuhn-Tucker点,并且建立了解的误差上界.最后给出一些约束优化问题的数值结果. A modified Lagrangian algorithm for solving nonlinear constrained optimization problems is established, which is based on a modified Lagrange function with a controlling parameter. Under suitable conditions, the local convergence of the modified Lagrangian algorithm is proved and the error bounds of solutions are established, which shows that there exists a threshold of the parameter such that, when the parameter is less than this threshold, the sequence of points generated by the algorithm converges to a Kuhn-Tucker point locally. Numerical results by using the modified Lagrangian algorithm for solving some simple constrained optimization problems are illustrated.
出处 《数学物理学报(A辑)》 CSCD 北大核心 2006年第1期49-62,共14页 Acta Mathematica Scientia
基金 国家青年自然科学基金(10001007) 武汉理工大学博士科研基金资助
关键词 修正Lagrangian算法 非线性约束优化问题 局部收敛 误差界 Modified Lagrangian algorithm Nonlinear constrained optimization problems Local convergence Error bound.
  • 相关文献

参考文献17

  • 1Arrow K,Hurwicz L,Dzava H.Studies in Linear and Nonlinear Programming.Stanford:Stanford University Press,1958.
  • 2Bertsekas D P.Constrained Optimization and Lagrange Multiplier Methods.New York:Academic Press,1982.
  • 3Charalambous C.Nonlinear least p-th optimization and nonlinear programming.Math Programming,1977,12:195-225.
  • 4Charalambous C.Acceleration of the least p-th algorithm for minimax optimization with engineering applications.Math Programming,1979,19:270-297.
  • 5El Bakry A S,Tapia R A,Tsuchiya T,Zhang Y.On the formulation and theory of the Newton interior-point method for nonlinear programming.JOTA,1996,89:507-541.
  • 6Fiacco A V,McCormick G P.Nonlinear programming sequential unconstrained minimization techniques.New York:John Wiley and Sons,1968.
  • 7Gay D M,Overton M L,Wright M H.A primal-dual interior method for nonconvex nonlinear programming.In:Ya-xiang Yuan,ed.Advances in Nonlinear programming.1998.31-56.
  • 8Hertog D D,Roos C,Terlaky T.On the classical logarithmic barrier function method for a class of smooth convex programming problems.JOTA,1992,73(1):1-25.
  • 9Nocedal J,Wright S J.Numerical Optimization.New York:Springer-Verlag,1999.
  • 10Polyak R A.Smooth optimization methods for minimax problems.SIAM J Control and Optimization,1988,26:1274-1286.

同被引文献6

  • 1Wujek B A,Renaud J E. New adaptive move-limit management strategy for approximate optimization,Parts 1 and 2[ J]. AIAA 1998,36 : 1911-1934.
  • 2Laraberti L,Pappalettere C. Comparison of the numerical efficiency of different sequential linear programming based algorithms for structural optimization problems[J]. Comput Struct, 2000,76:713-728.
  • 3Lamberti L,Pappalettere C. Move limits definition in structural optimization with sequential linear programming. Part Ⅰ : Optimization algorithm[J]. Comput Struct, 2003,81 : 197-213.
  • 4Lamberti L, Pappalettere C. Move limits definition in structural optimization with sequential linear programming. Part Ⅱ: Numerical examples[J]. Comput Struct, 2003,81:215-238.
  • 5程耿东 汪榴.形状优化数值方法与白适应运动极限.计算结构力学及其应用,1985,2(2):75-102.
  • 6隋允康,张轩,宇慧平.近似评价函数确定运动极限及其在形状优化中的应用[J].计算力学学报,2007,24(4):447-452. 被引量:3

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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