Optimality conditions for the minimization of quadratic 0-1 problems
DOI10.1137/140968409zbMATH Open1327.90163OpenAlexW1834447038MaRDI QIDQ2945127FDOQ2945127
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
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
quadratic programmingglobal optimizationoptimality conditionlocal optimizationunconstrained binary quadratic problem
Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global optimality conditions for nonconvex optimization
- Necessary and sufficient global optimality conditions for convex maximization revisited
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Global optimality conditions for quadratic optimization problems with binary constraints
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- 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
- Duality in nonconvex optimization
- A duality principle for non-convex optimisation and the calculus of variations
- Handbook of test problems in local and global optimization
- Introduction to global optimization
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Construction of test problems in quadratic bivalent programming
- Title not available (Why is that?)
- Minimization of continuous convex functional on complements of convex subsets of locally convex spaces1
- Some further duality theorems for optimization problems with reverse convex constraint sets
- Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. I: Hyperplane theorems
- A filled function method for quadratic programs with binary constraints†
Cited In (7)
- Title not available (Why is that?)
- Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs
- On the complexity of local search in unconstrained quadratic binary optimization
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
- Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints
- Title not available (Why is that?)
- 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)
