数学杂志2012，Vol.32Issue(3)：535-539,5.
基于并行计算的多方向强次可行模松弛SQP算法
STRONGLY SUB-FEASIBLE NORM-RELAXED SQP ALGORITHM OF MULTIPLE DIRECTIONS WITH PARALLEL COMPUTING
摘要
Abstract
In this paper, we aim to solve nonlinear constrained optimization. By making use parallel multiple directions method, a new strongly sub-feasible norm-relaxed sequential quadratic programming (SQP) algorithm is proposed, and numerical results show that the number of iterations and the computational time are obviously less than the traditional algorithm with single parameter.关键词
并行计算/多方向/强次可行/模松弛/序列二次规划Key words
parallel computing/ multiple directions/ strongly sub-feasible/ norm-relaxed/ sequential quadratic programming分类
数理科学引用本文复制引用
唐春明,简金宝,郑海艳..基于并行计算的多方向强次可行模松弛SQP算法[J].数学杂志,2012,32(3):535-539,5.基金项目
国家自然科学基金(71061002) （71061002）
数学天元基金(11126341) （11126341）
广西自然科学基金(2010GXNSFB013047). （2010GXNSFB013047）
