上海市浦江人才计划项目(06PJ14039)

作品数：5被引量：19H指数：2
导出分析报告
相关作者：白延琴滕开选王国强更多>>
相关机构：上海工程技术大学上海大学更多>>
相关期刊：《Acta Mathematica Sinica,English Series》更多>>
相关主题：UPDATESMALLLARGEIPMSPOLYNOMIAL更多>>
相关领域：理学更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-5
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Interior-point algorithm based on general kernel function for monotone linear complementarity problem
《Journal of Shanghai University(English Edition)》2009年第2期95-101,共7页刘勇 白延琴 
supported by the National Natural Science Foundation of China (Grant No.10771133);the Shanghai Pujiang Program (Grant No.06PJ14039)
A polynomial interior-point algorithm is presented for monotone linear complementarity problem （MLCP） based on a class of kernel functions with the general barrier term, which are called general kernel functions. Un...
关键词：monotone linear complementarity problem （MLCP） interior-point method kernel function polynomial complexity 
A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization被引量：1
《Journal of Shanghai University(English Edition)》2008年第6期475-480,共6页张敏 白延琴 王国强 
supported by the Shanghai Pujiang Program (Grant No.06PJ14039);the Science Foundation of Shanghai Municipal Commission of Education (Grant No.06NS031)
In this paper, a primal-dual path-following interior-point algorithm for linearly constrained convex optimization(LCCO) is presented.The algorithm is based on a new technique for finding a class of search directions a...
关键词：linearly constrained convex optimization （LCCO） interior-point algorithm small-update method polynomial complexity 
A new primal-dual interior-point algorithm for convex quadratic optimization被引量：9
《Journal of Shanghai University(English Edition)》2008年第3期189-196,共8页王国强 白延琴 刘勇 张敏 
the Foundation of Scientific Research for Selecting and Cultivating Young Excellent University Teachers in Shanghai (Grant No.06XPYQ52);the Shanghai Pujiang Program (Grant No.06PJ14039)
In this paper, a new primal-dual interior-point algorithm for convex quadratic optimization （CQO） based on a kernel function is presented. The proposed function has some properties that are easy for checking. These ...
关键词：convex quadratic optimization （CQO） interior-point methods （IPMs） large-update method polynomial complexity 
Primal-dual Interior-point Algorithms for Second-order Cone Optimization Based on a New Parametric Kernel Function被引量：9
《Acta Mathematica Sinica,English Series》2007年第11期2027-2042,共16页Yan Qin BAI Guo Qiang WANG 
Project sponsored by Shanghai Pujiang Program(Grant No.06PJ14039);Shanghai Educational Committee Foundation(Grant No.06NS031)
A class of polynomial primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function, with parameters p and q, is presented. Its growth term is between linear and qu...
关键词：second-order cone optimization linear optimization interior-point methods large- and small-update methods polynomial-time complexity 
一个解半正定规划问题的基于广义对数障碍函数的原始对偶内点算法
《应用数学与计算数学学报》2007年第2期62-72,共11页滕开选 白延琴 王国强 
上海市浦江人才计划(06PJ14039)资助
本文对经典对数障碍函数推广,给出了一个广义对数障碍函数.基于这个广义对数障碍函数设计了解半正定规划问题的原始-对偶内点算法.分析了该算法的复杂性,得到了一个理论迭代界,它与已有的基于经典对数障碍函数的算法的理论迭代界一致.同...
关键词：半正定规划 原始-对偶内点算法 大步校正方法和小步校正方法 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部