Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
From MaRDI portal
Publication:2433932
Recommendations
- Global optimality conditions for nonconvex minimization problems with quadratic constraints
- Global minimization of difference of quadratic and convex functions over box or binary constraints
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- A sufficient conditions for global quadratic optimization
- CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
Cites work
- A note on diagonally dominant matrices
- Abstract convexity and global optimization
- Conditions for global optimality. II
- Constrained global optimization: algorithms and applications
- Construction of test problems in quadratic bivalent programming
- Global optimality conditions for quadratic optimization problems with binary constraints
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Handbook of global optimization
- scientific article; zbMATH DE number 994348 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1057696 (Why is no real title available?)
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- Primal-relaxed dual global optimization approach
- Sufficient global optimality conditions for bivalent quadratic optimization
Cited in
(40)- Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
- Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming
- New Kuhn-Tucker sufficiency for global optimality via convexification
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Optimality conditions and optimization methods for quartic polynomial optimization
- Global optimality conditions for fixed charge quadratic programs
- Global sufficient optimality conditions for a special cubic minimization problem
- Global optimality conditions for cubic minimization problem with box or binary constraints
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
- Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Sufficient global optimality conditions for weakly convex minimization problems
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- 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
- Global optimality conditions for quadratic optimization problems with binary constraints
- Optimality conditions for the minimization of quadratic 0-1 problems
- CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
- Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators
- Unified global optimality conditions for smooth minimization problems with mixed variables
- On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball
- Sufficient conditions for global optimality of semidefinite optimization
- On zero duality gap in nonconvex quadratic programming problems
- Global optimality conditions and optimization methods for quadratic assignment problems
- Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
- scientific article; zbMATH DE number 1057696 (Why is no real title available?)
- Optimization methods for mixed integer weakly concave programming problems
- Relaxing the optimality conditions of box QP
- On second-order optimality conditions for nonlinear programming
- Global optimality of quadratic minimization over symmetric polytopes
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization
- Global optimality conditions and optimization methods for quadratic knapsack problems
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- A note on sufficient global optimality conditions for fixed charge quadratic programs
- 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 non-convex quadratic minimization problems with box constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433932)