Optimality Conditions for the Minimization of Quadratic 0-1 Problems
From MaRDI portal
Publication:2945127
DOI10.1137/140968409zbMath1327.90163OpenAlexW1834447038MaRDI QIDQ2945127
Publication date: 9 September 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140968409
global optimizationquadratic programmingoptimality conditionlocal optimizationunconstrained binary quadratic problem
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items (2)
Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints ⋮ On the Complexity of Local Search in Unconstrained Quadratic Binary Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Sufficient global optimality conditions for bivalent quadratic optimization
- Global minimization of difference of quadratic and convex functions over box or binary constraints
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. I: Hyperplane theorems
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Some further duality theorems for optimization problems with reverse convex constraint sets
- Duality in nonconvex optimization
- A duality principle for non-convex optimisation and the calculus of variations
- Global optimality conditions for nonconvex optimization
- Handbook of test problems in local and global optimization
- Necessary and sufficient global optimality conditions for convex maximization revisited
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Introduction to global optimization
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Minimization of continuous convex functional on complements of convex subsets of locally convex spaces1
- Construction of test problems in quadratic bivalent programming
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- A filled function method for quadratic programs with binary constraints†
This page was built for publication: Optimality Conditions for the Minimization of Quadratic 0-1 Problems