Displaying similar documents to “Unified global optimality conditions for smooth minimization problems with mixed variables”

New technique for solving univariate global optimization

Djamel Aaid, Amel Noui, Mohand Ouanes (2017)

Archivum Mathematicum

Similarity:

In this paper, a new global optimization method is proposed for an optimization problem with twice differentiable objective function a single variable with box constraint. The method employs a difference of linear interpolant of the objective and a concave function, where the former is a continuous piecewise convex quadratic function underestimator. The main objectives of this research are to determine the value of the lower bound that does not need an iterative local optimizer. The...

On semidefinite bounds for maximization of a non-convex quadratic objective over the unit ball

Mustafa Ç. Pinar, Marc Teboulle (2006)

RAIRO - Operations Research

Similarity:

We consider the non-convex quadratic maximization problem subject to the unit ball constraint. The nature of the norm structure makes this problem extremely hard to analyze, and as a consequence, the same difficulties are encountered when trying to build suitable approximations for this problem by some tractable convex counterpart formulations. We explore some properties of this problem, derive SDP-like relaxations and raise open questions.

A Mixed Integer Quadratic Programming Model for the Low Autocorrelation Binary Sequence Problem

Kratica, Jozef (2012)

Serdica Journal of Computing

Similarity:

In this paper the low autocorrelation binary sequence problem (LABSP) is modeled as a mixed integer quadratic programming (MIQP) problem and proof of the model’s validity is given. Since the MIQP model is semidefinite, general optimization solvers can be used, and converge in a finite number of iterations. The experimental results show that IQP solvers, based on this MIQP formulation, are capable of optimally solving general/skew-symmetric LABSP instances of up to 30/51 elements in a...

Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations

Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau (2008)

RAIRO - Operations Research

Similarity:

Many combinatorial optimization problems can be formulated as the minimization of a 0–1 quadratic function subject to linear constraints. In this paper, we are interested in the exact solution of this problem through a two-phase general scheme. The first phase consists in reformulating the initial problem either into a compact mixed integer linear program or into a 0–1 quadratic convex program. The second phase simply consists in submitting the reformulated problem to a standard solver....