Related papers: On the minimal distance between two surfaces
In this work, we analyze two of the most fundamental algorithms in geodesically convex optimization: Riemannian gradient descent and (possibly inexact) Riemannian proximal point. We quantify their rates of convergence and produce different…
The aim of this short note is to give counterexamples to two results by D. Y. Gao [5, Th. 16], [4, Th. 2] and to improve a related result by S.-C. Fang, D. Y. Gao, R.-L. Sheu and S.-Y. Wu [1, Th. 3].
We present a general purpose method for solving partial differential equations on a closed surface, based on a technique for discretizing the surface introduced by Wenjun Ying and Wei-Cheng Wang [J. Comput. Phys. 252 (2013), pp. 606-624]…
We introduce the $st$-cut version the Sparsest-Cut problem, where the goal is to find a cut of minimum sparsity among those separating two distinguished vertices $s,t\in V$. Clearly, this problem is at least as hard as the usual (non-$st$)…
The goal of this paper is to design compact support basis spline functions that best approximate a given filter (e.g., an ideal Lowpass filter). The optimum function is found by minimizing the least square problem ($\ell$2 norm of the…
This paper treats the problem of minimizing a general continuously differentiable function subject to sparsity constraints. We present and analyze several different optimality criteria which are based on the notions of stationarity and…
This paper develops a novel approach to necessary optimality conditions for constrained variational problems defined in generally incomplete subspaces of absolutely continuous functions. Our approach involves reducing a variational problem…
We advance a combined filtered/phase-field approach to topology optimization in the setting of linearized elasticity. Existence of minimizers is proved and rigorous parameter asymptotics are discussed by means of variational convergence…
We study optimization problems for partially hinged rectangular plates, modeling bridge roadways, in the presence of real and artificial obstacles. Real obstacles represent structural constraints to avoid, while artificial ones are…
We present a constructive approach to surface comparison realizable by a polynomial-time algorithm. We determine the "similarity" of two given surfaces by solving a mass-transportation problem between their conformal densities. This mass…
This paper proposes a universal algorithm for convex minimization problems of the composite form $g_0(x)+h(g_1(x),\dots, g_m(x)) + u(x)$. We allow each $g_j$ to independently range from being nonsmooth Lipschitz to smooth, from convex to…
Recently there were proposed some innovative convex optimization concepts, namely, relative smoothness [1] and relative strong convexity [2,3]. These approaches have significantly expanded the class of applicability of gradient-type methods…
This paper studies simple bilevel problems, where a convex upper-level function is minimized over the optimal solutions of a convex lower-level problem. We first show the fundamental difficulty of simple bilevel problems, that the…
We study the footprint function, with respect to a monomial order, of complete intersection graded ideals in a polynomial ring with coefficients in a field. For graded ideals of dimension one, whose initial ideal is a complete intersection,…
With the blessing of hind sight we consider the problem of metrizability and show that the classical Bing-Nagata-Smirnov Theorem and a more recent result of Flagg give complementary answers to the metrization problem, that are in a sense…
In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…
We consider minimization of functions that are compositions of convex or prox-regular functions (possibly extended-valued) with smooth vector functions. A wide variety of important optimization problems fall into this framework. We describe…
In this paper we study the right differentiability of a parametric infimum function over a parametric set defined by equality constraints. We present a new theorem with sufficient conditions for the right differentiability with respect to…
We prove the existence of global minimizers to the double minimization problem \[ \inf\Big\{ P(E) + \lambda W_p(\mathcal{L}^n \lfloor \, E,\mathcal{L}^n \lfloor\, F) \colon |E \cap F| = 0, \, |E| = |F| = 1\Big\}, \] where $P(E)$ denotes the…
We investigate the computational complexity of min-max optimization under coupled constraints. The work of Daskalakis, Skoulakis, and Zampetakis [DSZ21] was the first to study min-max optimization through the lens of computational…