On double-covering stationary points of a constrained Dirichlet energy
نویسندگان
چکیده
منابع مشابه
On double-covering stationary points of a constrained Dirichlet energy
The double-covering map udc : R 2 → R is given by udc(x) = 1 √ 2|x| ( x2 2 − x12 2x1x2 ) in cartesian coordinates. This paper examines the conjecture that udc is the global minimizer of the Dirichlet energy I(u) = ∫ B |∇u| dx among allW 1,2 mappings u of the unit ball B ⊂ R satisfying (i) u = udc on ∂B, and (ii) det∇u = 1 almost everywhere. Let the class of such admissible maps be A. The chief ...
متن کاملStationary Points of Bound Constrained Minimization Reformulations of Complementarity Problems
We consider two merit functions which can be used for solving the nonlinear complementarity problem via nonnegatively constrained minimization. One of the functions is the restricted implicit Lagrangian (Refs. 1-3), and the other appears to be new. We study the conditions under which a stationary point of the minimization problem is guaranteed to be a solution of the underlying complementarity ...
متن کاملConvergence to Second Order Stationary Points in Inequality Constrained Optimization
We propose a new algorithm for the nonlinear inequality constrained minimization problem, and prove that it generates a sequence converging to points satisfying the KKT second order necessary conditions for optimality. The algorithm is a line search algorithm using directions of negative curvature and it can be viewed as a non trivial extension of corresponding known techniques from unconstrain...
متن کاملOn Covering Points with Minimum Turns
For the rectilinear version of the problem in which the lines must be axis-parallel, • Hassin and Megiddo (1991) observed that the problem in R reduces to vertex cover in bipartite graphs and hence is solvable in polynomial time, and proved that the problem in R in NP-hard by a reduction from 3SAT, • Gaur and Bhattacharya (2007) presented a (d − 1)approximation algorithm for the problem in R fo...
متن کاملSpace Constrained Dynamic Covering
In this paper, we identify a fundamental algorithmic problem that we term space-constrained dynamic covering (SCDC), arising in many modern-day web applications, including ad-serving and online recommendation systems in eBay and Netflix. Roughly speaking, SCDC applies two restrictions to the well-studied Max-Coverage problem [9]: Given an integer k, X = {1, 2, . . . , n} and I = {S1, . . . , Sm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré C, Analyse non linéaire
سال: 2014
ISSN: 0294-1449
DOI: 10.1016/j.anihpc.2013.04.001