Pages that link to "Item:Q810370"
From MaRDI portal
The following pages link to Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370):
Displaying 34 items.
- Global solutions to folded concave penalized nonconvex learning (Q282459) (← links)
- An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Relaxing the optimality conditions of box QP (Q538311) (← links)
- On the solution of generalized multiplicative extremum problems (Q635793) (← links)
- Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← 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 computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- A finite algorithm for solving general quadratic problems (Q1315437) (← links)
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms (Q1368737) (← links)
- An algorithm for global minimization of linearly constrained quadratic functions (Q1579950) (← links)
- A decomposition method for global and local quadratic minimization (Q1580439) (← links)
- On global optimization with indefinite quadratics (Q1707078) (← 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)
- 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)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
- The bounds of feasible space on constrained nonconvex quadratic programming (Q2469621) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
- Guaranteed \(\epsilon\)-approximate solution for indefinite quadratic global minimization (Q3491318) (← links)
- Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization (Q3565467) (← links)
- On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method (Q4888148) (← links)
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity (Q5084603) (← links)
- On Conic Relaxations of Generalization of the Extended Trust Region Subproblem (Q5214417) (← links)
