Pages that link to "Item:Q2476994"
From MaRDI portal
The following pages link to A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994):
Displaying 50 items.
- A fixed point iterative approach to integer programming and its distributed computation (Q288180) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- A canonical dual approach for solving linearly constrained quadratic programs (Q439448) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- Nonlinear optimization problem of interdependent investment projects portfolio (Q507118) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- Detecting Braess paradox based on stable dynamics in general congested transportation networks (Q542093) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (Q683728) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← links)
- Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← links)
- A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- On global optimization with indefinite quadratics (Q1707078) (← links)
- A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
- Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← 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)
- Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- The exact solution of multiparametric quadratically constrained quadratic programming problems (Q2022221) (← links)
- Quadratic maximization of reachable values of affine systems with diagonalizable matrix (Q2032024) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
- An abstract model for branch-and-cut (Q2164714) (← links)
- Testing copositivity via mixed-integer linear programming (Q2226458) (← links)
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
- Optimal portfolio deleveraging under market impact and margin restrictions (Q2240011) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
