Block linear majorants in quadratic 0–1 optimization
نویسندگان
چکیده
منابع مشابه
Block linear majorants in quadratic 0-1 optimization
A usual technique to generate upper bounds on the optimum of a quadratic 0-1 maximization problem is to consider a linear majorant (LM) of the quadratic objective function f and then solve the corresponding linear relaxation. Several papers have considered LMs obtained by termwise bounding, but the possibility of bounding groups of terms simultaneously does not appear to have been explored so ...
متن کاملAbout One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...
متن کاملbiaccessibility in quadratic julia sets
در این رساله برای چندجمله ای های درجه ی دوم با مجموعه ی ژولیای همبند موضعی; ثابت خواهیم کرد: اندازه برولین مجموعه نقاط از دو سو دست یافتنی در چندجمله ای های درجه دو برابر با صفر است مگر چندجمله ای چبی شف که برابر با یک است. و برای چندجمله ای های درجه دوم با نقاط ثابت خنثی غیر گویا ثابت خواهیم کرد: 1)هر نقطه ی از دو سو دست یافتنی در حالت زیگل نهایتا به نقطه ی بحرانی و در حالت کرمر به نقطه ث...
A linear programming reformulation of the standard quadratic optimization problem
The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO). It is NPhard, and contains the maximum stable set problem in graphs as a special case. In this note we show that the SQO problem may be reformulated as an (exponentially sized) linear program.
متن کاملGlobal Optimization for Solving Linear Non-Quadratic Optimal Control Problems
This paper presents a global optimization approach to solving linear non-quadratic optimal control problems. The main work is to construct a differential flow for finding a global minimizer of the Hamiltonian function over a Euclid space. With the Pontryagin principle, the optimal control is characterized by a function of the adjoint variable and is obtained by solving a Hamiltonian differentia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2003.09.007