Results 1 to 10 of about 19,699 (306)
The Constrained Crossing Minimization Problem [PDF]
, 1999 In this paper we consider the constrained crossing minimization problem defined as follows. Given a connected planar graph G = (V,E), a combinatorial embedding II(G) of G, and a set of pairwise distinct edges F ⊆ V × V, find a drawing of G′ = (V,E ∼ F) such that the combinatorial embedding II(G) of G is preserved and the number of edge crossings is ...
Petra Mutzel, Thomas Ziegler 0002
openaire +4 more sources
The Timetable Constrained Distance Minimization Problem [PDF]
Annals of Operations Research, 2006 We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be minimized. The problem consists of finding an optimal home-away assignment when the opponents of each team in each time slot are given.
Rasmus V. Rasmussen, Michael A. Trick
openaire +5 more sources
Eigenvalue analysis of constrained minimization problem for homogeneous polynomial [PDF]
Journal of Global Optimization, 2015 14 pages.
Liqun Qi, Song Y S, Song Yisheng
exaly +4 more sources
Journal of Inequalities and Applications, 2022 This paper first introduces a new iterative method for weak and strong convergence theorem to demonstrate the estimation potential for a fixed point of the cutter and the finite general split feasibility problem.
Kanyanee Saechou, Atid Kangtunyakarn
doaj +1 more source
European Journal of Mathematical Analysis, 2021 The purpose of this paper is to introduce a new iterative algorithm to approximate the fixed points of almost contraction mappings and generalized α-nonexpansive mappings.
Austine Efut Ofem +2 more
doaj +1 more source
On global minimizers for a mass constrained problem
Calculus of Variations and Partial Differential Equations, 2022 In any dimension $N \geq 1$, for given mass $m > 0$ and for the $C^1$ energy functional \begin{equation*} I(u):=\frac{1}{2}\int_{\mathbb{R}^N}|\nabla u|^2dx-\int_{\mathbb{R}^N}F(u)dx, \end{equation*} we revisit the classical problem of finding conditions on $F \in C^1(\mathbb{R},\mathbb{R})$ insuring that $I$ admits global minimizers on the mass ...
Louis Jeanjean, Sheng-Sen Lu
openaire +3 more sources
Gradient-Based Optimization Algorithm for Solving Sylvester Matrix Equation
Mathematics, 2022 In this paper, we transform the problem of solving the Sylvester matrix equation into an optimization problem through the Kronecker product primarily. We utilize the adaptive accelerated proximal gradient and Newton accelerated proximal gradient methods ...
Juan Zhang, Xiao Luo
doaj +1 more source
Constrained Minimization Problem for Image Restoration Based on Non-Convex Hybrid Regularization
IEEE Access, 2020 It is widely known that the classic total variation(TV) model has been proven to be very effective in preserving sharp edges. However, the TV model suffers from the staircase effects which produce blocking artifacts in the restored images. In this paper,
Jianguang Zhu +3 more
doaj +1 more source
Large N optimization for multi-matrix systems
Journal of High Energy Physics, 2022 In this work we revisit the problem of solving multi-matrix systems through numerical large N methods. The framework is a collective, loop space representation which provides a constrained optimization problem, addressed through master-field minimization.
Robert de Mello Koch +4 more
doaj +1 more source
An intermixed iteration for constrained convex minimization problem and split feasibility problem
Journal of Inequalities and Applications, 2019 In this paper, we first introduce the two-step intermixed iteration for finding the common solution of a constrained convex minimization problem, and also we prove a strong convergence theorem for the intermixed algorithm.
Kanyanee Saechou, Atid Kangtunyakarn
doaj +1 more source