自由边界问题的自适应Uzawa块松弛算法

利用增广Lagrange乘子法和自适应法则，得到求解单侧障碍自由边界问题的自适应Uzawa块松弛法.单侧障碍自由边界问题离散为有限维线性互补问题，等价于一个用辅助变量和增广Lagrange函数表示的鞍点问题.采用Uzawa块松弛算法求解该问题得到一个两步迭代法，主要的子问题为一个线性问题，同时能显式求解辅助变量.由于Uzawa块松弛算法的收敛速度显著依赖于罚参数，而且对具体问题很难选择合适的罚参数.为提高算法的性能，提出了自适应法则，该方法自动调整每次迭代所需的罚参数.数值结果验证了该算法的理论分析.     

几乎不可压线弹性问题的新的Uzawa型自适应有限元方法

本文针对几乎不可压线弹性问题设计新的Uzawa型自适应有限元方法,该方法可克服"闭锁"现象·通过引入"压力"变量将弹性问题转化为一个鞍点系统,对该系统将Uzawa型迭代法和自适应有限元方法相结合,建立了Uzawa型自适应有限元方法,并给出了该算法的收敛性.该算法采用低阶协调有限元通近空间变量,选取的有限元空间对无需满足离散的BB条件.最后,数值算例验证了理论结果的正确性.     

曲率障碍下四阶变分不等式的交替方向乘子法北大核心CSCD

对于重调和算子和曲率障碍表示的变分不等式,提出了自适应交替方向乘子数值解法(SADMM).对问题引入一个辅助变量表示曲率函数的增广Lagrange函数,导出一个约束极小值问题,并且该问题等价于一个鞍点问题.然后采用交替方向乘子法(ADMM)求解这个鞍点问题.通过采用平衡原理和迭代函数,得到了自动调整罚参数的自适应法则,从而提高了计算效率.证明了该方法的收敛性,并给出了利用迭代函数近似罚参数的具体方法.最后,用数值计算结果验证了该方法的有效性.     

几乎不可压缩线性弹性问题的多重网格Uzawa型混合有限元方法

该文针对几乎不可压缩弹性问题,设计了多重网格Uzawa型混合有限元方法,成功克服了"闭锁"现象.通过引入"压力"变量p将弹性问题转化为一个鞍点型系统,对该系统将Uzawa型迭代法和多重网格方法相结合,建立了多重网格和套迭代多重网格Uzawa型混合有限元方法,并给出了该算法的收敛性.数值算例验证了方法的有效性和稳定性.     

鞍点问题的修正对称超松弛迭代算法

为了提高求解鞍点问题的迭代算法的速度,通过设置合适的加速变量,对修正超松弛迭代算法（简记作MSOR-like算法）和广义对称超松弛迭代算法（简记作GSSOR-like算法）进行了修正,给出了修正对称超松弛迭代算法,即MSSOR-like （modified symmetric successiveover-relaxation）算法,并研究了该算法收敛的充分必要条件.最后,通过数值例子表明,选择合适的参数后,新算法的迭代速度和迭代次数均优于MSOR-like （modified successive overrelaxation）和GSSOR-like （generalized symmetric successive over-relaxation）算法,因此,它是一种较好的解决鞍点问题的算法.     

基于对偶混合变分形式的Uzawa型算法

基于弹性接触问题的三变量（应力，位移，接触边界位移）对偶混合变分形式，对混合有限元离散化的单边约束问题，提出了一种Uzawa型算法。首先证明了迭代算法的收敛性，然后用数值例子验证了迭代算法的有效性。     

无限多类别网络均衡问题中的收费计算

对于一个多类别的网络均衡问题,可以通过计算某个辅助问题的容量限制约束相应的乘子向量得到有效收费.本文通过计算拉格朗日函数的鞍点来计算乘子向量.借助于广义拉格朗日函数的稳定性和Uzawa算法非精确解的收敛性,得到鞍点序列的收敛性.其中离散化方法用于最小化广义拉格朗日函数的计算.     

基于分段常值水平集的抛物型方程的参数识别算法

研究了线性抛物型方程不连续参数的识别算法.根据原有算法对于加噪观测数据计算不收敛的问题,本文基于分段常值水平集方法,根据水平集函数和优化过程的特点,修正原有Uzawa型算法中的带有总变差(TV)正则化的极小化模型和对常值向量的极小化模型,并且利用分裂Bregman迭代算法处理TV范数的优越性,构造一种新的参数识别算法格式.数值实验结果显示,新算法具有计算时间短、精度高、抗噪性强的优点.     

带交易费用的离散多因素投资组合最优化

研究带有凹的交易费函数的离散多因素投资组合模型．与传统的投资组合模型不同的是,该模型中投资组合的决策变量是交易手数（整数）,其最优化模型是一个非线性整数规划问题．为此本文提出了一个基于拉格朗日松弛和连续松弛的混合分枝定界算法,为测试算法的有效性,我们分别采用美国股票市场真实数据和随机产生的数据,数值结果表明该算法是有效的．     

一个结构型凸优化问题的分裂算法

