Related papers: On Lagrange multipliers in convex entropy minimiza…
In this letter we propose the use of physics techniques for entropy determination on constrained parameter optimization problems. The main feature of such techniques, the construction of an unbiased walk on energy space, suggests their use…
This paper investigates energy-minimization finite-element approaches for the computation of nematic liquid crystal equilibrium configurations. We compare the performance of these methods when the necessary unit-length constraint is…
In this note, we prove that minimizers of convex functionals with a convexity constraint and a general class of Lagrangians can be approximated by solutions to fourth-order equations of Abreu type. Our result generalizes that of Le (Twisted…
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…
In this paper we present a complete iteration complexity analysis of inexact first order Lagrangian and penalty methods for solving cone constrained convex problems that have or may not have optimal Lagrange multipliers that close the…
We present a method for solving linearly constrained convex optimization problems, which is based on the application of known algorithms for finding zeros of the sum of two monotone operators (presented by Eckstein and Svaiter) to the dual…
We propose a method for verifying that a given feasible point for a polynomial optimization problem is globally optimal. The approach relies on the Lasserre hierarchy and the result of Lasserre regarding the importance of the convexity of…
We minimize elastic energies on framed curves which penalize both curvature and torsion. We also discuss critical points using the infinite dimensional version of the Lagrange multipliers' method. Finally, some examples arising from the…
To calculate the entropy of a subalgebra or of a channel with respect to a state, one has to solve an intriguing optimalization problem. The latter is also the key part in the entanglement of formation concept, in which case the subalgebra…
We investigate non-convex optimization problems in $BV(\Omega)$ with two-sided pointwise inequality constraints. We propose a regularization and penalization method to numerically solve the problem. Under certain conditions, weak limit…
A new Levenberg--Marquardt (LM) method for solving nonlinear least squares problems with convex constraints is described. Various versions of the LM method have been proposed, their main differences being in the choice of a damping…
Geometric optimisation algorithms are developed that efficiently find the nearest low-rank correlation matrix. We show, in numerical tests, that our methods compare favourably to the existing methods in the literature. The connection with…
The pressure vessel design problem is a well-known design benchmark for validating bio-inspired optimization algorithms. However, its global optimality is not clear and there has been no mathematical proof put forward. In this paper, a…
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…
We advocate an optimization procedure for variable density sampling in the context of compressed sensing. In this perspective, we introduce a minimization problem for the coherence between the sparsity and sensing bases, whose solution…
We study a specific convex maximization problem in n-dimensional space. The conjectured solution is proved to be a vertex of the polyhedral feasible region, but only a partial proof of local maximality is known. Integer sequences with…
This work proposes a novel adaptive linearized alternating direction multiplier method (LADMM) to convex optimization, which improves the convergence rate of the LADMM-based algorithm by adjusting step-size iteratively.The innovation of…
The unique solvability and error analysis of the original Lagrange multiplier approach proposed in [8] for gradient flows is studied in this paper. We identify a necessary and sufficient condition that must be satisfied for the nonlinear…
Compressed Sensing (CS) encompasses a broad array of theoretical and applied techniques for recovering signals, given partial knowledge of their coefficients. Its applications span various fields, including mathematics, physics,…
This work investigates the theoretical performance of the alternating-direction method of multipliers (ADMM) as it applies to nonconvex optimization problems, and in particular, problems with nonconvex constraint sets. The alternating…