Related papers: On isosupremic vectorial minimisation problems in …
In this work we consider a system of quasilinear elliptic equations driven by an anisotropic $p$-Laplacian. The lower-order nonlinearities are in potential form and exhibit critical Sobolev growth. We exhibit conditions on the coefficients…
In this paper we study nonlinear second-order differential inclusions involving the ordinary vector $p$-Laplacian, a multivalued maximal monotone operator and nonlinear multivalued boundary conditions. Our framework is general and unifying…
The existence of a nontrivial solution is proved for a class of quasilinear elliptic equations involving, as principal part, either the p-Laplace operator or the operator related to the p-area functional, and a nonlinearity with p-linear…
This paper is concerned with the development and analysis of an iterative solver for high-dimensional second-order elliptic problems based on subspace-based low-rank tensor formats. Both the subspaces giving rise to low-rank approximations…
Model instability and poor prediction of long-term behavior are common problems when modeling dynamical systems using nonlinear "black-box" techniques. Direct optimization of the long-term predictions, often called simulation error…
The article addresses the convergence of implicit and semi-implicit, fully discrete approximations of a class of nonlinear parabolic evolution problems. Such schemes are popular in the numerical solution of evolutions defined with the…
In this work, we approach the minimization of a continuously differentiable convex function under linear equality constraints by a second-order dynamical system with asymptotically vanishing damping term. The system is formulated in terms…
Based on the ideas of arXiv:1710.06612, we consider the problem of minimization of the Holder-continuous non-smooth functional $f$ with non-positive convex (generally, non-smooth) Lipschitz-continuous functional constraint. We propose some…
Optimization problems with constraints in the form of a partial differential equation arise frequently in the process of engineering design. The discretization of PDE-constrained optimization problems results in large-scale linear systems…
Linear superiorization (abbreviated: LinSup) considers linear programming (LP) problems wherein the constraints as well as the objective function are linear. It allows to steer the iterates of a feasibility-seeking iterative process toward…
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…
This paper studies global a priori gradient estimates for divergence-type equations patterned over the $p$-Laplacian with first-order terms having polynomial growth with respect to the gradient, under suitable integrability assumptions on…
We study the minimization of the non-convex and non-differentiable objective function $v \mapsto \mathrm{E} ( \| X - v \| \| X + v \| - \| X \|^2 )$ in $\mathbb{R}^p$. In particular, we show that its minimizers recover the first principal…
Many practical problems can be formulated as l0-minimization problems with nonnegativity constraints, which seek the sparsest nonnegative solutions to underdetermined linear systems. Recent study indicates that l1-minimization is efficient…
Incorporating a non-Euclidean variable metric to first-order algorithms is known to bring enhancement. However, due to the lack of an optimal choice, such an enhancement appears significantly underestimated. In this work, we establish a…
In this paper we study quasilinear elliptic systems with nonlinear boundary condition with fully coupled perturbations even on the boundary. Under very general assumptions our main result says that each weak solution of such systems belongs…
We present a new feasible proximal gradient method for constrained optimization where both the objective and constraint functions are given by the summation of a smooth, possibly nonconvex function and a convex simple function. The…
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…
We deal with a wide class of nonlinear nonlocal equations led by integro-differential operators of order $(s,p)$, with summability exponent $p \in (1,\infty)$ and differentiability exponent $s\in (0,1)$, whose prototype is the fractional…
This paper proposes and analyzes a dampened proximal alternating direction method of multipliers (DP.ADMM) for solving linearly-constrained nonconvex optimization problems where the smooth part of the objective function is nonseparable.…