考虑带线性约束的三块变量的凸优化模型,目标函数是可分的三个函数和.给出了一个新的分裂算法.首先,对每个块变量解极小化增广拉格朗日函数.然后,通过一个校正步得到新的迭代点.证明了新算法的整体收敛性和O(1/t)的收敛阶.     

Uzawa block relaxation method for the unilateral contact problem

We present a Uzawa block relaxation method for the numerical resolution of contact problems with or without friction, between elastic solids in small deformations. We introduce auxiliary unknowns to separate the linear elasticity subproblem from the unilateral contact and friction conditions. Applying a Uzawa block relaxation method to the corresponding augmented Lagrangian functional yields a two-step iterative method with a linear elasticity problem as a main subproblem while auxiliary unknowns are computed explicitly. Numerical experiments show that the method are robust and scalable with a significant saving of computational time.     

Uzawa block relaxation domain decomposition method for a two-body frictionless contact problem

We propose a Uzawa block relaxation domain decomposition method for a two-body frictionless contact problem. We introduce auxiliary variables to separate subdomains representing linear elastic bodies. Applying a Uzawa block relaxation algorithm to the corresponding augmented Lagrangian functional yields a domain decomposition algorithm in which we have to solve two uncoupled linear elasticity subproblems in each iteration while the auxiliary variables are computed explicitly using Kuhn–Tucker optimality conditions.     

Parallel Uzawa Method for Large-Scale Minimization of Partially Separable Functions

A parallel Uzawa-type algorithm, for solving unconstrained minimization of large-scale partially separable functions, is presented. Using auxiliary unknowns, the unconstrained minimization problem is transformed into a (linearly) constrained minimization of a separable function.The augmented Lagrangian of this problem decomposes into a sum of partially separable augmented Lagrangian functions. To take advantage of this property, a Uzawa block relaxation is applied. In every iteration, unconstrained minimization subproblems are solved in parallel before updating Lagrange multipliers. Numerical experiments show that the speed-up factor gained using our algorithm is significant.     

Analysis and Numerical Approximation of a Contact Problem Involving Nonlinear Hencky-Type Materials with Nonlocal Coulomb’s Friction Law

A static frictional contact problem between an elasto-plastic body and a rigid foundation is considered. The material’s behavior is described by the nonlinear elastic constitutive Hencky’s law. The contact is modeled with the Signorini condition and a version of Coulomb’s law in which the coefficient of friction depends on the slip. The existence of a weak solution is proved by using Schauder’s fixed-point theorem combined with arguments of abstract variational inequalities. Afterward, a successive iteration technique, based on the Ka?anov method, to solve the problem numerically is proposed, and its convergence is established. Then, to improve the conditioning of the iterative problem, an appropriate Augmented Lagrangian formulation is used and that will lead us to Uzawa block relaxation method in every iteration. Finally, numerical experiments of two-dimensional test problems are carried out to illustrate the performance of the proposed algorithm.     

Convergence analysis of generalized nonlinear inexact Uzawa algorithm for stabilized saddle point problems

This paper deals with a modified nonlinear inexact Uzawa (MNIU) method for solving the stabilized saddle point problem. The modified Uzawa method is an inexact inner-outer iteration with a variable relaxation parameter and has been discussed in the literature for uniform inner accuracy. This paper focuses on the general case when the accuracy of inner iteration can be variable and the convergence of MNIU with variable inner accuracy, based on a simple energy norm. Sufficient conditions for the convergence of MNIU are proposed. The convergence analysis not only greatly improves the existing convergence results for uniform inner accuracy in the literature, but also extends the convergence to the variable inner accuracy that has not been touched in literature. Numerical experiments are given to show the efficiency of the MNIU algorithm.     

Uzawa methods for a class of block three‐by‐three saddle‐point problems

In this work, we consider numerical methods for solving a class of block three‐by‐three saddle‐point problems, which arise from finite element methods for solving time‐dependent Maxwell equations and some other applications. The direct extension of the Uzawa method for solving this block three‐by‐three saddle‐point problem requires the exact solution of a symmetric indefinite system of linear equations at each step. To avoid heavy computations at each step, we propose an inexact Uzawa method, which solves the symmetric indefinite linear system in some inexact way. Under suitable assumptions, we show that the inexact Uzawa method converges to the unique solution of the saddle‐point problem within the approximation level. Two special algorithms are customized for the inexact Uzawa method combining the splitting iteration method and a preconditioning technique, respectively. Numerical experiments are presented, which demonstrated the usefulness of the inexact Uzawa method and the two customized algorithms.     

Mixed finite element analysis of semi-coercive unilateral contact problems with given friction

A unilateral contact 2D-problem is considered provided one of two elastic bodies can shift in a given direction as a rigid body. Using Lagrange multipliers for both normal and tangential constraints on the contact interface, we introduce a saddle point problem and prove its unique solvability. We discretize the problem by a standard finite element method and prove a convergence of approximations. We propose a numerical realization on the basis of an auxiliary “ bolted” problem and the algorithm of Uzawa.