Pages that link to "Item:Q2706322"
From MaRDI portal
The following pages link to Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints (Q2706322):
Displaying 50 items.
- Global optimality conditions for nonconvex minimization problems with quadratic constraints (Q265137) (← links)
- Sufficient conditions for global optimality of semidefinite optimization (Q371939) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition (Q415403) (← links)
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables (Q430937) (← links)
- On duality gap in binary quadratic programming (Q454277) (← links)
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- An efficient Lagrangian smoothing heuristic for max-cut (Q549567) (← links)
- Some algebraic methods for solving multiobjective polynomial integer programs (Q633078) (← links)
- Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← links)
- Global optimality conditions and optimization methods for quadratic knapsack problems (Q658556) (← links)
- Sufficient global optimality conditions for bivalent quadratic optimization (Q702386) (← links)
- Global optimality conditions for cubic minimization problems with cubic constraints (Q907371) (← links)
- Global minimization of difference of quadratic and convex functions over box or binary constraints (Q928298) (← links)
- Global optimality conditions for some classes of optimization problems (Q970570) (← links)
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions (Q985310) (← links)
- A new branch and bound method with pretreatment for the binary quadratic programming (Q990519) (← links)
- Optimality conditions in global optimization and their applications (Q1016343) (← links)
- New Kuhn-Tucker sufficiency for global optimality via convexification (Q1021733) (← links)
- New optimality conditions for quadratic optimization problems with binary constraints (Q1024733) (← links)
- Optimality conditions and optimization methods for quartic polynomial optimization (Q1646197) (← links)
- A new penalty parameter for linearly constrained 0--1 quadratic programming problems (Q1947625) (← links)
- Global sufficient optimality conditions for a special cubic minimization problem (Q1955308) (← links)
- Global optimality conditions for cubic minimization problem with box or binary constraints (Q1959231) (← links)
- Semidefinite program duals for separable polynomial programs involving box constraints (Q1985290) (← links)
- FGP approach to quadratically constrained multi-objective quadratic fractional programming with parametric functions (Q2085471) (← links)
- Global optimality conditions for quadratic \(0-1\) optimization problems (Q2269587) (← links)
- On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
- Sufficient global optimality conditions for weakly convex minimization problems (Q2426678) (← links)
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints (Q2433932) (← links)
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints (Q2471081) (← links)
- Discrete filled function method for discrete global optimization (Q2487474) (← links)
- Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
- Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems (Q2642150) (← links)
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
- Optimality Conditions for the Minimization of Quadratic 0-1 Problems (Q2945127) (← links)
- Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints (Q3430018) (← links)
- CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS (Q3439884) (← links)
- Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators (Q3553760) (← links)
- Unified global optimality conditions for smooth minimization problems with mixed variables (Q3598042) (← links)
- Global optimality conditions for mixed nonconvex quadratic programs† (Q3622005) (← links)
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection (Q4629340) (← links)
- Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems (Q4987691) (← links)
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs (Q4995063) (← links)
- MARS as an alternative approach of Gaussian graphical model for biochemical networks (Q5138750) (← links)
- A filled function method for quadratic programs with binary constraints† (Q5193139) (← links)
- Global optimality of quadratic minimization over symmetric polytopes (Q5426965) (← links)
