Quadratic maximization and semidefinite relaxation
From MaRDI portal
Publication:1575069
DOI10.1007/s101070050006zbMath1009.90080OpenAlexW2014793162MaRDI QIDQ1575069
Publication date: 14 August 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050006
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Credible autocoding of convex optimization algorithms, A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, Provable randomized rounding for minimum-similarity diversification, On the local stability of semidefinite relaxations, Approximation algorithms for homogeneous polynomial optimization with quadratic constraints, On solving biquadratic optimization via semidefinite relaxation, An entropy-regularized ADMM for binary quadratic programming, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, Lagrangian Duality in Complex Pose Graph Optimization, Approximation algorithms for indefinite complex quadratic maximization problems, On zero duality gap in nonconvex quadratic programming problems, Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications, Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation, Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations, Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization, Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods, Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, Unnamed Item, Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint, Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation, Penalized semidefinite programming for quadratically-constrained quadratic optimization, Frequency-hopping code design for Target detection via optimization theory, Convexity/Nonconvexity Certificates for Power Flow Analysis, Quadratic maximization of reachable values of affine systems with diagonalizable matrix, Lower-order penalization approach to nonlinear semidefinite programming, A novel formulation of the max-cut problem and related algorithm, Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems, On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball, Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem, A sequential quadratic penalty method for nonlinear semidefinite programming, A sequential quadratic penalty method for nonlinear semidefinite programming, Inhomogeneous polynomial optimization over a convex set: An approximation approach
