Results 11 to 20 of about 1,196 (82)

Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization [PDF]

, 2018
We extend the notion of Dubiner distance from algebraic to trigonometric polynomials on subintervals of the period, and we obtain its explicit form by the Szego variant of Videnskii inequality.
Vianello, Marco
core   +1 more source

Halpern-type proximal point algorithm in complete CAT(0) metric spaces

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
First, Halpern-type proximal point algorithm is introduced in complete CAT(0) metric spaces. Then, Browder convergence theorem is considered for this algorithm and also we prove that Halpern-type proximal point algorithm converges strongly to a zero of ...
Heydari Mohammad Taghi, Ranjbar Sajad
doaj   +1 more source

Using sentinels to detect intersections of convex and nonconvex polygons [PDF]

, 2010
We describe finite sets of points, called sentinels, which allow us to decide if isometric copies of polygons, convex or not, intersect. As an example of the applicability of the concept of sentinel, we explain how they can be used to formulate an ...
BIRGIN, E.G., MASCARENHAS, W.F.
core   +1 more source

Implementation of LDG method for 3D unstructured meshes

Revista de Matemática: Teoría y Aplicaciones, 2012
This paper describes an implementation of the Local Discontinuous Galerkin method (LDG) applied to elliptic problems in 3D. The implementation of the major operators is discussed.
Filander A. Sequeira Chavarría, Paul E. Castillo   +1 more
doaj   +1 more source

Polynomial Optimization with Real Varieties [PDF]

, 2013
We consider the optimization problem of minimizing a polynomial f(x) subject to polynomial constraints h(x)=0, g(x)>=0. Lasserre's hierarchy is a sequence of sum of squares relaxations for finding the global minimum. Let K be the feasible set.
Nie, Jiawang
core   +1 more source

A New Filled Function for Global Optimization

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023
The filled function method has recently become very popular in optimization theory, as it is an e cient and e ective method for finding the global minimizer of multimodal functions.
Şahiner Ahmet, Ermiş Temel, Awan Muhammad Wasim   +2 more
doaj   +1 more source

Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs

Open Mathematics, 2017
This paper presents a branch-delete-bound algorithm for effectively solving the global minimum of quadratically constrained quadratic programs problem, which may be nonconvex.
Hou Zhisong, Jiao Hongwei, Cai Lei, Bai Chunyang   +3 more
doaj   +1 more source

Strong convergence to a solution of the inclusion problem for a finite family of monotone operators in Hadamard spaces

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021
In this paper, in the setting of Hadamard spaces, a iterative scheme is proposed for approximating a solution of the inclusion problem for a finite family of monotone operators which is a unique solution of a variational inequality.
Ranjbar Sajad
doaj   +1 more source

A parametric linearizing approach for quadratically inequality constrained quadratic programs

Open Mathematics, 2018
In this paper we propose a new parametric linearizing approach for globally solving quadratically inequality constrained quadratic programs. By utilizing this approach, we can derive the parametric linear programs relaxation problem of the investigated ...
Jiao Hongwei, Chen Rongjiang
doaj   +1 more source

An effective algorithm for globally solving quadratic programs using parametric linearization technique

Open Mathematics, 2018
In this paper, we present an effective algorithm for globally solving quadratic programs with quadratic constraints, which has wide application in engineering design, engineering optimization, route optimization, etc.
Tang Shuai, Chen Yuzhen, Guo Yunrui
doaj   +1 more source