Spectral optimization problems
نویسندگان
چکیده
منابع مشابه
Shape flows for spectral optimization problems
We consider a general formulation of gradient flow evolution for problems whose natural framework is the one of metric spaces. The applications we deal with are concerned with the evolution of capacitary measures with respect to the γ-convergence dissipation distance and with the evolution of domains in spectral optimization problems. AMS Subject Classification (2010): 49Q10, 49Q20, 58J30, 53C44.
متن کاملSpectral Optimization Problems with Internal Constraint
We consider spectral optimization problems with internal inclusion constraints, of the form min { λk(Ω) : D ⊂ Ω ⊂ R, |Ω| = m } , where the set D is fixed, possibly unbounded, and λk is the k th eigenvalue of the Dirichlet Laplacian on Ω. We analyze the existence of a solution and its qualitative properties, and rise some open questions.
متن کاملSpectral Optimization Problems for Potentials and Measures
In the present paper we consider spectral optimization problems involving the Schrödinger operator −∆ + μ on R, the prototype being the minimization of the k the eigenvalue λk(μ). Here μ may be a capacitary measure with prescribed torsional rigidity (like in the Kohler-Jobin problem) or a classical nonnegative potential V which satisfies the integral constraint ∫ V −pdx ≤ m with 0 < p < 1. We p...
متن کاملSpectral Finite-Element Methods for Parametric Constrained Optimization Problems
We present a method to approximate the solution mapping of parametric constrained optimization problems. The approximation, which is of the spectral finite element type, is represented as a linear combination of orthogonal polynomials. Its coefficients are determined by solving an appropriate finite-dimensional constrained optimization problem. We show that, under certain conditions, the latter...
متن کاملImproved spectral relaxation methods for binary quadratic optimization problems
In this paper, we introduce two newmethods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of computer vision problems—segmentation, clustering, subgraph matching to name a few—it has recently been challenged by semidefinite programming (SDP) relaxations. In fact, it can be shown that SDP relaxations produce better l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista Matemática Complutense
سال: 2011
ISSN: 1139-1138,1988-2807
DOI: 10.1007/s13163-011-0066-7