机构

• 数学与系统科学研究... [13]
• 长春光学精密机械与物... [2]

采集方式

• OAI收割 [15]

内容类型

• 期刊论文 [13]
• 会议论文 [2]

发表日期

• 2019 [1]
• 2013 [1]
• 2012 [1]
• 2011 [1]
• 2010 [1]
• 2009 [1]
• 更多

学科主题

筛选

浏览/检索结果: 共15条，第1-10条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序发表日期升序发表日期降序提交时间升序提交时间降序作者升序作者降序 An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization 期刊论文  OAI收割 COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2019, 页码: 23 作者:  Liu, Zexian;  Liu, Hongwei;  Dai, Yu-Hong   |  收藏  |  浏览/下载：11/0  |  提交时间：2020/05/24 Conjugate gradient algorithm  Limited memory  Quasi-Newton method  Preconditioned conjugate gradient algorithm  Global convergence   A Trust Region Algorithm for Solving Bilevel Programming Problems 期刊论文  OAI收割 ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2013, 卷号: 29, 期号: 3, 页码: 491-498 作者:  Liu Guoshan;  Xu Shiqin;  Han Jiye   |  收藏  |  浏览/下载：26/0  |  提交时间：2021/01/14 NONSMOOTH OPTIMIZATION  CONVERGENCE  Bilevel programming problem  trust region algorithm  global convergence  mathematical program with equilibrium constraints  stationary point   Image matching using a bat algorithm with mutation (EI CONFERENCE) 会议论文  OAI收割 2012 International Conference on Mechatronic Systems and Automation Systems, MSAS 2012, July 21, 2012 - July 21, 2012, Wuhan, China 作者:  Zhang J.;  Wang G.;  Zhang J.;  Zhang J. 收藏  |  浏览/下载：41/0  |  提交时间：2013/03/25 Due to shortcoming of traditional image matching for computing the fitness for every pixel in the searching space  a new bat algorithm with mutation (BAM) is proposed to solve image matching problem  and a modification is applied to mutate between bats during the process of the new solutions updating. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic BA. The realization procedure for this improved meta-heuristic approach BAM is also presented. To prove the performance of this proposed meta-heuristic method  BAM is compared with BA and other population-based optimization methods  DE and SGA. The experiment shows that the proposed approach is more effective and feasible in image matching than the other model. (2012) Trans Tech Publications  Switzerland.   Coordinated Beamforming for MISO Interference Channel: Complexity Analysis and Efficient Algorithms 期刊论文  OAI收割 IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2011, 卷号: 59, 期号: 3, 页码: 1142-1157 作者:  Liu, Ya-Feng;  Dai, Yu-Hong;  Luo, Zhi-Quan   |  收藏  |  浏览/下载：15/0  |  提交时间：2018/07/30 Complexity  coordinated beamforming  cyclic coordinate descent algorithm  global convergence  MISO interference channel   Energy-saving scheduling strategy for elevator group control system based on ant colony optimization (EI CONFERENCE) 会议论文  OAI收割 2010 IEEE Youth Conference on Information, Computing and Telecommunications, YC-ICT 2010, November 28, 2010 - November 30, 2010, Beijing, China 作者:  Zhang J.-L.;  Li J.-F. 收藏  |  浏览/下载：29/0  |  提交时间：2013/03/25 Elevator group control scheduling is to dispatch every elevator to serve call requests from different floors based on some certain goal. It's a kind of typical combinatorial optimization problems. Ant colony algorithm is good at solving the discrete combinatorial optimization  its well global optimization ability and quick convergence velocity are both necessary to a scheduling algorithm. Moreover  reducing passengers' waiting and traveling time is the main focus of current dispatching algorithms  neglecting the energy consumed by the elevator system. So it's necessary to research on energy-saving algorithms. For the purpose of elevator group's energy-conservation run  the objective function of energy is built  ant colony model for elevator group control system is created  its optimization mechanism is figured out  and convergence of the algorithm is studied in this paper. Simulation results show the effectiveness of the strategy. 2010 IEEE.   Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search 期刊论文  OAI收割 SCIENCE IN CHINA SERIES A-MATHEMATICS, 2009, 卷号: 52, 期号: 4, 页码: 833-848 作者:  Huang ZhengHai;  Hu ShengLong;  Han JiYe   |  收藏  |  浏览/下载：18/0  |  提交时间：2018/07/30 complementarity problem  symmetric cone  Euclidean Jordan algebra  smoothing algorithm  global convergence   Sequential penalty algorithm for nonlinear constrained optimization 期刊论文  OAI收割 JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2003, 卷号: 118, 期号: 3, 页码: 635-655 作者:  Zhang, JL;  Zhang, XS   |  收藏  |  浏览/下载：18/0  |  提交时间：2018/07/30 nonlinear optimization  SQP method  sequential penalty algorithm  global convergence  superlinear convergence   A note on the convergence of the DFP algorithm on quadratic uniformly convex functions 期刊论文  OAI收割 OPTIMIZATION, 2002, 卷号: 51, 期号: 2, 页码: 339-352 作者:  Liu, GH;  Han, JY;  Xu, DC   |  收藏  |  浏览/下载：14/0  |  提交时间：2018/07/30 global convergence  DFP algorithm  inexact line search   Merit function and global algorithm for box constrained variational inequalities 期刊论文  OAI收割 ACTA MATHEMATICA SCIENTIA, 2002, 卷号: 22, 期号: 1, 页码: 63-71 作者:  Zhang, LP;  Gao, ZY;  Lai, YL   |  收藏  |  浏览/下载：27/0  |  提交时间：2018/07/30 box constrained variational inequalities  the KKT-conditions problem  global convergence algorithm   A nonmonotone trust region method for nonlinear programming with simple bound constraints 期刊论文  OAI收割 APPLIED MATHEMATICS AND OPTIMIZATION, 2001, 卷号: 43, 期号: 1, 页码: 63-85 作者:  Chen, ZW;  Han, JY;  Xu, DC   |  收藏  |  浏览/下载：28/0  |  提交时间：2018/07/30 global convergence  nonmonotone  trust region algorithm  nonlinear programming  strict complementarity slackness condition