理学 >>> 数学 >>> 运筹学 >>> 线性规划 非线性规划 动态规划 组合最优化 参数规划 整数规划 随机规划 排队论 对策论 库存论 决策论 搜索论 图论 统筹论 最优化 运筹学其他学科
搜索结果: 1-13 共查到运筹学 Algorithm相关记录13条 . 查询时间(0.066 秒)
In this talk, a distributed stochastic gradient (SG) algorithm is proposed where the estimators are aimed to collectively estimate an unknown time-invariant parameter from a set of noisy measurements ...
Unlike traditional robust optimization, personalized optimization aims to find the values of control variables that yield the optimal value of the objective function for given values of environmental ...
This talk concerns the nonsmooth distributed optimization problem via multi-agent network with the coupled equality and inequality constraints. The considered global optimization problem is to minimiz...
We present a new algorithm for the global solution of optimization problems involving bilinear matrix inequalities (BMIs). The method is based on a technique known in large-scale and global optimizati...
We use a rank one Gaussian perturbation to derive a smooth stochastic approximation of the maximum eigenvalue function. We then combine this smoothing result with an optimal smooth stochastic optimiza...
Abstract: Lipschitz one-dimensional constrained global optimization (GO) problems where both the objective function and constraints can be multiextremal and non-differentiable are considered in this p...
Abstract: We introduce a new framework for the convergence analysis of a class of distributed constrained non-convex optimization algorithms in multi-agent systems. The aim is to search for local mini...
Abstract: This paper deals with maximum entropy completion of partially specified block-circulant matrices. Since positive definite symmetric circulants happen to be covariance matrices of stationary ...
Abstract: In this paper is proposed a new heuristic approach belonging to the field of evolutionary Estimation of Distribution Algorithms (EDAs). EDAs builds a probability model and a set of solutions...
Abstract: We propose a primal-dual splitting algorithm for solving monotone inclusions involving a mixture of sums, linear compositions, and parallel sums of set-valued and Lipschitzian operators. An ...
We extend the Blahut-Arimoto algorithm for maximizing Massey’s directed information. The algorithm can be used for estimating the capacity of channels with delayed feedback, where the feedback is a de...
We present a numerical method to solve the optimal transport problem with a quadratic cost when the source and target measures are periodic probability densities. This method relies on a numerical res...
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition,a geometric constraint problem can be reduced into basic merge pa...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...