CSpace

Browse/Search Results:  1-7 of 7 Help

Selected(0)Clear Items/Page:    Sort:
Eigenfunction behavior and adaptive finite element approximations of nonlinear eigenvalue problems in quantum physics 期刊论文
ESAIM-MATHEMATICAL MODELLING AND NUMERICAL ANALYSIS-MODELISATION MATHEMATIQUE ET ANALYSE NUMERIQUE, 2021, 卷号: 55, 期号: 1, 页码: 209-227
Authors:  Yang, Bin;  Zhou, Aihui
Favorite  |  View/Download:65/0  |  Submit date:2021/04/26
Adaptive finite element approximation  complexity  convergence  nonlinear eigenvalue problem  non-polynomial behavior  unique continuation property  
A ROBUST INTERIOR POINT METHOD FOR COMPUTING THE ANALYTIC CENTER OF AN ILL-CONDITIONED POLYTOPE WITH ERRORS 期刊论文
JOURNAL OF COMPUTATIONAL MATHEMATICS, 2019, 卷号: 37, 期号: 6, 页码: 843-865
Authors:  Wang, Zhouhong;  Dai, Yuhong;  Xu, Fengmin
Favorite  |  View/Download:82/0  |  Submit date:2020/05/24
Analytic center  Ill-conditioning  Unboundedness  Primal-dual interior point algorithm  Convergence  Polynomial complexity  
A new fully polynomial time approximation scheme for the interval subset sum problem 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2017, 卷号: 68, 期号: 4, 页码: 749-775
Authors:  Diao, Rui;  Liu, Ya-Feng;  Dai, Yu-Hong
Favorite  |  View/Download:55/0  |  Submit date:2018/07/30
Interval subset sum problem  Computational complexity  Solution structure  Fully polynomial time approximation scheme  Worst-case performance  
Risk Models for the Prize Collecting Steiner Tree Problems with Interval Data 期刊论文
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2014, 卷号: 30, 期号: 1, 页码: 1-26
Authors:  AlvarezMiranda Eduardo;  CandiaVejar Alfredo;  Chen Xujin;  Hu Xiaodong;  Li Bi
Favorite  |  View/Download:38/0  |  Submit date:2021/01/14
SERIES-PARALLEL GRAPHS  SHORTEST-PATH PROBLEM  COMPUTATIONAL-COMPLEXITY  NETWORK  OPTIMIZATION  CONSTRAINTS  ALGORITHMS  FLOWS  uncertainty modeling  prize collecting Steiner tree  interval data  series-parallel graphs  polynomial-time solvability  
Strict Optimal Rational Approximants of Multisequences 期刊论文
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 卷号: 56, 期号: 4, 页码: 1719-1728
Authors:  Wan, Zhe-Xian;  Zhou, Kai
Favorite  |  View/Download:45/0  |  Submit date:2018/07/30
Formal power series (FPS)  generating function  liner complexity  minimal polynomial  optimal rational approximant  
A predictor-corrector algorithm for linear optimization based on a specific self-regular proximity function 期刊论文
SIAM JOURNAL ON OPTIMIZATION, 2005, 卷号: 15, 期号: 4, 页码: 1105-1127
Authors:  Peng, JM;  Terlaky, T;  Zhao, YB
Favorite  |  View/Download:45/0  |  Submit date:2018/07/30
linear optimization  interior-point methods  predictor-corrector self-regular proximity function  large neighborhoods  polynomial complexity  superlinear convergence  
Two interior-point methods for nonlinear P-*(tau)-complementarity problems 期刊论文
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1999, 卷号: 102, 期号: 3, 页码: 659-679
Authors:  Zhao, YB;  Han, JY
Favorite  |  View/Download:55/0  |  Submit date:2018/07/30
interior-point algorithms  nonlinear P-*-complementarity problems  polynomial complexity  scaled Lipschitz condition