A branch and reduce approach for solving a class of low rank d.c. programs
From MaRDI portal
Publication:732158
DOI10.1016/j.cam.2009.07.053zbMath1176.90565OpenAlexW2067453315MaRDI QIDQ732158
Riccardo Cambini, Francesca Salvi
Publication date: 9 October 2009
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2009.07.053
Related Items (7)
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 branch and reduce approach for solving a class of low rank d.c. programs ⋮ A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Portfolio optimization under D.C. transaction costs and minimal transaction unit constraints
- D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
- A branch and reduce approach for solving a class of low rank d.c. programs
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- Handbook of test problems in local and global optimization
- Handbook of global optimization
- Optimization on low rank nonconvex structures
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- A finite algorithm for global minimization of separable concave programs
- An optimal bound for d. c. programs with convex constraints
- Global optimization of multiplicative programs
- On global optimality conditions and cutting plane algorithms
- Solving an inverse problem for an elliptic equation by d.c. programming
- Towards Tikhonov regularization of non-linear ill-posed problems: a dc programming approach
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- A branch and bound algorithm for solving a class of D-C programming
- A finite algorithm for a particular D.C. quadratic programming problem
- A branch-and-reduce approach to global optimization
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- DC programming: overview.
- Outer approximation algorithms for canonical DC problems
- Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function
- A new efficient algorithm based on DC programming and DCA for clustering
- A continuous approach for the concave cost supply problem via DC programming and DCA
- Discrete tomography by convex--concave regularization and D.C. programming
- A continuous DC programming approach to the strategic supply chain design problem from qualified partner set
- Approximate optimality conditions and stopping criteria in canonical DC programming
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
- An Algorithm for Separable Nonconvex Programming Problems
- State Constraints in Convex Control Problems of Bolza
- Convex analysis and global optimization
This page was built for publication: A branch and reduce approach for solving a class of low rank d.c. programs
