Pages that link to "Item:Q811889"
From MaRDI portal
The following pages link to Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889):
Displaying 18 items.
- 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)
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming (Q472338) (← links)
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (Q613323) (← links)
- Properties of two DC algorithms in quadratic programming (Q628748) (← links)
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
- An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
- Global maximization of a generalized concave multiplicative function (Q927239) (← links)
- A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints (Q945281) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Optimal portfolio deleveraging under market impact and margin restrictions (Q2240011) (← links)
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming (Q2260662) (← links)
- Global optimization method for linear multiplicative programming (Q2355349) (← links)
- Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set (Q2518117) (← links)
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
- Solving linear multiplicative programs via branch-and-bound: a computational experience (Q6060545) (← links)