检索结果-南通市图书馆

Optimal value functions of generalized semi-infinite min-max programming on a noncompact set

在线全文

学校读者我要写书评

暂无评论

Science china Mathematics 2005年第2期48卷 261-276页

作者： wang {1., YANG Xiaoqi & YANG Xinmin institute oi operations research, qufu normal university, qufu 2.3.65, china Department of Applied Mathematics, Dalian university of Technology, Dalian 1.6024, china Department of Applied Mathematics, The Hong Kong Polytechnic university, Hong Kong, china Department of Mathematics, Chongqing normal university, Chongqing 400047, china 1. institute of {1. research Qufu Normal University 273165 Qufu China 2. Department of Applied Mathematics Dalian University of Technology 116024 Dalian China 3. Department of Applied Mathematics The Hong Kong Polytechnic University Hong Kong China 4. Department of Mathematics Chongqing Normal University 400047 Chongqing China

In this paper, we study optimal value functions of generalized semi-infinite min-max programming problems on a noncompact set. Directional derivatives and subdifferential characterizations of optimal value functions are given. Using these properties,we establish first order optimality conditions for unconstrained generalized semi-infinite programming problems.

关键词： optimal value function, directional derivative, subdifferential, semi-infinite programming, first order optimality condition.

AN ALGORITHM FOR CONTINUOUS TYPE OPTIMAL SPHERICAL FACILITY LOCATION PROBLEM

在线全文

学校读者我要写书评

暂无评论

Systems Science and Mathematical Sciences 1999年第3期12卷 210-215页

作者： zhang Liping(institute of Applied Mathematics, Academia Sinica, Beijing 100080, china)wang changyu(institute of operations research, qufu normal university, qufu 2.3.65, china) 中科院应用数学所北京 100080 曲阜师范大学运筹学所山东曲阜 273165

In this paper, we study the continuously spherical facility location problem.(P) min f(X) = We prove a hull property and optimality condition of the problem (P), and propose analgorithm to solve (P). Global convergenc... 详细信息

关键词： Continuously spherical facility location convergent algorithm hull property optimal condition

A MAXIMUM ENTROPY METHOD FOR CONSTRAINED SEMI-INFINITE PROGRAMMING PROBLEMS

在线全文

学校读者我要写书评

暂无评论

Systems Science and Mathematical Sciences 1999年第3期12卷 204-209页

作者： ZHOU Guanglu wang {1. SHI Zhenjun(institute of operations research, qufu normal university, qufu 2.3.65, china)SUN Qingying(Department of Mathematics and Physics, university of Petroleum,Dongying, Shandong 257062, china) 曲阜师范大学运筹学所山东曲阜 273165 曲阜师范大学运筹学所山东曲阜石油大学（东营）数理系山东东营 257062

This paper presents a new method, called the maximum entropy method,for solving semi-infinite programming problems, in which the semi-infinite programmingproblem is approximated by one with a single constraint. The convergence properties forthis method are discussed. Numerical examples are given to show the high effciency of thealgorithm.

关键词： Maximum entropy method algorithm convergence semi-infinite programming

ON-LINE PREEMPTIVE SCHEDULING ON UNIFORM MACHINES

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2001年第4期14卷 373-377页

作者： zhang yuzhong (institute of operations research, qufu normal university, qufu 2.3.65, china) wang Shouyang (institute of Systems Science, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, china) Bo Chen (Warwick Busi 曲阜师范大学山东曲阜 273165 中科院系统科学所北京 100080 university of Warwick 英国 CV4 7AL 镇江水运学院江苏镇江 212003

We address the problem of preemptively schedule on-line jobs on arbitrary m uniformly related machines with the objective of minimizing the schedule length. We provide the first on-line algorithm for this general problem, and show that the algorithm has a competitive ratio of 1.± σ, where a (m - 1.s1.(si +…+ sm), S1.S2 Sm being the speeds of the m machines.

关键词： On-line scheduling uniformly related machines preemption competitive ratio.

A Generalized Fletcher-Reeves Method with Global Convergence Property

在线全文

学校读者我要写书评

暂无评论

A Generalized Fletcher-Reeves Method with Global Convergence...

中国运筹学会第六届学术交流会

作者： wang Chajigyu {1. Liping institute of operations research. qufu normal university, qufu Shandong 2.3.65

Conjugate gradient methods depend on the search directions, with different methods arising from different choices for the scalar β. The conjugate gradient mehtods using β are the well-known Fletcher-Reeves methods. Numerical experiences show that the FR method with the Wolfe line search and the Armijo line search often produces an ascent search direction. In this case, we search along its opposite direction-d. Thus we obtain the dependent generalized FR method, abbreviated to the DGFR method. This paper presents conditions which the ratio of β to β satisfying, which ensure the global convergence of the DGFR method with the Wolfe line search and the generalized Armijo line search. Besides, to a great extent, the conditions weaken the assumption in general literatures that the gradient is Lipschitz continuous.

关键词： the DGFR method Steplength Armijo line search Wolfe line search Global convergence

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

分批排序的“转换引理”及其应用

系统科学与数学 2002年第3期22卷 328-333页

作者：张玉忠王忠志王长钰曲阜师范大学运筹学研究所曲阜273165

本文首次对同类机分批排序问题进行了研究,讨论极小化最大完工时间和极小化最大延迟两类问题.首先揭示了分批排序问题与经典排序问题之间的联系,得到了有趣的“转换引理”,提出了近似算法并用“转换引理”分析了这些算法的最差性能,改... 详细信息

本文首次对同类机分批排序问题进行了研究,讨论极小化最大完工时间和极小化最大延迟两类问题.首先揭示了分批排序问题与经典排序问题之间的联系,得到了有趣的“转换引理”,提出了近似算法并用“转换引理”分析了这些算法的最差性能,改进了前人的诸多结果.

关键词：转换引理排序同类机 LPT算法 LS算法装箱分批排序

GLOBAL CONVERGENCE OF A CLASS OF SMOOTH PENALTY METHODS FOR SEMI-INFINITE PROGRAMMING

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2011年第4期24卷 769-783页

作者： changyu {1. Haiyan zhang Fang LIU institute of {1. research Qufu Normal University Qufu 273165 China. The First Middle School of Juancheng Heze 274000 China.

For the semi-infinite programming （SIP） problem, the authors first convert it into an equivalent nonlinear programming problem with only one inequality constraint by using an integral function, and then propose a smooth penalty method based on a class of smooth functions. The main feature of this method is that the global solution of the penalty function is not necessarily solved at each iteration, and under mild assumptions, the method is always feasible and efficient when the evaluation of the integral function is not very expensive. The global convergence property is obtained in the absence of any constraint qualifications, that is, any accumulation point of the sequence generated by the algorithm is the solution of the SIP. Moreover, the authors show a perturbation theorem of the method and obtain several interesting results. Furthermore, the authors show that all iterative points remain feasible after a finite number of iterations under the Mangasarian-Fromovitz constraint qualification. Finally, numerical results are given.

关键词： Global convergence semi-infinite programming smooth penalty function perturbation function.

The GECAM Real-time Burst Alert System

在线全文

学校读者我要写书评

暂无评论

research in Astronomy and Astrophysics 2024年第10期24卷 36-47页

作者： Yue Huang Dongli Shi Xiaolu zhang Xiang Ma Peng zhang Shijie Zheng Liming Song Xiaoyun Zhao Wei Chen Rui Qiao Xinying Song Jin wang Ce Cai Shuo Xiao Yanqiu zhang Shaolin Xiong Key Laboratory of Particle Astrophysics Institute of High Energy PhysicsChinese Academy of SciencesBeijing 100049China Southwest Jiaotong university Chengdu 611756China qufu {1. university Qufu 273165China College of Electronic and Information Engineering Tongji UniversityShanghai 201804China College of Physics and Hebei Key Laboratory of Photophysics research and Application Hebei Normal UniversityShijiazhuang 050024China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal UniversityGuiyang 550001China university of Chinese Academy of Sciences Chinese Academy of SciencesBeijing 100049China

Gravitational wave high-energy Electromagnetic Counterpart All-sky Monitor(GECAM),consisting of two microsatellites,is designed to detect gamma-ray bursts associated with gravitational-wave ***,we introduce the real-time burst alert system of GECAM,with the adoption of the BeiDou-3 short message communication *** present the post-trigger operations,the detailed ground-based analysis,and the performance of the *** the first year of the in-flight operation,GECAM was triggered by 42 gamma-ray *** GECAM real-time burst alert system has the ability to distribute the alert within~1.minute after being triggered,which enables timely follow-up observations.

关键词： (stars:)gamma-ray burst:general gravitational waves methods:data analysis

GLOBAL CONVERGENCE OF THE DAI-YUAN CONJUGATE GRADIENT METHOD WITH PERTURBATIONS

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2007年第3期20卷 416-428页

作者： changyu {1. Meixia LI institute of {1. research Qufu Normal University Qufu 273165 China. Department of Mathematics Weifang University Weifang 261061 China.

In this paper, the authors propose a class of Dai-Yuan （abbr. DY） conjugate gradient methods with linesearch in the presence of perturbations on general function and uniformly convex function respectively. Their iterate formula is xk＋1.= xk ＋ αk（sk ＋ ωk）, where the main direction sk is obtained by DY conjugate gradient method, ωk is perturbation term, and stepsize αk is determined by linesearch which does not tend to zero in the limit necessarily. The authors prove the global convergence of these methods under mild conditions. Preliminary computational experience is also reported.

关键词： Conjugate gradient method global convergence perturbation uniformly convex.