Globally solving nonconvex quadratic programming problems via completely positive programming

DOI10.1007/s12532-011-0033-9zbMath1257.90065OpenAlexW2000923338MaRDI QIDQ1762459

Publication date: 27 November 2012

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-011-0033-9

zbMATH Keywords

global optimization branch-and-bound nonconvex quadratic programming copositive programming completely positive programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items

A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program, Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time, A successive linear approximation algorithm for the global minimization of a concave quadratic program, Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, An efficient global algorithm for a class of indefinite separable quadratic programs, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Exactness conditions for an SDP relaxation of the extended trust region problem, Robust Investment Management with Uncertainty in Fund Managers’ Asset Allocation, Cutting Plane Generation through Sparse Principal Component Analysis, A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity, A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints, A computational study on QP problems with general linear constraints, A new global algorithm for factor-risk-constrained mean-variance portfolio selection, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, (Global) optimization: historical notes and recent developments, A distributionally robust optimization approach for two-stage facility location problems, Outer-product-free sets for polynomial optimization and oracle-based cuts, An effective global algorithm for worst-case linear optimization under polyhedral uncertainty, Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints, An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints, Using general triangle inequalities within quadratic convex reformulation method, Effective algorithms for optimal portfolio deleveraging problem with cross impact, Domain reduction techniques for global NLP and MINLP optimization, Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization, On global optimization with indefinite quadratics, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, Solving Quadratic Programming by Cutting Planes, Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Global solution of non-convex quadratically constrained quadratic programs, A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, A new algorithm for concave quadratic programming, Penalized semidefinite programming for quadratically-constrained quadratic optimization, The CP-Matrix Approximation Problem, DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs, Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes, A binarisation heuristic for non-convex quadratic programming with box constraints, Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems, An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation, Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations, Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems, Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems, QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs, Compact mixed-integer programming formulations in quadratic optimization, Unnamed Item, Completely positive reformulations for polynomial optimization

Uses Software

Cites Work