Pages that link to "Item:Q3563922"
From MaRDI portal
The following pages link to On Nonconvex Quadratic Programming with Box Constraints (Q3563922):
Displaying 40 items.
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Extended formulations for convex envelopes (Q486393) (← links)
- Relaxing the optimality conditions of box QP (Q538311) (← links)
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard (Q694182) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- On box-constrained total least squares problem (Q827567) (← links)
- Solution to nonconvex quadratic programming with both inequality and box constraints (Q833456) (← links)
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← links)
- A unified monotonic approach to generalized linear fractional programming (Q1422886) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- Convex and concave envelopes: revisited and new perspectives (Q1728297) (← links)
- A general solution to least squares problems with box constraints and its applications (Q1793094) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Quadratic optimization with switching variables: the convex hull for \(n=2\) (Q2044962) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- On the microeconomic foundations of linear demand for differentiated products (Q2397653) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
- On a box-constrained linear symmetric cone optimization problem (Q2420823) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
- Solutions and optimality criteria to box constrained nonconvex minimization problems (Q2469802) (← links)
- Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow (Q2689820) (← links)
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (Q2897305) (← links)
- Imposing symmetry in augmented linear systems (Q2948085) (← links)
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program (Q3105771) (← links)
- Box Constrained Quadratic Programming with Proportioning and Projections (Q4377570) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- (Q5158522) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps (Q6173797) (← links)
- Using general triangle inequalities within quadratic convex reformulation method (Q6175568) (← links)
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints (Q6618144) (← links)
