Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
From MaRDI portal
Publication:2706322
DOI10.1137/S1052623498336930zbMath0990.90089OpenAlexW2120889791MaRDI QIDQ2706322
Publication date: 19 March 2001
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623498336930
integer programmingoptimality conditionsnonconvex quadratic programmingnonconvex optimizationconvex dualitymax-cut problem
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Boolean programming (90C09)
Related Items
Global optimality conditions for nonconvex minimization problems with quadratic constraints, On characterization of maximal independent sets via quadratic optimization, Optimality conditions and optimization methods for quartic polynomial optimization, Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems, Sufficient conditions for global optimality of semidefinite optimization, 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, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, Some algebraic methods for solving multiobjective polynomial integer programs, Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables, A new penalty parameter for linearly constrained 0--1 quadratic programming problems, Global optimality conditions for cubic minimization problems with cubic constraints, Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints, An exact algorithm for linear integer programming problems with distributionally robust chance constraints, Global sufficient optimality conditions for a special cubic minimization problem, Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations, Global optimality conditions for cubic minimization problem with box or binary constraints, On duality gap in binary quadratic programming, Global optimality conditions and optimization methods for quadratic integer programming problems, Global minimization of difference of quadratic and convex functions over box or binary constraints, MARS as an alternative approach of Gaussian graphical model for biochemical networks, Global optimality conditions and optimization methods for quadratic knapsack problems, Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection, Optimization methods for mixed integer weakly concave programming 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, Discrete filled function method for discrete global optimization, Sufficient global optimality conditions for bivalent quadratic optimization, An efficient Lagrangian smoothing heuristic for max-cut, Global optimality of quadratic minimization over symmetric polytopes, Global optimality conditions for quadratic \(0-1\) optimization problems, Unified global optimality conditions for smooth minimization problems with mixed variables, Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions, A filled function method for quadratic programs with binary constraints†, A new branch and bound method with pretreatment for the binary quadratic programming, Lower bound improvement and forcing rule for quadratic binary programming, Global optimality conditions for mixed nonconvex quadratic programs†, Optimality conditions in global optimization and their applications, New Kuhn-Tucker sufficiency for global optimality via convexification, New optimality conditions for quadratic optimization problems with binary constraints, Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems, Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs, FGP approach to quadratically constrained multi-objective quadratic fractional programming with parametric functions, Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints, CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
