相关论文: An augmented Lagrangian model for signal segmentat…
This paper presents a new linear hyperspectral unmixing method of the minimum volume class, termed \emph{simplex identification via split augmented Lagrangian} (SISAL). Following Craig's seminal ideas, hyperspectral linear unmixing amounts…
Robust statistical estimators offer resilience against outliers but are often computationally challenging, particularly in high-dimensional sparse settings. Modern optimization techniques are utilized for robust sparse association…
This work aims to minimize a continuously differentiable convex function with Lipschitz continuous gradient under linear equality constraints. The proposed inertial algorithm results from the discretization of the second-order primal-dual…
We propose two different Lagrange multiplier methods for contact problems derived from the augmented Lagrangian variational formulation. Both the obstacle problem, where a constraint on the solution is imposed in the bulk domain and the…
Employing a phase space which includes the (Riemann-Liouville) fractional derivative of curves evolving on real space, we develop a restricted variational principle for Lagrangian systems yielding the so-called restricted fractional…
Image segmentation and image restoration are two important topics in image processing with great achievements. In this paper, we propose a new multiphase segmentation model by combining image restoration and image segmentation models.…
We present a novel augmented Lagrangian (AL) preconditioner for the solution of linear systems arising from finite element discretizations of elliptic interface problems with jump coefficients. The method is based on the Fictitious Domain…
We propose a duality scheme for solving constrained nonsmooth and nonconvex optimization problems in a reflexive Banach space. We establish strong duality for a very general type of augmented Lagrangian, in which we assume a less…
Latent variable models are an elegant framework for capturing rich probabilistic dependencies in many applications. However, current approaches typically parametrize these models using conditional probability tables, and learning relies…
We study deterministic and stochastic primal-dual sub-gradient algorithms for distributed optimization of a separable objective function with global inequality constraints. In both algorithms, the norm of the Lagrangian multipliers are…
Binary optimization is a central problem in mathematical optimization and its applications are abundant. To solve this problem, we propose a new class of continuous optimization techniques which is based on Mathematical Programming with…
We propose a Bayesian approach to detect multiple change-points in a piecewise-constant signal corrupted by a functional part corresponding to environmental or experimental disturbances. The piecewise constant part (also called segmentation…
Although much research has been devoted to the problem of restoring Poissonian images, namely in the fields of medical and astronomical imaging, applying the state of the art regularizers (such as those based on wavelets or total variation)…
In this paper, we propose the primal-dual method of multipliers (PDMM) for distributed optimization over a graph. In particular, we optimize a sum of convex functions defined over a graph, where every edge in the graph carries a linear…
We study dynamic minimization problems of the calculus of variations with generalized Lagrangian functionals that depend on a general linear operator $K$ and defined on bounded-time intervals. Under assumptions of regularity, convexity and…
This paper presents a comprehensive derivation and implementation of the Chan-Vese active contour model for image segmentation. The model, derived from the Mumford-Shah variational framework, evolves contours based on regional intensity…
This paper addresses a class of constrained optimization problems over networks in which local cost functions and constraints can be nonconvex. We propose an asynchronous distributed optimization algorithm, relying on the centralized Method…
We study stability and inclusion of the jump set of minimizers of convex denoising functionals, such as the celebrated "Rudin-Osher-Fatemi" functional, for scalar or vectorial signals. We show that under mild regularity assumptions on the…
Bayesian change-point detection, together with latent variable models, allows to perform segmentation over high-dimensional time-series. We assume that change-points lie on a lower-dimensional manifold where we aim to infer subsets of…
In this paper, we describe an implementation of the two-phase image segmentation algorithm proposed by Goldstein, Bresson, Osher in \cite{gold:bre}. This algorithm partitions the domain of a given 2d image into foreground and background…