Results 21 to 30 of about 146 (138)
EURO Journal on Computational Optimization, 2020 The concept of leader-follower (or Stackelberg) equilibrium plays a central role in a number of real-world applications bordering on mathematical optimization and game theory.
Nicola Basilico +3 more
doaj +1 more source
Unsupervised and supervised data classification via nonsmooth and global optimization
, 2003 Clustering, classification, cluster function, nonsmooth optimization, global optimization, 65K05, 90C26, 90C30, 90C90,
A. Bagirov +7 more
core +1 more source
A bounded degree SOS hierarchy for polynomial optimization
EURO Journal on Computational Optimization, 2017 We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem (P):f∗=min{f(x):x∈K} on a compact basic semi-algebraic set K⊂Rn.
JeanB. Lasserre +2 more
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
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 +2 more
doaj +1 more source
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
EURO Journal on Computational Optimization, 2016 For many practical applications it is important to determine not only a numerical approximation of one but a representation of the whole set of globally optimal solutions of a non-convex optimization problem.
Gabriele Eichfelder +2 more
doaj +1 more source
A computational comparison of some branch and bound methods for indefinite quadratic programs
, 2008 Quadratic programming, Branch and bound, d.c. decomposition, 90C20, 90C26, 90C31, C61, C63,
Riccardo Cambini +3 more
core +1 more source
Geometric fit of a point set by generalized circles [PDF]
, 2010 Circle location, Dimensional facility, Minisum, Polyhedral norms, 62J02, 65D10, 90C26, 90B85, 97N50,
Jack Brimberg +9 more
core +1 more source
A new branch and bound algorithm for minimax ratios problems
Open Mathematics, 2017 This study presents an efficient branch and bound algorithm for globally solving the minimax fractional programming problem (MFP). By introducing an auxiliary variable, an equivalent problem is firstly constructed and the convex relaxation programming ...
Zhao Yingfeng, Liu Sanyang, Jiao Hongwei
doaj +1 more source