TITLE

Area-minimizing subsurfaces of Scherk's singly periodic surface and the catenoid

AUTHOR(S)
Halverson, Denise; Lawlor, Gary
PUB. DATE
February 2006
SOURCE
Calculus of Variations & Partial Differential Equations;Feb2006, Vol. 25 Issue 2, p257
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
An unbounded portion of the catenoid and a class of subsurfaces of Scherk's singly periodic surface defined over nonconvex domains are shown to be area-minimizing.
ACCESSION #
19798745

 

Related Articles

  • NEW PARTITIONING METHOD FOR A CLASS OF NONCONVEX OPTIMIZATION PROBLEMS. Thach, Phan Thien // Mathematics of Operations Research;Feb92, Vol. 17 Issue 1, p43 

    We consider the problem min {f(x, y): gi (x, y) ⩽ 0, i = 1, …, m, x ∈ X, y ∈ Y} where f and the gi are lower semicontinuous and convex in y for fixed x but not convex jointly in (x, y), X is a compact subset of Rn, Y is a closed convex set in Rm. In order to decompose this...

  • ON THE DUALITY GAP IN NONCONVEX OPTIMIZATION. Pappalardo, M. // Mathematics of Operations Research;Feb86, Vol. 11 Issue 1, p30 

    Given a nonconvex constrained minimization problem, we introduce the dual problem by means of the ordinary Lagrangean function. The aim of the paper is to give, by means of the "image problem", an estimate of the duality gap using the definition of lack of convexity of a function.

  • EXTREME RAY.  // Encyclopedia of Operations Research & Management Science;2001, p277 

    A definition of "extreme ray" is presented. It refers to a ray in a convex set directed towards an extreme solution.

  • A sequential method for a class of box constrained quadratic programming problems. Cambini, Riccardo; Sodini, Claudio // Mathematical Methods of Operations Research;2008, Vol. 67 Issue 2, p223 

    The aim of this paper is to propose an algorithm, based on the optimal level solutions method, which solves a particular class of box constrained quadratic problems. The objective function is given by the sum of a quadratic strictly convex separable function and the square of an affine function...

  • The Properties of The Weak Subdifferentials. Kasimbeylı, Refail; İnceoğlu, Gonca // Gazi University Journal of Science;Jan2010, Vol. 23 Issue 1, p49 

    This paper deals with the weak subdifferentials. The properties of the weak subdifferentials are examined. It is showed that the weak subdifferential of a function having a global minimum is not empty.

  • CONFIGURATION SPACE OF MOVING OBJECTS. Yankov, Kaloyan // Proceedings of the International Conference on Systems for Autom;2004, p1 

    Configuration space methods are commonly used in motion planning algorithms. Algorithms for defining the configuration space of moving objects use Minkowski sum, but it is applicable only for convex objects. If the obstacle is non-convex, triangle subdivision to convex objects must be performed....

  • ON THE MINIMIZATION OF SOME NONCONVEX DOUBLE OBSTACLE PROBLEMS. ELFANNI, A. // Journal of Applied Mathematics;2009, p535 

    We consider a nonconvex variational problem for which the set of admissible functions consists of all Lipschitz functions located between two fixed obstacles. It turns out that the value of the minimization problem at hand is equal to zero when the obstacles do not touch each other; otherwise,...

  • Some remarks on lower hemicontinuity of convex multivalued mappings. Maćkowiak, Piotr // Economic Theory;May2006, Vol. 28 Issue 1, p227 

    For a multifunction a condition sufficient for lower hemicontinuity is presented. It is shown that under convexity of graph it is possible for a multifunction to be not continuous only when a special representation of points of its domain is not feasible.

  • The Stochastic Discrete Dynamic Lot Size Problem: An Open-Loop Solution. Lasserre, J. B.; Bes, C.; Roubellat, F. // Operations Research;May/Jun85, Vol. 33 Issue 3, p684 

    We investigate the stochastic dynamic lot size model, taking into account probabilistic constraints on the state variable. Our approach is to obtain an open-loop solution by solving a new equivalent deterministic dynamic lot size problem with new parameters. We also discuss characteristics of...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics