A primal-dual integral method in global optimization

Jens Hichert; Armin Hoffmann; Huan Xoang Phú; Rüdiger Reinhardt

Displaying similar documents to “A primal-dual integral method in global optimization”

Bounds on the global offensive k-alliance number in graphs

Mustapha Chellali, Teresa W. Haynes, Bert Randerath, Lutz Volkmann (2009)

Discussiones Mathematicae Graph Theory

Similarity:

Let G = (V(G),E(G)) be a graph, and let k ≥ 1 be an integer. A set S ⊆ V(G) is called a global offensive k-alliance if |N(v)∩S| ≥ |N(v)-S|+k for every v ∈ V(G)-S, where N(v) is the neighborhood of v. The global offensive k-alliance number $γ ₒ^{k} (G)$ is the minimum cardinality of a global offensive k-alliance in G. We present different bounds on $γ ₒ^{k} (G)$ in terms of order, maximum degree, independence number, chromatic number and minimum degree.

Locally Lipschitz vector optimization with inequality and equality constraints

Ivan Ginchev, Angelo Guerraggio, Matteo Rocca (2010)

Applications of Mathematics

Similarity:

The present paper studies the following constrained vector optimization problem: ${min}_{C} f (x)$ , $g (x) \in - K$ , $h (x) = 0$ , where $f : ℝ^{n} \to ℝ^{m}$ , $g : ℝ^{n} \to ℝ^{p}$ are locally Lipschitz functions, $h : ℝ^{n} \to ℝ^{q}$ is $C^{1}$ function, and $C \subset ℝ^{m}$ and $K \subset ℝ^{p}$ are closed convex cones. Two types of solutions are important for the consideration, namely $w$ -minimizers (weakly efficient points) and $i$ -minimizers (isolated minimizers of order 1). In terms of the Dini directional derivative first-order necessary conditions for a point $x^{0}$ to be a $w$ -minimizer and first-order sufficient conditions...

Interior-point method for large-scale $l_{1}$ optimization

Lukšan, Ladislav, Matonoha, Ctirad, Vlček, Jan

Similarity:

Saddle point criteria for second order $η$ -approximated vector optimization problems

Anurag Jayswal, Shalini Jha, Sarita Choudhury (2016)

Kybernetika

Similarity:

The purpose of this paper is to apply second order $η$ -approximation method introduced to optimization theory by Antczak [2] to obtain a new second order $η$ -saddle point criteria for vector optimization problems involving second order invex functions. Therefore, a second order $η$ -saddle point and the second order $η$ -Lagrange function are defined for the second order $η$ -approximated vector optimization problem constructed in this approach. Then, the equivalence between an (weak) efficient solution...

Global Attractor for the Convective Cahn-Hilliard Equation in $H^{k}$

Xiaopeng Zhao, Ning Duan (2011)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

We consider the convective Cahn-Hilliard equation with periodic boundary conditions. Based on the iteration technique for regularity estimates and the classical theorem on existence of a global attractor, we prove that the convective Cahn-Hilliard equation has a global attractor in $H^{k}$ .

Fourier analysis, linear programming, and densities of distance avoiding sets in $ℝ^{n}$

Fernando Mário de Oliveira Filho, Frank Vallentin (2010)

Journal of the European Mathematical Society

Similarity:

We derive new upper bounds for the densities of measurable sets in $ℝ^{n}$ which avoid a finite set of prescribed distances. The new bounds come from the solution of a linear programming problem. We apply this method to obtain new upper bounds for measurable sets which avoid the unit distance in dimensions $2, \dots, 24$ . This gives new lower bounds for the measurable chromatic number in dimensions $3, \dots, 24$ . We apply it to get a short proof of a variant of a recent result of Bukh which in turn generalizes theorems...

Dynamics of a modified Davey-Stewartson system in ℝ³

Jing Lu (2016)

Colloquium Mathematicae

Similarity:

