Global optimality conditions for quadratic 0-1 optimization problems

Authors:
Wei Chen;Liansheng Zhang
Affiliations:
Department of Mathematics, Shanghai University, Shanghai, China 200444;Department of Mathematics, Shanghai University, Shanghai, China 200444
Venue:
Journal of Global Optimization
Year:
2010

Citing 15
Cited 3

Computational aspects of a branch and bound algorithm for quadratic zero-one programming

Computing
Role of copositivity in optimality criteria for nonconvex optimization problems

Journal of Optimization Theory and Applications
Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

Mathematical Programming: Series A and B
Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints

SIAM Journal on Optimization
Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints

SIAM Journal on Optimization
Global Optimality Conditions for Nonconvex Optimization

Journal of Global Optimization
Global Optimality Conditions in Maximizing a Convex Quadratic Function under Convex Quadratic Constraints

Journal of Global Optimization
Pseudo-boolean optimization

Discrete Applied Mathematics
Seizure warning algorithm based on optimization and nonlinear dynamics

Mathematical Programming: Series A and B
Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming

Computational Optimization and Applications
Sufficient Global Optimality Conditions for Non-convex Quadratic Minimization Problems With Box Constraints

Journal of Global Optimization
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions

Mathematical Programming: Series A and B
Novel formulations for the sequence selection problem in de novo protein design with flexible templates

Optimization Methods & Software - Systems Analysis, Optimization and Data Mining in Biomedicine
Global equilibrium search applied to the unconstrained binary quadratic optimization problem

Optimization Methods & Software

Global optimality conditions and optimization methods for quadratic integer programming problems

Journal of Global Optimization
Constructing uniform designs: A heuristic integer programming method

Journal of Complexity
On characterization of maximal independent sets via quadratic optimization

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the present work, we intend to derive conditions characterizing globally optimal solutions of quadratic 0-1 programming problems. By specializing the problem of maximizing a convex quadratic function under linear constraints, we find explicit global optimality conditions for quadratic 0-1 programming problems, including necessary and sufficient conditions and some necessary conditions. We also present some global optimality conditions for the problem of minimization of half-products.