Results 21 to 30 of about 173 (143)
A computational comparison of some branch and bound methods for indefinite quadratic programs
Quadratic programming, Branch and bound, d.c. decomposition, 90C20, 90C26, 90C31, C61, C63,
Riccardo Cambini +3 more
core +1 more source
A bounded degree SOS hierarchy for polynomial optimization
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
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
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
Geometric fit of a point set by generalized circles [PDF]
Circle location, Dimensional facility, Minisum, Polyhedral norms, 62J02, 65D10, 90C26, 90B85, 97N50,
Jack Brimberg +9 more
core +1 more source
It is of strong theoretical significance and application prospects to explore three-block nonconvex optimization with nonseparable structure, which are often modeled for many problems in machine learning, statistics, and image and signal processing.
Zhao Ying, Lan Heng-you, Xu Hai-yang
doaj +1 more source
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
A New Filled Function for Global Optimization
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
Optimality Conditions Characterizing Approximate Solutions for DC Composite Programs
This paper concerns DC composite optimization problems with conic constraints. By virtue of epigraph of conjugate functions, we introduce some new regularity conditions. Under the new regularity conditions, we give some necessary optimality conditions for ε‐optimal solutions, global optimal solutions, and local optimal solutions by using the ε ...
Gang Li, Qiqiong Chen, Smritijit Sen
wiley +1 more source
Portfolio selection, Downside risk, DC programming, DCA, Branch-and-Bound, 90C11, 90C26, 91B28,
Moeini, Mahdi +6 more
core +1 more source

