期刊文献+
共找到161篇文章
< 1 2 9 >
每页显示 20 50 100
On vector variational-like inequalities and vector optimization problems with (G, α)-invexity 被引量:1
1
作者 JAYSWAL Anurag CHOUDHURY Sarita 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2017年第3期323-338,共16页
The aim of this paper is to study the relationship among Minty vector variational-like inequality problem, Stampacchia vector variational-like inequality problem and vector optimization problem involving (G, α)-invex... The aim of this paper is to study the relationship among Minty vector variational-like inequality problem, Stampacchia vector variational-like inequality problem and vector optimization problem involving (G, α)-invex functions. Furthermore, we establish equivalence among the solutions of weak formulations of Minty vector variational-like inequality problem, Stampacchia vector variational-like inequality problem and weak efficient solution of vector optimization problem under the assumption of (G, α)-invex functions. Examples are provided to elucidate our results. 展开更多
关键词 Minty vector variational-like inequality problem Stampacchia vector variational-like inequality problem vector optimization problem (G α)-invexity vector critical point
在线阅读 下载PDF
Systems of generalized vector quasi-variational inclusions and systems of generalized vector quasi-optimization problems in locally FC-uniform spaces
2
作者 丁协平 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2009年第3期263-274,共12页
In this paper, we introduce some new systems of generalized vector quasi-variational inclusion problems and system of generalized vector ideal (resp., proper, Pareto, weak) quasi-optimization problems in locally FC-... In this paper, we introduce some new systems of generalized vector quasi-variational inclusion problems and system of generalized vector ideal (resp., proper, Pareto, weak) quasi-optimization problems in locally FC-uniform spaces without convexity structure. By using the KKM type theorem and Himmelberg type fixed point theorem proposed by the author, some new existence theorems of solutions for the systems of generalized vector quasi-variational inclusion problems are proved. As to its applications, we obtain some existence results of solutions for systems of generalized vector quasi-optimization problems. 展开更多
关键词 KKM type theorem Himmelberg type fixed point theorem system of generalized vector quasi-variational inclusions system of generalized vector optimization problems locally FC-uniform space
在线阅读 下载PDF
On the Well-Posedness for Optimization Problems: A Theoretical Investigation 被引量:1
3
作者 Rosa Ferrentino Carmine Boniello 《Applied Mathematics》 2019年第1期19-38,共20页
In this paper, some theoretical notions of well-posedness and of well-posedness in the generalized sense for scalar optimization problems are presented and some important results are analysed. Similar notions of well-... In this paper, some theoretical notions of well-posedness and of well-posedness in the generalized sense for scalar optimization problems are presented and some important results are analysed. Similar notions of well-posedness, respectively for a vector optimization problem and for a variational inequality of differential type, are discussed subsequently and, among the various vector well-posedness notions known in the literature, the attention is focused on the concept of pointwise well-posedness. Moreover, after a review of well-posedness properties, the study is further extended to a scalarizing procedure that preserves well-posedness of the notions listed, namely to a result, obtained with a special scalarizing function, which links the notion of pontwise well-posedness to the well-posedness of a suitable scalar variational inequality of differential type. 展开更多
关键词 WELL-POSEDNESS HADAMARD and Tykhonov WELL-POSEDNESS vector optimization problems SCALARIZATION FUNCTION
在线阅读 下载PDF
A Note on the Guignard Constraint Qualification and the Guignard Regularity Condition in Vector Optimization
4
作者 Giorgio Giorgi 《Applied Mathematics》 2013年第4期734-740,共7页
Some remarks are made on the use of the Abadie constraint qualification, the Guignard constraint qualifications and the Guignard regularity condition in obtaining weak and strong Kuhn-Tucker type optimality conditions... Some remarks are made on the use of the Abadie constraint qualification, the Guignard constraint qualifications and the Guignard regularity condition in obtaining weak and strong Kuhn-Tucker type optimality conditions in differentiable vector optimization problems. 展开更多
关键词 Constraint QUALIFICATIONS REGULARITY CONDITIONS optimALITY CONDITIONS vector optimization problems
在线阅读 下载PDF
Mathematical Apparatus for Selection of Optimal Parameters of Technical, Technological Systems and Materials Based on Vector Optimization
5
作者 Yu Mashunin 《American Journal of Operations Research》 2020年第5期173-239,共67页
We presented Mathematical apparatus of the choice of optimum parameters of technical, technological systems and materials on the basis of vector optimization. We have considered the formulation and solution of three t... We presented Mathematical apparatus of the choice of optimum parameters of technical, technological systems and materials on the basis of vector optimization. We have considered the formulation and solution of three types of tasks presented below. First, the problem of selecting the optimal parameters of technical systems depending on the functional characteristics of the system. Secondly, the problem of selecting the optimal parameters of the process depending on the technological characteristics of the process. Third, the problem of choosing the optimal structure of the material depending on the functional characteristics of this material. The statement of all problems is made in the form of vector problems of mathematical (nonlinear) programming. The theory and the principle of optimality of the solution of vector tasks it is explained in work of https://rdcu.be/bhZ8i. The implementation of the methodology is shown on a numerical example of the choice of optimum parameters of the technical, technological systems and materials. On the basis of mathematical methods of solution of vector problems we developed the software in the MATLAB system. The numerical example includes: input data (requirement specification) for modeling;transformation of mathematical models with uncertainty to the model under certainty;acceptance of an optimal solution with equivalent criteria (the solution of numerical model);acceptance of an optimal solution with the given priority of criterion. 展开更多
关键词 vector optimization Methods of Solution of vector problems Modeling of a Technical System Modeling Operation of Technological Processes Modeling of Structure of Material
在线阅读 下载PDF
Semicontinuity of the Minimal Solution Set Mappings for Parametric Set-Valued Vector Optimization Problems 被引量:1
6
作者 Xin Xu Yang-Dong Xu Yue-Ming 《Journal of the Operations Research Society of China》 EI CSCD 2021年第2期441-454,共14页
With the help of a level mapping,this paper mainly investigates the semicontinuity of minimal solution set mappings for set-valued vector optimization problems.First,we introduce a kind of level mapping which generali... With the help of a level mapping,this paper mainly investigates the semicontinuity of minimal solution set mappings for set-valued vector optimization problems.First,we introduce a kind of level mapping which generalizes one given in Han and Gong(Optimization 65:1337–1347,2016).Then,we give a sufficient condition for the upper semicontinuity and the lower semicontinuity of the level mapping.Finally,in terms of the semicontinuity of the level mapping,we establish the upper semicontinuity and the lower semicontinuity of the minimal solution set mapping to parametric setvalued vector optimization problems under the C-Hausdorff continuity instead of the continuity in the sense of Berge. 展开更多
关键词 Set-valued vector optimization problems Level mapping Solution set mapping Upper semicontinuity Lower semicontinuity
原文传递
Continuity for vector optimization problems with equilibrium constraints
7
作者 WU Yunan 《Science China Mathematics》 SCIE 2004年第1期65-71,共7页
The concept of vector optimization problems with equilibrium constraints (VOPEC) is introduced. By using the continuity results of the approximate solution set to the equilibrium problem, we obtain the same results of... The concept of vector optimization problems with equilibrium constraints (VOPEC) is introduced. By using the continuity results of the approximate solution set to the equilibrium problem, we obtain the same results of the marginal map and the approximate value in VOPEC (ε) for vector-valued mapping. 展开更多
关键词 vector optimization problems with EQUILIBRIUM constraints LOWER semicontinuity UPPER semicontinuity.
原文传递
基于多目标优化遗传算法的Schnorr-Adleman整数分解算法
8
作者 栾鸾 顾纯祥 郑永辉 《信息工程大学学报》 2025年第2期217-223,共7页
Schnorr-Adleman整数分解算法将经典整数分解算法中搜索“分解关系对”这一环节转化为素数格上近似最近向量问题的求解,但近似最近向量问题求解的时间复杂度较高。为更高效地在素数格上搜索分解关系对,设计一种多目标优化遗传算法,用于... Schnorr-Adleman整数分解算法将经典整数分解算法中搜索“分解关系对”这一环节转化为素数格上近似最近向量问题的求解,但近似最近向量问题求解的时间复杂度较高。为更高效地在素数格上搜索分解关系对,设计一种多目标优化遗传算法,用于替代Schnorr-Adleman算法中的近似最短向量问题求解算法。该遗传算法同时考虑格向量与目标向量的距离以及格向量的平滑性指标两个适应度函数,并使用快速非支配排序算法和拥挤度函数对格向量的优先级进行排序。实验结果表明,改进后的算法在60、80比特的整数分解实例上的搜索效率均高于经典的Schnorr-Adleman整数分解算法,说明该算法在提高整数分解效率方面具有一定的优势。 展开更多
关键词 整数分解 最近向量问题 多目标优化 快速非支配排序
在线阅读 下载PDF
图神经网络引导的演化算法求解约束多目标优化问题
9
作者 张毅芹 韩宗宸 +1 位作者 孙靖 赵春亮 《聊城大学学报(自然科学版)》 2025年第1期135-146,共12页
约束多目标优化问题由于其约束复杂性、可行域不规则性和可行解稀疏性,通常存在难以精准刻画约束关系,以及难以找到收敛性好且分布均匀的帕累托非支配解等问题。为此,本文提出了一种图神经网络引导的约束多目标演化算法,该算法包括了学... 约束多目标优化问题由于其约束复杂性、可行域不规则性和可行解稀疏性,通常存在难以精准刻画约束关系,以及难以找到收敛性好且分布均匀的帕累托非支配解等问题。为此,本文提出了一种图神经网络引导的约束多目标演化算法,该算法包括了学习模块与权向量自适应策略,其中学习模块通过训练图神经网络对解集进行快速评估,权向量自适应策略通过判别准则和更新机制增强种群多样性。实验结果表明,该算法在多个基准测试问题上显著优于现有的五个先进算法,在复杂约束多目标优化问题上表现出色。 展开更多
关键词 图神经网络 约束多目标优化问题 约束多目标演化算法 权向量更新
在线阅读 下载PDF
New approach to training support vector machine 被引量:10
10
作者 Tang Faming Chen Mianyun Wang Zhongdong 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2006年第1期200-205,219,共7页
Support vector machine has become an increasingly popular tool for machine learning tasks involving classification, regression or novelty detection. Training a support vector machine requires the solution of a very la... Support vector machine has become an increasingly popular tool for machine learning tasks involving classification, regression or novelty detection. Training a support vector machine requires the solution of a very large quadratic programming problem. Traditional optimization methods cannot be directly applied due to memory restrictions. Up to now, several approaches exist for circumventing the above shortcomings and work well. Another learning algorithm, particle swarm optimization, for training SVM is introduted. The method is tested on UCI datasets. 展开更多
关键词 support vector machine quadratic programming problem particle swarm optimization.
在线阅读 下载PDF
An Exact l_(1) Exponential Penalty Function Method for Multiobjective Optimization Problems with Exponential-Type Invexity
11
作者 Anurag Jayswal Sarita Choudhury 《Journal of the Operations Research Society of China》 EI 2014年第1期75-91,共17页
The purpose of this paper is to devise exact l_(1) exponential penalty function method to solve multiobjective optimization problems with exponentialtype invexity.The conditions governing the equivalence of the(weak)... The purpose of this paper is to devise exact l_(1) exponential penalty function method to solve multiobjective optimization problems with exponentialtype invexity.The conditions governing the equivalence of the(weak)efficient solutions to the vector optimization problem and the(weak)efficient solutions to associated unconstrained exponential penalized multiobjective optimization problem are studied.Examples are given to illustrate the obtained results. 展开更多
关键词 Exact l_(1)exponential penalty method Exponential penalized vector optimization problems (p r)-invexity
原文传递
Necessary Optimality Conditions for a Class of Nonsmooth Vector Optimization 被引量:1
12
作者 Hui-xian Wu He-zhi Luo 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2009年第1期87-94,共8页
The Kuhn-Tucker type necessary conditions of weak efficiency are given for the problem of mini- mizing a vector function whose each component is the sum of a differentiable function and a convex function, subjcct to a... The Kuhn-Tucker type necessary conditions of weak efficiency are given for the problem of mini- mizing a vector function whose each component is the sum of a differentiable function and a convex function, subjcct to a set of differentiable nonlinear inequalities on a convex subset C of R^n, under the conditions similar to the Abadie constraint qualification, or the Kuhn-Tucker constraint qualification, or the Arrow-Hurwicz-Uzawa constraint qualification. 展开更多
关键词 vector optimization problems necessary conditions weak efficiency constraint qualifications
原文传递
Lower Semicontinuity of the Effcient Solution Mapping in Semi-In?nite Vector Optimization 被引量:1
13
作者 GONG Xunhua 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2015年第6期1312-1325,共14页
This paper establishes some suffcient conditions for the lower semicontinuity of the effcient solution mapping for the semi-infinite vector optimization problem with perturbations of both the objective function and th... This paper establishes some suffcient conditions for the lower semicontinuity of the effcient solution mapping for the semi-infinite vector optimization problem with perturbations of both the objective function and the constraint set in normed linear spaces. The constraint set is the set of weakly effcient solutions of vector equilibrium problem, and perturbed by the perturbation of the criterion mapping to the vector equilibrium problem. 展开更多
关键词 Effcient solution mapping lower semicontinuity semi-infinite vector optimization vector equilibrium problem
原文传递
ROLE OF α-PSEUDO-UNIVEX FUNCTIONS IN VECTOR VARIATIONAL-LIKE INEQUALITY PROBLEMS 被引量:1
14
作者 S. K. MISHRA Shouyang WANG K. K. LAI 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2007年第3期344-349,共6页
In this paper, we introduce a new class of generalized convex function, namely, a-pseudounivex function, by combining the concepts of pseudo-univex and α-invex functions. Further, we establish some relationships betw... In this paper, we introduce a new class of generalized convex function, namely, a-pseudounivex function, by combining the concepts of pseudo-univex and α-invex functions. Further, we establish some relationships between vector variational-like inequality problems and vector optimization problems under the assumptions of α-pseudo-univex functions. Results obtained in this paper present a refinement and improvement of previously known results. 展开更多
关键词 α-pseudo-univex functions vector optimization vector variational-like inequality problems.
原文传递
基于最小二乘支持向量回归的上边界模型构建
15
作者 刘小雍 曾成斌 +2 位作者 刘赟 何国锋 闫庚龙 《华南理工大学学报(自然科学版)》 CSCD 北大核心 2024年第12期139-150,共12页
目前,基于数据驱动的传统非线性系统建模方法主要着眼于模型拟合和应用,鉴于此,该文针对来自系统的某个重要参数受不确定性影响的最大容忍极限输出,构建基于最小二乘支持向量回归(LSSVR)的上边界模型,深入剖析了上边界模型的精度与稀疏... 目前,基于数据驱动的传统非线性系统建模方法主要着眼于模型拟合和应用,鉴于此,该文针对来自系统的某个重要参数受不确定性影响的最大容忍极限输出,构建基于最小二乘支持向量回归(LSSVR)的上边界模型,深入剖析了上边界模型的精度与稀疏特性之间的平衡关系对上边界模型输出的影响。首先,借助LSSVR的优化问题,将原等式线性约束变成满足上边界模型的不等式约束;接着,为提高模型精度,引入基于上边界模型预测输出与实际输出之间逼近误差的不等式约束;与此同时,借助LSSVR的权值二范数来控制上边界模型结构的复杂度,从而构建出新的目标函数,并与满足上边界模型的不等式约束建立新的优化问题;最后,对所建立的优化问题引入拉格朗日函数并借助Karush-Kuhn-Tucker最优化条件来获取相应的对偶优化问题,并将其转化为标准的二次规划问题来求解上边界模型的参数。由于所构造的新优化问题满足凸性,因此模型系数解是全局最优的。该文还通过实验分析了反映模型精度的最大逼近误差、均方根误差及反映模型稀疏特性的指标,论证了所提方法的有效性和优越性。 展开更多
关键词 上边界模型 对偶优化问题 全局最优解 最小二乘支持向量回归 二次规划
在线阅读 下载PDF
移动网络隐私信息库未知访问源安全性预警
16
作者 曹敬馨 刘洲洲 《吉林大学学报(信息科学版)》 CAS 2024年第4期733-739,共7页
针对互联网信息安全预警过程中,受信息数据规模大、种类多影响,导致预警精度低、耗时长的问题,为提高预警效率,提出移动网络隐私信息库未知访问源安全性预警。利用主成分分析法对信息库数据进行降维处理,降低检测难度;利用迭代多元自回... 针对互联网信息安全预警过程中,受信息数据规模大、种类多影响,导致预警精度低、耗时长的问题,为提高预警效率,提出移动网络隐私信息库未知访问源安全性预警。利用主成分分析法对信息库数据进行降维处理,降低检测难度;利用迭代多元自回归预测(IMAP:Iterative Multivariate AutoRegressive Modelling and Prediction)算法进行数据聚类处理,提取离散性孤立数据点,完成信息库未知访问源数据筛查。将未知访问源数据输入到支持向量机中,利用时间窗口将信息库安全预警模型的构建问题转化为支持向量机学习的凸优化问题,输出安全性预警结果,并对预警模型的构建参数进行全局寻优,提高安全预警模型的预警输出能力。实验结果表明,所提方法对信息库的安全检测效率较高,且面对多类型信息库入侵攻击能做到稳定、精准预警输出。 展开更多
关键词 主成分分析法 IMAP 聚类法 时间窗口 支持向量机学习法 凸优化问题
在线阅读 下载PDF
一种多约束稀布线阵的天线综合方法 被引量:15
17
作者 贾维敏 林志强 +2 位作者 姚敏立 赵鹏 赵建勋 《电子学报》 EI CAS CSCD 北大核心 2013年第5期926-930,共5页
针对有阵元间距上、下限约束与口径约束的稀布直线阵列综合问题,提出了一种基于向量映射的改进遗传算法.该方法将遗传变量与阵元间距按照特定的关系进行映射,从而使阵元间距的强约束优化问题转换为仅含遗传变量上、下限约束的优化问题,... 针对有阵元间距上、下限约束与口径约束的稀布直线阵列综合问题,提出了一种基于向量映射的改进遗传算法.该方法将遗传变量与阵元间距按照特定的关系进行映射,从而使阵元间距的强约束优化问题转换为仅含遗传变量上、下限约束的优化问题,从根本上避免了遗传操作中的不可行解.通过抑制天线峰值旁瓣电平(PSLL)的稀布阵仿真,验证了该方法的有效性和稳健性,且能获得比现有方法更高的优化效率. 展开更多
关键词 稀布阵 遗传算法(GA) 旁瓣电平 优化布阵 约束优化问题 向量映射
在线阅读 下载PDF
向量优化问题有效点集的稳定性 被引量:7
18
作者 赵勇 彭再云 张石生 《应用数学和力学》 CSCD 北大核心 2013年第6期643-650,共8页
在不需要紧性假设下,利用拟C-凸函数及回收锥的性质,建立了向量优化问题有效点集的稳定性,获得了一列目标函数和可行集均扰动情形下的向量优化问题与对应的向量优化问题有效点集的Painlevé-Kuratowski内收敛性结果。所得结果推广... 在不需要紧性假设下,利用拟C-凸函数及回收锥的性质,建立了向量优化问题有效点集的稳定性,获得了一列目标函数和可行集均扰动情形下的向量优化问题与对应的向量优化问题有效点集的Painlevé-Kuratowski内收敛性结果。所得结果推广和改进了相关文献(Attouch H,RiahiH.Stability results for Ekeland’s-variational principle and cone extremal solution;Huang X X.Stabilityin vector-valued and set-valued optimization)中的相应结果,并给出例子说明了所得结果的正确性。 展开更多
关键词 向量优化问题 Painlevé-Kuratowski收敛性 稳定性
在线阅读 下载PDF
多目标约束向量优化问题的类拉格朗日乘数法 被引量:3
19
作者 李润鑫 黄辉 +3 位作者 尚振宏 曹宇 王红斌 张晶 《数学物理学报(A辑)》 CSCD 北大核心 2018年第6期1076-1094,共19页
文献[21]给出了实希尔伯特空间中含有一个约束条件的向量优化问题的有关帕雷托解的拉格朗日乘数法.该文把文献[21]中的主要结果推广到了含有任意m个约束条件的多目标向量优化问题中,给出了实希尔伯特空间中,以proximal法锥和目标函数的c... 文献[21]给出了实希尔伯特空间中含有一个约束条件的向量优化问题的有关帕雷托解的拉格朗日乘数法.该文把文献[21]中的主要结果推广到了含有任意m个约束条件的多目标向量优化问题中,给出了实希尔伯特空间中,以proximal法锥和目标函数的coderivative刻画的多目标约束向量优化问题的类拉格朗日乘数法. 展开更多
关键词 向量优化 Proximal法锥 CODERIVATIVE 弱ε帕雷托解 多目标约束向量优化问题
在线阅读 下载PDF
基于局部化原理和概率模型的LVQ改进算法 被引量:6
20
作者 叶少珍 吴鸣锐 +2 位作者 张钹 郑文波 马少平 《计算机学报》 EI CSCD 北大核心 2003年第5期626-629,共4页
利用局部化原理和概率模型的优化方法 ,提出一种LVQ改进算法———基于局部化原理和概率模型的LVQ算法 (LocalizationprincipleandProbabilitybasedLVQ ,LoPLVQ) .与传统LVQ算法相比 ,不仅缩短训练时间 ,而且具有较高的识别率 .实验结... 利用局部化原理和概率模型的优化方法 ,提出一种LVQ改进算法———基于局部化原理和概率模型的LVQ算法 (LocalizationprincipleandProbabilitybasedLVQ ,LoPLVQ) .与传统LVQ算法相比 ,不仅缩短训练时间 ,而且具有较高的识别率 .实验结果表明改进算法可用来解决大规模的模式识别问题 . 展开更多
关键词 模式识别 局部化原理 概率模型 LVQ改进算法 学习矢量量化算法 计算机
在线阅读 下载PDF
上一页 1 2 9 下一页 到第
使用帮助 返回顶部