Pages that link to "Item:Q1173717"
From MaRDI portal
The following pages link to Dual quadratic estimates in polynomial and Boolean programming (Q1173717):
Displaying 35 items.
- On the accuracy of dual bounds for quadratic extremum problems (Q380649) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- An approach to determining Shor's dual quadratic estimates (Q946744) (← links)
- Coherent quantum LQG control (Q963775) (← links)
- Dual estimates in multiextremal problems (Q1201906) (← links)
- The maximum clique problem (Q1318271) (← links)
- Primal-relaxed dual global optimization approach (Q1321372) (← links)
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems (Q1371947) (← links)
- Lagrangian bounds in multiextremal polynomial and discrete optimization problems (Q1598884) (← links)
- The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- A relaxation method for nonconvex quadratically constrained quadratic programs (Q1892602) (← links)
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems (Q1913605) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming (Q2026772) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- A global optimization framework for distributed antenna location in CDMA cellular networks (Q2399315) (← links)
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools (Q2418156) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Second order cone programming relaxation of nonconvex quadratic optimization problems (Q2770189) (← links)
- Nonsmooth optimization and dual bounds (Q3972976) (← links)
- An efficient method for obtaining sharp bounds for nonlinear boolean programming problems (Q4016776) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
- On Conic Relaxations of Generalization of the Extended Trust Region Subproblem (Q5214417) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
- Accelerated first-order methods for a class of semidefinite programs (Q6665390) (← links)
