Minimization problem associated with an improved Hardy–Sobolev type inequality
نویسندگان
چکیده
منابع مشابه
An improved algorithm for the L2 - Lp minimization problem
In this paper we consider a class of non-Lipschitz and non-convex minimization problems which generalize the L2 − Lp minimization problem. We propose an iterative algorithm that decides the next iteration based on the local convexity/concavity/sparsity of its current position. We show that our algorithm finds an -KKT point within O(log −1) iterations. The same result is also applied to the prob...
متن کاملAn Improved Evaluation Function for the Bandwidth Minimization Problem
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our δ function is much more discriminating and leads to smoother landscapes. The main characteristics of δ are analyzed and its practical usefulness is assessed within a Simulated Annealing algorithm. Experiments show that t...
متن کاملAn Improved Algorithm for the Metro-line Crossing Minimization Problem
In the metro-line crossing minimization problem, we are given a plane graph G = (V,E) and a set L of simple paths (or lines) that cover G, that is, every edge e ∈ E belongs to at least one path in L. The problem is to draw all paths in L along the edges of G such that the number of crossings between paths is minimized. This crossing minimization problem arises, for example, when drawing metro m...
متن کاملAn Improved Chen-ricci Inequality
Oprea proves that Ric(X) ≤ n−1 4 (c + n||H||) improving the Chen-Ricci inequality for Lagrangian submanifolds in complex space forms by using an optimization technique. In this article, we give an algebraic proof of the inequality and completely classify Lagrangian submanifolds in complex space forms satisfying the equality, which is not discussed in Oprea’s paper.
متن کاملAn Improved Approximation Algorithm for the Traveling Salesman Problem with Relaxed Triangle Inequality
Given a complete edge-weighted graph G, we present a polynomial time algorithm to compute a degree-four-bounded spanning Eulerian subgraph of 2G that has at most 1.5 times the weight of an optimal TSP solution of G. Based on this algorithm and a novel use of orientations in graphs, we obtain a (3β/4 + 3β/4)-approximation algorithm for TSP with β-relaxed triangle inequality (β-TSP), where β ≥ 1....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinear Analysis
سال: 2020
ISSN: 0362-546X
DOI: 10.1016/j.na.2020.111965