Global optimality conditions for quadratic optimization problems with binary constraints
From MaRDI portal
Recommendations
- New optimality conditions for quadratic optimization problems with binary constraints
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
Cited in
(58)- 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
- Optimality conditions and optimization methods for quartic polynomial optimization
- Global optimality conditions for fixed charge quadratic programs
- Global optimal solution to quadratic discrete programming problem with inequality constraints
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- A new penalty parameter for linearly constrained 0--1 quadratic programming problems
- Global sufficient optimality conditions for a special cubic minimization problem
- Global optimality conditions for cubic minimization problem with box or binary constraints
- Semidefinite program duals for separable polynomial programs involving box constraints
- FGP approach to quadratically constrained multi-objective quadratic fractional programming with parametric functions
- Global optimality conditions for quadratic \(0-1\) optimization problems
- On characterization of maximal independent sets via quadratic optimization
- Sufficient global optimality conditions for weakly convex minimization problems
- 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
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- Discrete filled function method for discrete global optimization
- Lower bound improvement and forcing rule for quadratic binary programming
- Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
- Global optimality conditions for nonconvex minimization problems with quadratic constraints
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints
- Optimality conditions for the minimization of quadratic 0-1 problems
- 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
- scientific article; zbMATH DE number 6531344 (Why is no real title available?)
- Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators
- Unified global optimality conditions for smooth minimization problems with mixed variables
- Global optimality conditions for mixed nonconvex quadratic programs†
- Sufficient conditions for global optimality of semidefinite optimization
- The unconstrained binary quadratic programming problem: a survey
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
- On zero duality gap in nonconvex quadratic programming problems
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
- On duality gap in binary quadratic programming
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- Optimization methods for mixed integer weakly concave programming problems
- Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
- MARS as an alternative approach of Gaussian graphical model for biochemical networks
- A filled function method for quadratic programs with binary constraints†
- scientific article; zbMATH DE number 7112360 (Why is no real title available?)
- Global optimality of quadratic minimization over symmetric polytopes
- An efficient Lagrangian smoothing heuristic for max-cut
- Characterization of optimal points in binary convex quadratic programming
- Some algebraic methods for solving multiobjective polynomial integer programs
- Global optimality conditions and optimization methods for quadratic integer programming problems
- Global optimality conditions and optimization methods for quadratic knapsack problems
- A vectorized positive semidefinite penalty method for unconstrained binary quadratic programming
- Binary least squares: an algorithm for binary sparse signal recovery
- Sufficient global optimality conditions for bivalent quadratic optimization
- Global optimality conditions for cubic minimization problems with cubic constraints
- Global minimization of difference of quadratic and convex functions over box or binary constraints
- Global optimality conditions for some classes of optimization problems
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- A new branch and bound method with pretreatment for the binary quadratic programming
This page was built for publication: Global optimality conditions for quadratic optimization problems with binary constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706322)
