Related papers: On Lagrange multipliers of constrained optimizatio…
We deal with regular Lagrangian constrained systems which are invariant under the action of a symmetry group. Fixing a connection on the higher-order principal bundle where the Lagrangian and the (independent) constraints are defined, the…
We study a fictitious domain approach with Lagrange multipliers to discretize Stokes equations on a mesh that does not fit the boundaries. A mixed finite element method is used for fluid flow. Several stabilization terms are added to…
In this paper, we consider the quadratic programming problems under finitely many convex quadratic constraints in Hilbert spaces. By using the Legendre property of quadratic forms or the compactness of operators in the presentations of…
In this article we propose a novel nonstationary iterated Tikhonov (NIT) type method for obtaining stable approximate solutions to ill-posed operator equations modeled by linear operators acting between Hilbert spaces. Geometrical…
In the context of augmented Lagrangian approaches for solving semidefinite programming problems, we investigate the possibility of eliminating the positive semidefinite constraint on the dual matrix by employing a factorization. Hints on…
A random matrix is likely to be well conditioned, and motivated by this well known property we employ random matrix multipliers to advance some fundamental matrix computations. This includes numerical stabilization of Gaussian elimination…
Imposing additional constraints on low-rank optimization has garnered growing interest. However, the geometry of coupled constraints hampers the well-developed low-rank structure and makes the problem intricate. To this end, we propose a…
The aim of this paper is to develop a constraint algorithm for singular classical field theories in the framework of $k$-cosymplectic geometry. Since these field theories are singular, we need to introduce the notion of $k$-precosymplectic…
We generalize the notion of harmonic conjugate functions and Hilbert transforms to higher dimensional euclidean spaces, in the setting of differential forms and the Hodge-Dirac system. These conjugate functions are in general far from being…
Interior point methods for solving linearly constrained convex programming involve a variable projection matrix at each iteration to deal with the linear constraints. This matrix often becomes ill-conditioned near the boundary of the…
The systematization of the purely Lagrangean approach to constrained systems in the form of an algorithm involves the iterative construction of a generalized Hessian matrix W taking a rectangular form. This Hessian will exhibit as many left…
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…
The contribution of this work is twofold. The first part deals with a Hilbert-space version of McCann's celebrated result on the existence and uniqueness of monotone measure-preserving maps: given two probability measures $\rm P$ and $\rm…
The paper studies a distributed constrained optimization problem, where multiple agents connected in a network collectively minimize the sum of individual objective functions subject to a global constraint being an intersection of the local…
A new algorithm for solving the solution of the linear-quadratic optimization problem (LQP) with unseparated boundary conditions in the continuous case is given. Using the properties of symmetry of the corresponding Hamiltonian matrix, the…
In this paper we discuss the $L^p$-$L^q$ boundedness of both spectral and Fourier multipliers on general locally compact separable unimodular groups $G$ for the range $1<p\leq q<\infty$. We prove a Lizorkin type multiplier theorem for…
A solution to the effectiveness problem in Kohn's algorithm for generating subelliptic multipliers is provided for domains that include those given by sums of squares of holomorphic functions (also including infinite sums). These domains…
A broad class of optimization problems can be cast in composite form, that is, considering the minimization of the composition of a lower semicontinuous function with a differentiable mapping. This paper investigates the versatile template…
We present a powerful and easy-to-implement algorithm for solving constrained optimization problems that involve $L_1$/total-variation regularization terms, and both equality and inequality constraints. We discuss the relationship of our…
We establish precise regularity conditions for $L_p$-boundedness of Fourier multipliers in the group algebra of $SL_n(\mathbf{R})$. Our main result is inspired by H\"ormander-Mikhlin criterion from classical harmonic analysis, although it…