Decomposition methods for solving nonconvex quadratic programs via branch and bound
From MaRDI portal
Publication:811889
DOI10.1007/s10898-004-6095-8zbMath1093.90034OpenAlexW2049974979MaRDI QIDQ811889
Claudio Sodini, Riccardo Cambini
Publication date: 23 January 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-004-6095-8
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31)
Related Items
An accelerating algorithm for globally solving nonconvex quadratic programming, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, GLOMIQO: global mixed-integer quadratic optimizer, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience, Solving linear multiplicative programs via branch-and-bound: a computational experience, Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints, Properties of two DC algorithms in quadratic programming, On a solution method in indefinite quadratic programming under linear constraints, Global maximization of a generalized concave multiplicative function, Linear convergence of a type of iterative sequences in nonconvex quadratic programming, 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, Optimal portfolio deleveraging under market impact and margin restrictions, Boundedness of a type of iterative sequences in two-dimensional quadratic programming, 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, Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set, Global optimization method for linear multiplicative programming
Cites Work
- Unnamed Item
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Global minimization of indefinite quadratic problems
- An algorithm for indefinite quadratic programming with convex constraints
- A finite algorithm for solving general quadratic problems
- Global and local quadratic minimization
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- An algorithm for global minimization of linearly constrained quadratic functions
- A decomposition method for global and local quadratic minimization
- A finite algorithm for a particular D.C. quadratic programming problem
- A new algorithm for solving the general quadratic programming problem
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- A note on the convergence of an algorithm for nonconvex programming problems
- An algorithm for nonconvex programming problems
- Maximization of A convex quadratic function under linear constraints
- An Algorithm for Separable Nonconvex Programming Problems
