Decomposition methods for solving nonconvex quadratic programs via branch and bound
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6310870
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
- A computational comparison of some branch and bound methods for indefinite quadratic programs
- scientific article; zbMATH DE number 5630592
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
Cites work
- A decomposition method for global and local quadratic minimization
- A finite algorithm for a particular D.C. quadratic programming problem
- A finite algorithm for solving general quadratic problems
- A new algorithm for solving the general quadratic programming problem
- A note on the convergence of an algorithm for nonconvex programming problems
- An algorithm for global minimization of linearly constrained quadratic functions
- An algorithm for indefinite quadratic programming with convex constraints
- An algorithm for nonconvex programming problems
- An Algorithm for Separable Nonconvex Programming Problems
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- Global and local quadratic minimization
- Global minimization of indefinite quadratic problems
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- Maximization of A convex quadratic function under linear constraints
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
Cited in
(29)- Branch-and-bound decomposition approach for solving quasiconvex-concave programs
- Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Optimal portfolio deleveraging under market impact and margin restrictions
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming
- Global optimization method for linear multiplicative programming
- Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- GLOMIQO: global mixed-integer quadratic optimizer
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming
- On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
- scientific article; zbMATH DE number 6310870 (Why is no real title available?)
- Branch-and-bound approaches to standard quadratic optimization problems
- Solving linear multiplicative programs via branch-and-bound: a computational experience
- A graph-based decomposition method for convex quadratic optimization with indicators
- Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
- On a solution method in indefinite quadratic programming under linear constraints
- Properties of two DC algorithms in quadratic programming
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
- A branch and reduce approach for solving a class of low rank d.c. programs
- An accelerating algorithm for globally solving nonconvex quadratic programming
- Global maximization of a generalized concave multiplicative function
- A computational comparison of some branch and bound methods for indefinite quadratic programs
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
This page was built for publication: Decomposition methods for solving nonconvex quadratic programs via branch and bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q811889)