We study the Cauchy problem in ℝ³ for the modified Davey-Stewartson system $i \partial ₜ u + Δ u = λ ₁ | u | ⁴ u + λ ₂ b ₁ u v_{x ₁}$ , $- Δ v = b ₂ {(| u | ²)}_{x ₁}$ . Under certain conditions on λ₁ and λ₂, we provide a complete picture of the local and global well-posedness, scattering and blow-up of the solutions in the energy space. Methods used in the paper are based upon the perturbation theory from [Tao et al., Comm. Partial Differential Equations 32 (2007), 1281-1343] and the convexity method from [Glassey, J. Math. Phys. 18 (1977), 1794-1797].

Attractor of a semi-discrete Benjamin-Bona-Mahony equation on ℝ¹

Chaosheng Zhu (2015)

Annales Polonici Mathematici

Similarity:

This paper is concerned with the study of the large time behavior and especially the regularity of the global attractor for the semi-discrete in time Crank-Nicolson scheme to discretize the Benjamin-Bona-Mahony equation on ℝ¹. Firstly, we prove that this semi-discrete equation provides a discrete infinite-dimensional dynamical system in H¹(ℝ¹). Then we prove that this system possesses a global attractor $_{τ}$ in H¹(ℝ¹). In addition, we show that the global attractor $_{τ}$ is regular, i.e., $_{τ}$ ...

Fractional global domination in graphs

Subramanian Arumugam, Kalimuthu Karuppasamy, Ismail Sahul Hamid (2010)

Discussiones Mathematicae Graph Theory

Similarity:

Let G = (V,E) be a graph. A function g:V → [0,1] is called a global dominating function (GDF) of G, if for every v ∈ V, $g (N [v]) = \sum_{u \in N [v]} g (u) \geq 1$ and $g (\bar{N (v)}) = \sum_{u \notin N (v)} g (u) \geq 1$ . A GDF g of a graph G is called minimal (MGDF) if for all functions f:V → [0,1] such that f ≤ g and f(v) ≠ g(v) for at least one v ∈ V, f is not a GDF. The fractional global domination number $γ_{f g} (G)$ is defined as follows: $γ_{f g} (G)$ = min|g|:g is an MGDF of G where $| g | = \sum_{v \in V} g (v)$ . In this paper we initiate a study of this parameter.

The Landau-Lifshitz equations and the damping parameter

K. Hamdache, M. Tilioua (2006)

Bollettino dell'Unione Matematica Italiana

Similarity:

The present paper is particularly devoted to the damping effect in ferromagnetic materials. We are interested in determining the sensitivity of the LLG method solution to the phenomenological damping parameter a. We discuss the behaviour of the global weak solutions with finite energy of the Landau-Lifshitz equations when the damping parameter a tends either to 0 (underdamped case) or $+\infty$ (overdamped case).

Global regularity for the 3D MHD system with damping

Zujin Zhang, Xian Yang (2016)

Colloquium Mathematicae

Similarity:

We study the Cauchy problem for the 3D MHD system with damping terms ${ε | u |}^{α - 1} u$ and ${δ | b |}^{β - 1} b$ (ε, δ > 0 and α, β ≥ 1), and show that the strong solution exists globally for any α, β > 3. This improves the previous results significantly.

Large data local solutions for the derivative NLS equation

Ioan Bejenaru, Daniel Tataru (2008)

Journal of the European Mathematical Society

Similarity:

We consider the derivative NLS equation with general quadratic nonlinearities. In [2] the first author has proved a sharp small data local well-posedness result in Sobolev spaces with a decay structure at infinity in dimension $n = 2$ . Here we prove a similar result for large initial data in all dimensions $n \geq 2$ .

On weak sharp minima for a special class of nonsmooth functions

Marcin Studniarski (2000)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

Similarity:

We present a characterization of weak sharp local minimizers of order one for a function f: ℝⁿ → ℝ defined by $f (x) : = m a x f_{i} (x) | i = 1, . . ., p$ , where the functions $f_{i}$ are strictly differentiable. It is given in terms of the gradients of $f_{i}$ and the Mordukhovich normal cone to a given set on which f is constant. Then we apply this result to a smooth nonlinear programming problem with constraints.

