期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
参数非线性规划问题的L_1精确罚函数神经网络方法分析 被引量:2
1
作者 陈珊珊 楼旭阳 崔宝同 《计算机应用与软件》 CSCD 北大核心 2014年第7期277-279,315,共4页
针对约束条件中含有参数的非线性规划问题,提出一种基于L1精确罚函数神经网络的新型计算方法。该方法的罚因子为有限实数,并且取值小,便于硬件实现。在改进现有网络模型的基础上,利用最速下降原理构造了神经网络的动力学方程。给出所提... 针对约束条件中含有参数的非线性规划问题,提出一种基于L1精确罚函数神经网络的新型计算方法。该方法的罚因子为有限实数,并且取值小,便于硬件实现。在改进现有网络模型的基础上,利用最速下降原理构造了神经网络的动力学方程。给出所提神经网络模型在优化计算方面的具体应用步骤。最后,通过数值实例进行仿真验证,结果表明所提方法能够更加快速、精准地收敛于原规划问题的最优解。 展开更多
关键词 参数非线性规划 精确罚函数 神经网络
下载PDF
非线性参数规划问题ε-最优解集集值映射的连续性
2
作者 霍永亮 刘三阳 《系统科学与数学》 CSCD 北大核心 2009年第6期735-741,共7页
对非线性参数规划问题ε-最优解集集值映射的连续性条件进行了研究.首先在可行集集值映射局部有界且正则的条件下,讨论了非线性参数规划问题最优值函数的连续性,然后针对ε-最优解集集值映射的结构特征并利用此结果和集值分析理论,给出... 对非线性参数规划问题ε-最优解集集值映射的连续性条件进行了研究.首先在可行集集值映射局部有界且正则的条件下,讨论了非线性参数规划问题最优值函数的连续性,然后针对ε-最优解集集值映射的结构特征并利用此结果和集值分析理论,给出了非线性参数规划问题ε-最优解集集值映射连续的一个充分条件. 展开更多
关键词 非线性参数规划 最优值函数 ε-最优解集 正则条件 连续性
原文传递
NLP问题解的二阶条件和Lipschitz连续性
3
作者 余仲华 《北京理工大学学报》 EI CAS CSCD 1990年第S3期18-26,共9页
假定所讨论的数学规划问题其函数连续可微且有Lipschitz连续的梯度函数运用Clarke广义Jacobi矩阵,给出了非线性规划(NLP)问题解的二阶最优性必要条件二阶最优性充分条件及非线性参数规划问题解的Lipschitz连续性质,推广了王金德Fiacco... 假定所讨论的数学规划问题其函数连续可微且有Lipschitz连续的梯度函数运用Clarke广义Jacobi矩阵,给出了非线性规划(NLP)问题解的二阶最优性必要条件二阶最优性充分条件及非线性参数规划问题解的Lipschitz连续性质,推广了王金德Fiacco的主要结果。 展开更多
关键词 非线性规划/LipschitZ连续函数 Clarke广义Jacobi矩阵 非线性参数规划 严格局部最优解 孤立局部最优解 二阶最优性条件
下载PDF
One-parameter quasi-filled function algorithm for nonlinear integer programming 被引量:2
4
作者 尚有林 韩伯顺 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2005年第4期305-310,共6页
A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. Th... A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. The properties of the pro- posed quasi-filled function and the method using this quasi-filled function to solve nonlinear integer programming problem are also discussed in this paper. Numerical results indicated the efficiency and reliability of the proposed quasi-filled function algo- rithm. 展开更多
关键词 Integer programming Local minimizer Global minimizer Filled function Global optimization
下载PDF
A One-parameter Filled Function Method for Nonlinear Integer Programming 被引量:2
5
作者 尚有林 杨永建 梁玉梅 《Journal of Donghua University(English Edition)》 EI CAS 2005年第4期1-4,共4页
This paper gives a new definition of the filled function for nonlinear integer programming problem. A filled function satisfying our definition is presented. This function contains only one parameter. The properties o... This paper gives a new definition of the filled function for nonlinear integer programming problem. A filled function satisfying our definition is presented. This function contains only one parameter. The properties of the proposed filled function and the method using this filled function to solve nonlinear integer programming problem are also discussed. Numerical results indicate the efficiency and reliability of the proposed filled function algorithm. 展开更多
关键词 integer programming local minimizer global minimizer filled function global optimization
下载PDF
Robust flutter analysis based on genetic algorithm 被引量:2
6
作者 GU YingSong ZHANG XinPing YANG ZhiChun 《Science China(Technological Sciences)》 SCIE EI CAS 2012年第9期2474-2481,共8页
Robust flutter analysis considering model uncertain parameters is very important in theory and engineering applications.Modern robust flutter solution based on structured singular value subject to real parametric unce... Robust flutter analysis considering model uncertain parameters is very important in theory and engineering applications.Modern robust flutter solution based on structured singular value subject to real parametric uncertainties may become difficult because the discontinuity and increasing complexity in real mu analysis.It is crucial to solve the worst-case flutter speed accurately and efficiently for real parametric uncertainties.In this paper,robust flutter analysis is formulated as a nonlinear programming problem.With proper nonlinear programming technique and classical flutter analysis method,the worst-case parametric perturbations and the robust flutter solution will be captured by optimization approach.In the derived nonlinear programming problem,the parametric uncertainties are taken as design variables bounded with perturbed intervals,while the flutter speed is selected as the objective function.This model is optimized by the genetic algorithm with promising global optimum performance.The present approach avoids calculating purely real mu and makes robust flutter analysis a plain job.It is illustrated by a special test case that the robust flutter results coincide well with the exhaustive method.It is also demonstrated that the present method can solve the match-point robust flutter solution under constant Mach number accurately and efficiently.This method is implemented in problem with more uncertain parameters and asymmetric perturbation interval. 展开更多
关键词 FLUTTER genetic algorithm robust flutter analysis match-point solution nonmatch-point solution
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部