Related papers: The planar Least Gradient problem in convex domain…
The problem of finding the sparsest vector (direction) in a low dimensional subspace can be considered as a homogeneous variant of the sparse recovery problem, which finds applications in robust subspace recovery, dictionary learning,…
We consider the variational problem of minimizing an anisotropic perimeter functional under a volume constraint in a Euclidean convex domain. We extend to this setting analytical properties of the isoperimetric profile, topological features…
In this work we address the question of the existence of nonradial domains inside a nonconvex cone for which a mixed boundary overdetermined problem admits a solution. Our approach is variational, and consists in proving the existence of…
In this paper we study a general class of nonlinear elliptic problems in divergence form. First, we prove that the solutions to these problems satisfy a convexity property when the given domain is strictly convex. Then, making use of this…
We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on…
We construct least squares formulations of PDEs with inhomogeneous essential boundary conditions, where boundary residuals are not measured in unpractical fractional Sobolev norms, but which formulations nevertheless are shown to yield a…
We consider the differentiation of the value function for parametric optimization problems. Such problems are ubiquitous in Machine Learning applications such as structured support vector machines, matrix factorization and min-min or…
We show that if a bounded pseudoconvex domain satisfies the solvability of the bounded $\bar{\partial}$ problem, then the ideal of bounded holomorphic functions vanishing at a point in the domain is finitely generated. We also prove a…
In this work, a novel approach for the solution of the inverse conductivity problem from one and multiple boundary measurements has been developed on the basis of the implication of the framework of BV - functions. The space of the…
Construction of spline surfaces from given boundary curves is one of the classical problems in computer aided geometric design, which regains much attention in isogeometric analysis in recent years and is called domain parameterization.…
Many problems in high-dimensional statistics and optimization involve minimization over nonconvex constraints-for instance, a rank constraint for a matrix estimation problem-but little is known about the theoretical properties of such…
The convergence behavior of gradient methods for minimizing convex differentiable functions is one of the core questions in convex optimization. This paper shows that their well-known complexities can be achieved under conditions weaker…
Laplace problems on planar domains can be solved by means of least-squares expansions associated with polynomial or rational approximations. Here it is shown that, even in the context of an analytic domain with analytic boundary data, the…
We study a general class of convex submodular optimization problems with indicator variables. Many applications such as the problem of inferring Markov random fields (MRFs) with a sparsity or robustness prior can be naturally modeled in…
We investigate the qualitative properties of the weak solutions to the boundary value problems for the hyperbolic fourth-order linear equations with constant coefficients in the plane bounded domain convex with respect to characteristics.…
We consider a class of convex integral functionals composed of a term of linear growth in the gradient of the argument, and a fidelity term involving $L^2$ distance from a datum. Such functionals are known to attain their infima in the $BV$…
We consider the existence problem for `Steiner networks' (trivalent graphs with 120 degree angles at each junction) in strictly convex domains, with `Neumann' boundary conditions (orthogonal intersection with the domain boundary.) For each…
We prove minimax theorems for lower semicontinuous functions defined on a Hilbert space. The main tool is the theory of $\Phi$-convex functions and sufficient and necessary conditions for the minimax equality to hold for $\Phi$-convex…
We revisit the smooth convex-concave bilinearly-coupled saddle-point problem of the form $\min_x\max_y f(x) + \langle y,\mathbf{B} x\rangle - g(y)$. In the highly specific case where each of the functions $f(x)$ and $g(y)$ is either affine…
In this paper, we study the problem of solving a simple bilevel optimization problem, where the upper-level objective is minimized over the solution set of the lower-level problem. We focus on the general setting in which both the upper-…