In this paper, our focus lies on addressing a two-block linearly constrained nonseparable nonconvex optimization problem with coupling terms. The most classical algorithm, the alternating direction method of multiplie...In this paper, our focus lies on addressing a two-block linearly constrained nonseparable nonconvex optimization problem with coupling terms. The most classical algorithm, the alternating direction method of multipliers (ADMM), is employed to solve such problems typically, which still requires the assumption of the gradient Lipschitz continuity condition on the objective function to ensure overall convergence from the current knowledge. However, many practical applications do not adhere to the conditions of smoothness. In this study, we justify the convergence of variant Bregman ADMM for the problem with coupling terms to circumvent the issue of the global Lipschitz continuity of the gradient. We demonstrate that the iterative sequence generated by our approach converges to a critical point of the issue when the corresponding function fulfills the Kurdyka-Lojasiewicz inequality and certain assumptions apply. In addition, we illustrate the convergence rate of the algorithm.展开更多
针对目标函数中包含耦合函数H(x,y)的非凸非光滑极小化问题,提出了一种线性惯性交替乘子方向法(Linear Inertial Alternating Direction Method of Multipliers,LIADMM)。为了方便子问题的求解,对目标函数中的耦合函数H(x,y)进行线性化...针对目标函数中包含耦合函数H(x,y)的非凸非光滑极小化问题,提出了一种线性惯性交替乘子方向法(Linear Inertial Alternating Direction Method of Multipliers,LIADMM)。为了方便子问题的求解,对目标函数中的耦合函数H(x,y)进行线性化处理,并在x-子问题中引入惯性效应。在适当的假设条件下,建立了算法的全局收敛性;同时引入满足Kurdyka-Lojasiewicz不等式的辅助函数,验证了算法的强收敛性。通过两个数值实验表明,引入惯性效应的算法比没有惯性效应的算法收敛性能更好。展开更多
Two-phase image segmentation is a fundamental task to partition an image into foreground and background.In this paper,two types of nonconvex and nonsmooth regularization models are proposed for basic two-phase segment...Two-phase image segmentation is a fundamental task to partition an image into foreground and background.In this paper,two types of nonconvex and nonsmooth regularization models are proposed for basic two-phase segmentation.They extend the convex regularization on the characteristic function on the image domain to the nonconvex case,which are able to better obtain piecewise constant regions with neat boundaries.By analyzing the proposed non-Lipschitz model,we combine the proximal alternating minimization framework with support shrinkage and linearization strategies to design our algorithm.This leads to two alternating strongly convex subproblems which can be easily solved.Similarly,we present an algorithm without support shrinkage operation for the nonconvex Lipschitz case.Using the Kurdyka-Lojasiewicz property of the objective function,we prove that the limit point of the generated sequence is a critical point of the original nonconvex nonsmooth problem.Numerical experiments and comparisons illustrate the effectiveness of our method in two-phase image segmentation.展开更多
The alternating direction method of multipliers(ADMM)is one of the most successful and powerful methods for separable minimization optimization.Based on the idea of symmetric ADMM in two-block optimization,we add an u...The alternating direction method of multipliers(ADMM)is one of the most successful and powerful methods for separable minimization optimization.Based on the idea of symmetric ADMM in two-block optimization,we add an updating formula for the Lagrange multiplier without restricting its position for multiblock one.Then,combining with the Bregman distance,in this work,a Bregman-style partially symmetric ADMM is presented for nonconvex multi-block optimization with linear constraints,and the Lagrange multiplier is updated twice with different relaxation factors in the iteration scheme.Under the suitable conditions,the global convergence,strong convergence and convergence rate of the presented method are analyzed and obtained.Finally,some preliminary numerical results are reported to support the correctness of the theoretical assertions,and these show that the presented method is numerically effective.展开更多
文摘In this paper, our focus lies on addressing a two-block linearly constrained nonseparable nonconvex optimization problem with coupling terms. The most classical algorithm, the alternating direction method of multipliers (ADMM), is employed to solve such problems typically, which still requires the assumption of the gradient Lipschitz continuity condition on the objective function to ensure overall convergence from the current knowledge. However, many practical applications do not adhere to the conditions of smoothness. In this study, we justify the convergence of variant Bregman ADMM for the problem with coupling terms to circumvent the issue of the global Lipschitz continuity of the gradient. We demonstrate that the iterative sequence generated by our approach converges to a critical point of the issue when the corresponding function fulfills the Kurdyka-Lojasiewicz inequality and certain assumptions apply. In addition, we illustrate the convergence rate of the algorithm.
文摘针对目标函数中包含耦合函数H(x,y)的非凸非光滑极小化问题,提出了一种线性惯性交替乘子方向法(Linear Inertial Alternating Direction Method of Multipliers,LIADMM)。为了方便子问题的求解,对目标函数中的耦合函数H(x,y)进行线性化处理,并在x-子问题中引入惯性效应。在适当的假设条件下,建立了算法的全局收敛性;同时引入满足Kurdyka-Lojasiewicz不等式的辅助函数,验证了算法的强收敛性。通过两个数值实验表明,引入惯性效应的算法比没有惯性效应的算法收敛性能更好。
基金supported by the National Natural Science Foundation of China(NSFC)(No.12001144)Zhejiang Provincial Natural Science Foundation of China(No.LQ20A010007)+1 种基金Chern Institute of Mathematicssupported by the National Natural Science Foundation of China(NSFC)(Nos.11871035,11531013).
文摘Two-phase image segmentation is a fundamental task to partition an image into foreground and background.In this paper,two types of nonconvex and nonsmooth regularization models are proposed for basic two-phase segmentation.They extend the convex regularization on the characteristic function on the image domain to the nonconvex case,which are able to better obtain piecewise constant regions with neat boundaries.By analyzing the proposed non-Lipschitz model,we combine the proximal alternating minimization framework with support shrinkage and linearization strategies to design our algorithm.This leads to two alternating strongly convex subproblems which can be easily solved.Similarly,we present an algorithm without support shrinkage operation for the nonconvex Lipschitz case.Using the Kurdyka-Lojasiewicz property of the objective function,we prove that the limit point of the generated sequence is a critical point of the original nonconvex nonsmooth problem.Numerical experiments and comparisons illustrate the effectiveness of our method in two-phase image segmentation.
基金supported by the National Natural Science Foundation of China (No.12171106)the Natural Science Foundation of Guangxi Province (No.2020GXNSFDA238017)。
文摘The alternating direction method of multipliers(ADMM)is one of the most successful and powerful methods for separable minimization optimization.Based on the idea of symmetric ADMM in two-block optimization,we add an updating formula for the Lagrange multiplier without restricting its position for multiblock one.Then,combining with the Bregman distance,in this work,a Bregman-style partially symmetric ADMM is presented for nonconvex multi-block optimization with linear constraints,and the Lagrange multiplier is updated twice with different relaxation factors in the iteration scheme.Under the suitable conditions,the global convergence,strong convergence and convergence rate of the presented method are analyzed and obtained.Finally,some preliminary numerical results are reported to support the correctness of the theoretical assertions,and these show that the presented method is numerically effective.