Sufficient global optimality conditions for bivalent quadratic optimization
From MaRDI portal
Recommendations
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
- New optimality conditions for quadratic optimization problems with binary constraints
- New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problems
- On sufficient global optimality conditions for bivalent quadratic programs with quadratic constraints
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
Cites work
- A new bound for the quadratic assignment problem based on convex quadratic programming
- Conditions for global optimality. II
- Convex Analysis
- Global optimality conditions for quadratic optimization problems with binary constraints
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 757673 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- On Lagrangian relaxation of quadratic matrix constraints
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- Testing optimality for quadratic 0-1 problems
Cited in
(31)- Optimality conditions in global optimization and their applications
- New optimality conditions for quadratic optimization problems with binary constraints
- An optimality criterion for global quadratic optimization
- Optimality conditions and optimization methods for quartic polynomial optimization
- Global optimality conditions for fixed charge quadratic programs
- Semidefinite program duals for separable polynomial programs involving box constraints
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
- Global optimality conditions for quadratic \(0-1\) optimization problems
- New sufficient global optimality conditions for linearly constrained bivalent quadratic optimization problems
- 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
- Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
- Global optimality conditions for nonconvex minimization problems with quadratic constraints
- Optimality conditions for the minimization of quadratic 0-1 problems
- On sufficient global optimality conditions for bivalent quadratic programs with quadratic constraints
- Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints
- Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators
- Unified global optimality conditions for smooth minimization problems with mixed variables
- 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
- Global optimality conditions and optimization methods for quadratic assignment problems
- A filled function method for quadratic programs with binary constraints†
- Global optimality of quadratic minimization over symmetric polytopes
- Global optimality conditions and optimization methods for quadratic knapsack problems
- 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
This page was built for publication: Sufficient global optimality conditions for bivalent quadratic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702386)
