Pages that link to "Item:Q1029700"
From MaRDI portal
The following pages link to Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700):
Displaying 50 items.
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- On the problem of packing spheres in a cube (Q2263331) (← links)
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
- Source localization using TDOA and FDOA measurements based on semidefinite programming and reformulation linearization (Q2278987) (← links)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- Template polyhedra and bilinear optimization (Q2322312) (← links)
- On the separation of split inequalities for non-convex quadratic integer programming (Q2339844) (← links)
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme (Q2355798) (← links)
- On subspace properties of the quadratically constrained quadratic program (Q2411152) (← links)
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (Q2423782) (← links)
- Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
- Valid constraints for the Point Packing in a Square problem (Q2446880) (← links)
- Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization (Q2448210) (← links)
- Quadratic optimization over a polyhedral cone (Q2515280) (← links)
- Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365) (← links)
- On indefinite quadratic optimization over the intersection of balls and linear constraints (Q2671444) (← links)
- A reformulation-linearization technique for optimization over simplices (Q2689826) (← links)
- New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations (Q2826815) (← links)
- On linear conic relaxation of discrete quadratic programs (Q2829559) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (Q2897305) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Linear programing relaxations for a strategic pricing problem in electricity markets (Q2968496) (← links)
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
- Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization (Q4634103) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration (Q4636381) (← links)
- Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
- Combining qualitative information and semi‐quantitative data for guaranteed invalidation of biochemical network models (Q4909338) (← links)
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs (Q4995063) (← links)
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
- Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming (Q5058050) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
- Adaptive computable approximation to cones of nonnegative quadratic functions (Q5169468) (← links)
- On the Composition of Convex Envelopes for Quadrilinear Terms (Q5244679) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
- Mathematical programming formulations for the alternating current optimal power flow problem (Q5918268) (← links)
- Mathematical programming formulations for the alternating current optimal power flow problem (Q5918757) (← links)
- Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← links)
- Using general triangle inequalities within quadratic convex reformulation method (Q6175568) (← links)
- A feasible method for general convex low-rank SDP problems (Q6573007) (← links)
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints (Q6618144) (← links)
- Random projections for semidefinite programming (Q6619767) (← links)
