中文版 | English

在结果中检索

CSpace

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

已选(0)清除 条数/页：   排序方式：
A proximal DC approach for quadratic assignment problem 期刊论文
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2021, 页码: 27
作者:  Jiang, Zhuoxuan;  Zhao, Xinyuan;  Ding, Chao
收藏  |  浏览/下载：140/0  |  提交时间：2021/04/26
Quadratic assignment problem  Doubly nonnegative programming  Augmented Lagrangian method  Rank constraint  
Distributed optimisation approach to least-squares solution of Sylvester equations 期刊论文
IET CONTROL THEORY AND APPLICATIONS, 2020, 卷号: 14, 期号: 18, 页码: 2968-2976
作者:  Deng, Wen;  Zeng, Xianlin;  Hong, Yiguang
收藏  |  浏览/下载：146/0  |  提交时间：2021/01/14
least squares approximations  distributed control  stability  distributed algorithms  continuous time systems  matrix algebra  convex programming  multi-robot systems  convex optimisation  distributed optimisation approach  least-squares solution  Sylvester equations  distributed algorithms  multiagent network  problem setup  interconnected system  local information  data matrices  neighbour agents  continuous-time algorithms  optimisation problem  
A GLOBALLY CONVERGENT PRIMAL-DUAL INTERIOR-POINT RELAXATION METHOD FOR NONLINEAR PROGRAMS 期刊论文
MATHEMATICS OF COMPUTATION, 2020, 卷号: 89, 期号: 323, 页码: 1301-1329
作者:  Liu, Xin-Wei;  Dai, Yu-Hong
收藏  |  浏览/下载：155/0  |  提交时间：2020/09/23
Nonlinear programming  constrained optimization  interior-point method  logarithmic barrier problem  global convergence  
On the complexity of sequentially lifting cover inequalities for the knapsack polytope 期刊论文
SCIENCE CHINA-MATHEMATICS, 2020, 页码: 10
作者:  Chen, Wei-Kun;  Dai, Yu-Hong
收藏  |  浏览/下载：125/0  |  提交时间：2020/05/24
integer programming  sequentially lifted cover inequality  complexity  lifting problem  
Distributed optimisation design for solving the Stein equation with constraints 期刊论文
IET CONTROL THEORY AND APPLICATIONS, 2019, 卷号: 13, 期号: 15, 页码: 2492-2499
作者:  Chen, Guanpu;  Zeng, Xianlin;  Hong, Yiguang
收藏  |  浏览/下载：150/0  |  提交时间：2020/05/24
least squares approximations  gradient methods  convergence  matrix algebra  concave programming  multi-agent systems  distributed optimisation design  Stein equations  set constraints  rows  columns  coefficient matrices  equivalent distributed optimisation problem  projection-based algorithm  least-squares solution  constrained Stein equation  multiagent system network  simplified distributed algorithm  
On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints 期刊论文
LINEAR ALGEBRA AND ITS APPLICATIONS, 2017, 卷号: 516, 页码: 264-285
作者:  Bai, Zhong-Zhi;  Tao, Min
收藏  |  浏览/下载：114/0  |  提交时间：2018/07/30
Equality-constraint quadratic  programming problem  Iteration method  Successive relaxation  
Local optimization-based statistical inference 期刊论文
ELECTRONIC JOURNAL OF STATISTICS, 2017, 卷号: 11, 期号: 1, 页码: 2295-2320
作者:  Xiong, Shifeng
收藏  |  浏览/下载：123/0  |  提交时间：2018/07/30
Bootstrap  importance sampling  non-regular problem  resampling  space-filling design  stochastic programming  
Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints 期刊论文
BIT NUMERICAL MATHEMATICS, 2016, 卷号: 56, 期号: 2, 页码: 399-422
作者:  Bai, Zhong-Zhi;  Tao, Min
收藏  |  浏览/下载：98/0  |  提交时间：2018/07/30
Equality-constraint quadratic programming problem  Solvability  Iteration method  Preconditioning  Asymptotic convergence  
A Trust Region Algorithm for Solving Bilevel Programming Problems 期刊论文
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2013, 卷号: 29, 期号: 3, 页码: 491-498
作者:  Liu Guoshan;  Xu Shiqin;  Han Jiye
收藏  |  浏览/下载：109/0  |  提交时间：2021/01/14
NONSMOOTH OPTIMIZATION  CONVERGENCE  Bilevel programming problem  trust region algorithm  global convergence  mathematical program with equilibrium constraints  stationary point  
Componentwise error bounds for linear complementarity problems 期刊论文
IMA JOURNAL OF NUMERICAL ANALYSIS, 2011, 卷号: 31, 期号: 1, 页码: 348-357
作者:  Wang, Zhengyu;  Yuan, Ya-Xiang
收藏  |  浏览/下载：106/0  |  提交时间：2018/07/30
error bound  linear complementarity problem  convex quadratic programming