Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience

DOI10.1016/j.orl.2010.07.008zbMath1202.90212OpenAlexW2007120436MaRDI QIDQ613323

Riccardo Cambini, Francesca Salvi

Publication date: 20 December 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2010.07.008

zbMATH Keywords

nonconvex programmingbranch and boundd.c. programmings

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items

A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity ⋮ Global algorithm for solving linear multiplicative programming problems ⋮ Solving linear multiplicative programs via branch-and-bound: a computational experience ⋮ New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation ⋮ A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues

Cites Work

• Unnamed Item
• Unnamed Item
• Portfolio optimization under D.C. transaction costs and minimal transaction unit constraints
• Decomposition methods for solving nonconvex quadratic programs via branch and bound
• A computational comparison of some branch and bound methods for indefinite quadratic programs
• Handbook of test problems in local and global optimization
• Handbook of global optimization
• D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems
• A finite algorithm for global minimization of separable concave programs
• Global optimization of multiplicative programs
• A branch and bound algorithm for solving a class of D-C programming
• A finite algorithm for a particular D.C. quadratic programming problem
• Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
• DC programming: overview.
• On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
• An Algorithm for Separable Nonconvex Programming Problems
• Convex analysis and global optimization

This page was built for publication: Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience