期刊文献+

正则Lipschitz规划的一阶最优性条件和最弱约束规格

First-Order Optimality Conditions and Weakest Constraint Qualifications for Regular Lipschitz Programming Problems
全文增补中
导出
摘要 讨论了正则的Lipschitz规划的一阶最优性条件,其主要研究工具是局部Lipschitz函数的广义梯度.给出了无等式约束的正则Lipschitz规划的一阶约束规格,并且证明了这种约束规格是最弱的。 Gives a discussion on the first-order optimality conditions for regular Lipschitz programming problems. The main tool applied in this study is the concept of generalized gradient of locally Lipschitz function.First-order constraint qualifications are given which are weakest for a point to be a local minimizer for regular Lipschitz programming problems without equality constraints.
作者 胡林
出处 《北京理工大学学报》 EI CAS CSCD 1993年第2期230-238,共9页 Transactions of Beijing Institute of Technology
关键词 正则化 最优性条件 李普希兹规划 non-linear programming regularization/Lipschitz programming generalized gradient optimality condition constraint qualification
  • 相关文献

参考文献3

  • 1V. Hien Nguyen,J. -J. Strodiot,R. Mifflin. On conditions to have bounded multipliers in locally lipschitz programming[J] 1980,Mathematical Programming(1):100~106
  • 2Henry Wolkowicz. Geometry of optimality conditions and constraint qualifications: The convex case[J] 1980,Mathematical Programming(1):32~60
  • 3J. B. Hiriart-Urruty. On optimality conditions in nondifferentiable programming[J] 1978,Mathematical Programming(1):73~86

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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