Optimality conditions for the minimization of quadratic 0-1 problems
From MaRDI portal
Publication:2945127
Recommendations
- Global optimality conditions for quadratic \(0-1\) optimization problems
- scientific article; zbMATH DE number 7112360
- New optimality conditions for quadratic optimization problems with binary constraints
- Sufficient global optimality conditions for bivalent quadratic optimization
- Global optimality conditions for quadratic optimization problems with binary constraints
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 757673 (Why is no real title available?)
- A duality principle for non-convex optimisation and the calculus of variations
- A filled function method for quadratic programs with binary constraints†
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Construction of test problems in quadratic bivalent programming
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Duality in nonconvex optimization
- Global minimization of difference of quadratic and convex functions over box or binary constraints
- Global optimality conditions for nonconvex optimization
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Global optimality conditions for quadratic optimization problems with binary constraints
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Handbook of test problems in local and global optimization
- Introduction to global optimization
- Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. I: Hyperplane theorems
- Minimization of continuous convex functional on complements of convex subsets of locally convex spaces1
- Necessary and sufficient global optimality conditions for convex maximization revisited
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Some further duality theorems for optimization problems with reverse convex constraint sets
- Sufficient global optimality conditions for bivalent quadratic optimization
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
Cited in
(10)- scientific article; zbMATH DE number 7112360 (Why is no real title available?)
- scientific article; zbMATH DE number 5533382 (Why is no real title available?)
- 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
- A filled function method for quadratic programs with binary constraints†
- New optimality conditions for quadratic optimization problems with binary constraints
- Global optimality conditions for quadratic \(0-1\) optimization problems
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
- Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs
- Testing optimality for quadratic 0?1 unconstrained problems
This page was built for publication: Optimality conditions for the minimization of quadratic \(0-1\) problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945127)
