Pages that link to "Item:Q1092620"
From MaRDI portal
The following pages link to Global minimization of indefinite quadratic problems (Q1092620):
Displaying 33 items.
- An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230) (← links)
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
- Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
- A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming (Q1184526) (← links)
- On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
- Local minima for indefinite quadratic knapsack problems (Q1186274) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- An application of Lipschitzian global optimization to product design (Q1200528) (← links)
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints (Q1310977) (← links)
- A finite algorithm for solving general quadratic problems (Q1315437) (← links)
- Primal-relaxed dual global optimization approach (Q1321372) (← links)
- On global optimization with indefinite quadratics (Q1707078) (← links)
- Test problem construction for linear bilevel programming problems (Q1815062) (← links)
- A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems (Q1924614) (← links)
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs (Q2097634) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution (Q2424763) (← links)
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
- An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
- (Q3035144) (← links)
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems (Q3200891) (← links)
- Guaranteed \(\epsilon\)-approximate solution for indefinite quadratic global minimization (Q3491318) (← links)
- Global minimization of indefinite quadratic functions subject to box constraints (Q4697332) (← links)
- An algorithm for piece-wise indefinite quadratic programming problem (Q5147642) (← links)
- Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs (Q5148407) (← links)
