信息来源： 数学学院研新社 研数视界 发布日期：2026年5月21日

报告人：吴可霖

报告题目（英文）：

Nonlinear Proximal Point Algorithms with Bregman Functions in Convex Programming

报告题目（中文）：

基于Bregman函数的非线性邻近点算法及其在凸规划中的应用

Abstract

A Bregman function is a strictly convex and differentiable function that introduces a well-behaved distance measure (i.e. D-function) in Euclidean space. This paper shows that for every Bregman function, there exists a nonlinear version of the proximal point algorithm, along with a corresponding convergence theory. Applying this generalization of the proximal point algorithm to convex programming leads to the D-function proximal minimization algorithm of Censor and Zenios, as well as a variety of new multiplier methods. These multiplier methods differ from those studied by Kort and Bertsekas, including non-quadratic variants of the proximal multiplier method.

PPT展示

报告人：刘浩泽

报告题目（英文）：

Discrete-Time Terminal Sliding Mode Control

报告题目（中文）：

离散时间终端滑模控制

Abstract

In practical applications, as most control schemes are implemented digitally, it is essential to investigate control strategies for discrete-time systems. This paper briefly introduces the development and design principles of continuous-time terminal sliding mode control, and then summarizes the current research status and progress of discrete-time terminal sliding mode control. The performance of discrete-time terminal sliding mode control is briefly discussed, and finally several potential future research directions are pointed out.

PPT展示