Related papers: On isosupremic vectorial minimisation problems in …

We identify the Variational Principle governing inifinity-Harmonic maps, that is solutions to the Infinity-Laplacian. The system was first derived in the limit of the p-Laplacian as p->inifinity in [K2] and is recently studied in [K3]. Here…

In this paper, we present a deterministic algorithm for the closest vector problem for all l_p-norms, 1 < p < \infty, and all polyhedral norms, especially for the l_1-norm and the l_{\infty}-norm. We achieve our results by introducing a new…

This paper studies high-order evaluation complexity for partially separable convexly-constrained optimization involving non-Lipschitzian group sparsity terms in a nonconvex objective function. We propose a partially separable adaptive…

Motivated, in particular, by the entropy-regularized optimal transport problem, we consider convex optimization problems with linear equality constraints, where the dual objective has Lipschitz $p$-th order derivatives, and develop two…

We propose a homogenized supremal functional rigorously derived via $L^p$-approximation by functionals of the type $\underset{x\in\Omega}{\mbox{ess-sup}}\hspace{0.03cm} f\left(\frac{x}{\varepsilon}, Du\right)$, when $\Omega$ is a bounded…

We provide new insights into the a priori theory for a time-stepping scheme based on least-squares finite element methods for parabolic first-order systems. The elliptic part of the problem is of general reaction-convection-diffusion type.…

In numerous substitution models for the $\l_{0}$-norm minimization problem $(P_{0})$, the $\l_{p}$-norm minimization $(P_{p})$ with $0<p<1$ have been considered as the most natural choice. However, the non-convex optimization problem…

This paper mainly investigates the analytic solutions for the approximation of $p$-Laplacian problem. Through an approximation mechanism, we convert the nonlinear partial differential equation with Dirichlet boundary into a sequence of…

We prove the existence of vectorial Absolute Minimisers in the sense of Aronsson to the supremal functional $E_\infty(u,\Omega') = \|\mathscr{L}(\cdot,u,D u)\|_{L^\infty(\Omega')}$, $\Omega'\Subset \Omega$, applied to $W^{1,\infty}$ maps…

Teichm\"uller's problem from 1944 is this: Given $x\in [0,1)$ find and describe the extremal quasiconformal map $f:\ID\to\ID$, $f|\partial \ID=identity$ and $f(0)=-x\leq 0$. We consider this problem in the setting of minimisers of…

We discover a new minimality property of the absolute minimisers of supremal functionals (also known as $L^\infty$ Calculus of Variations problems).

This paper is devoted to the study of $L_p$ Lyapunov-type inequalities for linear systems of equations with Neumann boundary conditions and for any constant $p \geq 1$. We consider ordinary and elliptic problems. The results obtained in the…

In this paper, we analyze an eigenvalue problem for quasi-linear elliptic operators involving homogeneous Dirichlet boundary conditions in a open smooth bounded domain. We show that the eigenfunctions corresponding to the eigenvalues belong…

Modeling magnitude Magnetic Resonance Images (MRI) rician denoising in a Bayesian or generalized Tikhonov framework using Total Variation (TV) leads naturally to the consideration of nonlinear elliptic equations. These involve the so called…

We present a methodology for establishing the existence of quadratic Lyapunov inequalities for a wide range of first-order methods used to solve convex optimization problems. In particular, we consider i) classes of optimization problems of…

We consider several classes of highly important semidefinite optimization problems that involve both a convex objective function (smooth or nonsmooth) and additional linear or nonlinear smooth and convex constraints, which are ubiquitous in…

A common optimization problem is the minimization of a symmetric positive definite quadratic form $< x,Tx >$ under linear constrains. The solution to this problem may be given using the Moore-Penrose inverse matrix. In this work we extend…

This article presents a new primal-dual weak Galerkin method for second order elliptic equations in non-divergence form. The new method is devised as a constrained $L^p$-optimization problem with constraints that mimic the second order…

Recently, Steinerberger proved a uniform inequality for the Laplacian serving as a counterpoint to the standard uniform sublevel set inequality which is known to fail for the Laplacian. In this paper, we observe that many inequalities of…

In view of solving nonsmooth and nonconvex problems involving complex constraints (like standard NLP problems), we study general maximization-minimization procedures produced by families of strongly convex sub-problems. Using techniques…