理学 >>> 数学 >>> 运筹学 >>> 最优化 >>>
搜索结果: 1-15 共查到最优化 optimization相关记录21条 . 查询时间(0.151 秒)
In this talk, we discuss a unifying deep unfolding multi-sampling-ratio interpretable CS-MRI framework. The combined approach offers more generalizability than the existing deep-learning-based CS-MRI ...
We focus on the nonconvex-strongly-convex bilevel optimization problem (BLO). In this BLO, the objective function of the upper-level problem is nonconvex and possibly nonsmooth, and the lower-level pr...
Tensor-based modeling and computation emerge prominently with urgent demands from practical applications in the big data era. With the intrinsic sparsity in real data sets and the dimensionality reduc...
Sparsity is a naturally occurring characteristic in many real-world applications including signal denoising, outlier detection, and finance. On one hand, sparsity assumption allows people to tackle in...
Zero-One Composite Optimization (0/1-COP) is a prototype of nonsmooth, non- convex optimization problems and it has attracted much attention recently. Augmented Lagrangian Method (ALM) has stood out a...
Nonconvex constrained optimization (NCO) has been one of the important research fields in optimization community. It has widely appeared in many application fields. However, challenges for solving NCO...
In electronic structure calculations, Kohn-Sham equations rank among the most widely adopted mathematical models. However, due to the deficiency of available approximations for exchange-correlation en...
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...
The problem of finding a vector with the fewest nonzero elements that satisfies an underdetermined system of linear equations is an NP-complete problem that is typically solved numerically via convex ...
In this presentation, we will develop a short overview of main trends of optimization in systems and control, and from there outline some new perspectives emerging today. More specifically, we will fo...
This paper studies the continuous-time distributed optimization of a sum of convex functions over directed graphs. Contrary to what is known in the consensus literature, where the same dynamics works ...
Abstract: This paper investigates the relation between sequential convex programming (SCP) as, e.g., defined in [24] and DC (difference of two convex functions) programming. We first present an SCP al...
Abstract: This paper proposes a new algorithm for solving constrained global optimization problems where both the objective function and constraints are one-dimensional non-differentiable multiextrema...
Abstract: Under the hypothesis that an initial point is a quasi-regular point, we use a majorant condition to present a new semi-local convergence analysis of an extension of the Gauss-Newton method f...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

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

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...