Sufficient global optimality conditions for bivalent quadratic optimization
From MaRDI portal
Publication:702386
DOI10.1023/B:JOTA.0000042530.24671.80zbMath1091.90059MaRDI QIDQ702386
Publication date: 17 January 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
quadratic assignment problemglobal optimalitysufficient optimality conditionsQuadratic optimization with binary variables
Related Items
Global optimality conditions for nonconvex minimization problems with quadratic constraints, Optimality conditions and optimization methods for quartic polynomial optimization, Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems, Global optimality conditions for fixed charge quadratic programs, Optimality Conditions for the Minimization of Quadratic 0-1 Problems, The unconstrained binary quadratic programming problem: a survey, Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition, Sufficient global optimality conditions for weakly convex minimization problems, On zero duality gap in nonconvex quadratic programming problems, Global optimality conditions and optimization methods for quadratic assignment problems, Global optimality conditions for cubic minimization problems with cubic constraints, Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints, Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations, Global minimization of difference of quadratic and convex functions over box or binary constraints, Global optimality conditions and optimization methods for quadratic knapsack problems, Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators, Semidefinite program duals for separable polynomial programs involving box constraints, Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints, Global optimality conditions for some classes of optimization problems, Global optimality of quadratic minimization over symmetric polytopes, Unified global optimality conditions for smooth minimization problems with mixed variables, Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions, Optimality conditions in global optimization and their applications, Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems, Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints
Cites Work
- Conditions for global optimality. II
- Testing optimality for quadratic 0-1 problems
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- On Lagrangian Relaxation of Quadratic Matrix Constraints
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Convex Analysis
- A new bound for the quadratic assignment problem based on convex quadratic programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
