Dual quadratic estimates in polynomial and Boolean programming
From MaRDI portal
Publication:1173717
DOI10.1007/BF02283692zbMath0783.90081MaRDI QIDQ1173717
Publication date: 25 June 1992
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items
On Convex Hulls of Epigraphs of QCQPs, On the tightness of SDP relaxations of QCQPs, A review on algorithms for maximum clique problems, A relaxation method for nonconvex quadratically constrained quadratic programs, Fixed interval scheduling: models, applications, computational complexity and algorithms, On linear programming relaxations for solving polynomial programming problems, A global optimization framework for distributed antenna location in CDMA cellular networks, \(\alpha BB\): A global optimization method for general constrained nonconvex problems, New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems, Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality, Global optimization of bilinear programs with a multiparametric disaggregation technique, Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, Reduced RLT representations for nonconvex polynomial programming problems, Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts, Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs, A guide to conic optimisation and its applications, Constructing test functions for global optimization using continuous formulations of graph problems, Coherent quantum LQG control, A new algorithm for concave quadratic programming, Second order cone programming relaxation of nonconvex quadratic optimization problems, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming, On Conic Relaxations of Generalization of the Extended Trust Region Subproblem, The maximum clique problem, Primal-relaxed dual global optimization approach
Cites Work