Optimal potentials for Schrödinger operators

Giuseppe Buttazzo, Augusto Gerolin, Berardo Ruffini, Bozhidar Velichkov (2014)

Journal de l’École polytechnique — Mathématiques

Similarity:

We consider the Schrödinger operator $- Δ + V (x)$ on $H_{0}^{1} (Ω)$ , where $Ω$ is a given domain of $ℝ^{d}$ . Our goal is to study some optimization problems where an optimal potential $V \geq 0$ has to be determined in some suitable admissible classes and for some suitable optimization criteria, like the energy or the Dirichlet eigenvalues.

Linearization techniques for $𝕃^{\infty}$ See PDF-control problems and dynamic programming principles in classical and $𝕃^{\infty}$ See PDF-control problems

Dan Goreac, Oana-Silvia Serea (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

The aim of the paper is to provide a linearization approach to the $𝕃^{\infty}$ See PDF-control problems. We begin by proving a semigroup-type behaviour of the set of constraints appearing in the linearized formulation of (standard) control problems. As a byproduct we obtain a linear formulation of the dynamic programming principle. Then, we use the $𝕃^{p}$ See PDF approach and the associated linear formulations. This seems to be the most appropriate tool for treating $𝕃^{\infty}$ See PDF problems in continuous and...

Divergent solutions to the 5D Hartree equations

Daomin Cao, Qing Guo (2011)

Colloquium Mathematicae

Similarity:

We consider the Cauchy problem for the focusing Hartree equation $i u_{t} + Δ u + {(| \cdot |}^{- 3} * | u | ²) u = 0$ in ℝ⁵ with initial data in H¹, and study the divergence property of infinite-variance and nonradial solutions. For the ground state solution of $- Q + Δ Q + (| \cdot |^{- 3} * | Q | ²) Q = 0$ in ℝ⁵, we prove that if u₀ ∈ H¹ satisfies M(u₀)E(u₀) < M(Q)E(Q) and ||∇u₀||₂||u₀||₂ > ||∇Q||₂||Q||₂, then the corresponding solution u(t) either blows up in finite forward time, or exists globally for positive time and there exists a time sequence tₙ → ∞ such that ||∇u(tₙ)||₂...

The general methods of finding the sum $S_{n}$ for all kinds of series

K. Orlov (1981)

Matematički Vesnik

Similarity:

Seasonal time-series imputation of gap missing algorithm (STIGMA)

Eduardo Rangel-Heras, Pavel Zuniga, Alma Y. Alanis, Esteban A. Hernandez-Vargas, Oscar D. Sanchez (2023)

Kybernetika

Similarity:

This work presents a new approach for the imputation of missing data in weather time-series from a seasonal pattern; the seasonal time-series imputation of gap missing algorithm (STIGMA). The algorithm takes advantage from a seasonal pattern for the imputation of unknown data by averaging available data. We test the algorithm using data measured every $10$ minutes over a period of $365$ days during the year 2010; the variables include global irradiance, diffuse irradiance, ultraviolet irradiance,...

Global solvability in the parabolic-elliptic chemotaxis system with singular sensitivity and logistic source

Xiangdong Zhao (2024)

Czechoslovak Mathematical Journal

Similarity:

We study the chemotaxis system with singular sensitivity and logistic-type source: $u_{t} = Δ u - χ \nabla \cdot (u \nabla v / v) + r u - μ u^{k}$ , $0 = Δ v - v + u$ under the non-flux boundary conditions in a smooth bounded domain $Ω \subset ℝ^{n}$ , $χ, r, μ > 0$ , $k > 1$ and $n \geq 1$ . It is shown with $k \in (1, 2)$ that the system possesses a global generalized solution for $n \geq 2$ which is bounded when $χ > 0$ is suitably small related to $r > 0$ and the initial datum is properly small, and a global bounded classical solution for $n = 1$ .