N ov 1 99 8 Area Minimizing Sets Subject to a Volume Constraint in a Convex Set
نویسنده
چکیده
منابع مشابه
Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملSDO relaxation approach to fractional quadratic minimization with one quadratic constraint
In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...
متن کاملPrivate Empirical Risk Minimization Beyond the Worst Case: The Effect of the Constraint Set Geometry
Empirical Risk Minimization (ERM) is a standard technique in machine learning, where a model is selected by minimizing a loss function over constraint set. When the training dataset consists of private information, it is natural to use a differentially private ERM algorithm, and this problem has been the subject of a long line of work [CM08, KST12, JKT12, ST13a, DJW13, JT14, BST14, Ull14]. A pr...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملRegularity of Minimizers of Quasi Perimeters with a Volume Constraint
In this article, we study the regularity of the boundary of sets minimizing a quasi perimeter T (E) = P (E,Ω) + G (E) with a volume constraint. Here Ω is any open subset of Rn with n ≥ 2, G is a lower semicontinuous function on sets of finite perimeter satisfying a condition that G (E) ≤ G (F ) + C |E∆F | among all sets of finite perimeter with equal volume. We show that under the condition β >...
متن کامل