中文版 | English

在结果中检索

CSpace

浏览/检索结果: 共9条，第1-9条 帮助

限定条件        
已选(0)清除 条数/页：   排序方式：
Approximation of dense-n/2-subgraph and table compression problems 期刊论文
SCIENCE IN CHINA SERIES A-MATHEMATICS, 2005, 卷号: 48, 期号: 9, 页码: 1223-1233
作者:  Xu, DC;  Han, JY;  Du, DL
收藏  |  浏览/下载：88/0  |  提交时间：2018/07/30
dense-n/2-subgraph problem (DSP)  table compression problem (TCP)  SDP  approximation ratio  
Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds 期刊论文
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2004, 卷号: 122, 期号: 1, 页码: 185-206
作者:  Xu, DC;  Han, JY;  Chen, ZW
收藏  |  浏览/下载：102/0  |  提交时间：2018/07/30
trust-region methods  nonmonotone algorithms  global convergence  nonlinear equality constraints  substationary points  
Approximating the 2-catalog segmentation problem using semidefinite programming relaxations 期刊论文
OPTIMIZATION METHODS & SOFTWARE, 2003, 卷号: 18, 期号: 6, 页码: 705-719
作者:  Xu, DC;  Ye, YY;  Zhang, JW
收藏  |  浏览/下载：99/0  |  提交时间：2018/07/30
catalog segmentation problem  semidefinite programming  approximation algorithm  
Improved approximation algorithms for MAX n/2-DIRECTED-BISECTION and MAX n/2-DENSE-SUBGRAPH 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2003, 卷号: 27, 期号: 4, 页码: 399-410
作者:  Xu, DC;  Han, JY;  Huang, ZH;  Zhang, LP
收藏  |  浏览/下载：104/0  |  提交时间：2018/07/30
MAX n/2-DIRECTED-BISECTION  MAX n/2-DENSE-SUBGRAPH  polynomial-time approximation algorithm  semidefinite programming  
Approximation algorithm for Max-Bisection problem with the positive semidefinite relaxation 期刊论文
JOURNAL OF COMPUTATIONAL MATHEMATICS, 2003, 卷号: 21, 期号: 3, 页码: 357-366
作者:  Xu, DC;  Han, JY
收藏  |  浏览/下载：91/0  |  提交时间：2018/07/30
approximation algorithm  Max-Bisection problem  semidefinite programming  approximation ratio  
A note on the convergence of the DFP algorithm on quadratic uniformly convex functions 期刊论文
OPTIMIZATION, 2002, 卷号: 51, 期号: 2, 页码: 339-352
作者:  Liu, GH;  Han, JY;  Xu, DC
收藏  |  浏览/下载：112/0  |  提交时间：2018/07/30
global convergence  DFP algorithm  inexact line search  
The non-interior continuation methods for solving the P-0 function nonlinear complementarity problem 期刊论文
SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 2001, 卷号: 44, 期号: 9, 页码: 1107-1114
作者:  Huang, ZH;  Han, J;  Xu, DC;  Zhang, LP
收藏  |  浏览/下载：113/0  |  提交时间：2018/07/30
nonlinear complementarity problem  non-interior continuation method  P-0 function  boundedness of the iteration sequence  
Existence theorems of solution to variational inequality problems 期刊论文
SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 2001, 卷号: 44, 期号: 2, 页码: 212-219
作者:  Zhang, LP;  Han, JY;  Xu, DC
收藏  |  浏览/下载：77/0  |  提交时间：2018/07/30
exceptional family  variational inequality  complementarity problem  P-0-function  
A nonmonotone trust region method for nonlinear programming with simple bound constraints 期刊论文
APPLIED MATHEMATICS AND OPTIMIZATION, 2001, 卷号: 43, 期号: 1, 页码: 63-85
作者:  Chen, ZW;  Han, JY;  Xu, DC
收藏  |  浏览/下载：77/0  |  提交时间：2018/07/30
global convergence  nonmonotone  trust region algorithm  nonlinear programming  strict complementarity slackness condition