On global optimization with indefinite quadratics
From MaRDI portal
Publication:1707078
DOI10.1007/s13675-016-0079-6zbMath1384.90075OpenAlexW2566647717MaRDI QIDQ1707078
Wendel Melo, Jon Lee, Márcia H. C. Fampa
Publication date: 28 March 2018
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-016-0079-6
difference of convex functionsglobal optimizationsemidefinite programmingindefinite quadraticeigendecompositionmixed-integer non-linear programming
Semidefinite programming (90C22) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Solving linear multiplicative programs via branch-and-bound: a computational experience, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming, A reformulation-linearization technique for optimization over simplices, Extensions on ellipsoid bounds for quadratic integer programming, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, Convexification of bilinear forms through non-symmetric lifting, On Robust Solutions to Uncertain Linear Complementarity Problems and their Variants, Parametric convex quadratic relaxation of the quadratic knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- In situ column generation for a cutting-stock problem
- A new technique for generating quadratic programming test problems
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
- Globally solving nonconvex quadratic programming problems via completely positive programming
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A polyhedral branch-and-cut approach to global optimization
- Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
- DC programming: overview.
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- D.C. versus copositive bounds for standard QP
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- An Algorithmic Framework for MINLP with Separable Non-Convexity
- The MILP Road to MIQCP
- Branching and bounds tighteningtechniques for non-convex MINLP
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Special issue: Selected papers of the international workshop on global optimization, GO '99. Firenze, Italy, 1999
