A branch and reduce approach for solving a class of low rank d.c. programs

Authors:
Riccardo Cambini;Francesca Salvi
Affiliations:
Department of Statistics and Applied Mathematics, Faculty of Economics, University of Pisa, Via Cosimo Ridolfi 10, 56124 Pisa, Italy;Department of Statistics and Applied Mathematics, Faculty of Economics, University of Pisa, Via Cosimo Ridolfi 10, 56124 Pisa, Italy
Venue:
Journal of Computational and Applied Mathematics
Year:
2009

Citing 17
Cited 1

DC programming: overview

Journal of Optimization Theory and Applications
On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems

SIAM Journal on Optimization
Solving a Class of Linearly Constrained Indefinite QuadraticProblems by D.C. Algorithms

Journal of Global Optimization
A Finite Algorithm for Global Minimization ofSeparable Concave Programs

Journal of Global Optimization
Portfolio optimization under D.C. transaction costs and minimal transaction unit constraints

Journal of Global Optimization
D.C. programming approach for multicommodity network optimization problems with step increasing cost functions

Journal of Global Optimization
Solving an Inverse Problem for an Elliptic Equation by d.c. Programming

Journal of Global Optimization
Global Optimization of Multiplicative Programs

Journal of Global Optimization
Decomposition Methods for Solving Nonconvex Quadratic Programs via Branch and Bound*

Journal of Global Optimization
A new efficient algorithm based on DC programming and DCA for clustering

Journal of Global Optimization
A continuous approach for the concave cost supply problem via DC programming and DCA

Discrete Applied Mathematics
Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming

Optimization Methods & Software - Mathematical programming in data mining and machine learning
Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function

Journal of Global Optimization
Discrete tomography by convex-concave regularization and D.C. programming

Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Outer approximation algorithms for canonical DC problems

Journal of Global Optimization
Approximate optimality conditions and stopping criteria in canonical DC programming

Optimization Methods & Software - DEDICATED TO PROFESSOR VLADIMIR F. DEMYANOV ON THE OCCASION OF HIS 70TH BIRTHDAY
Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems

Operations Research Letters

Low-complexity optimal discrete-rate spectrum balancing in digital subscriber lines

Signal Processing

Quantified Score

Hi-index	7.29

Visualization

Abstract

Various classes of d.c. programs have been studied in the recent literature due to their importance in applicative problems. In this paper we consider a branch and reduce approach for solving a class of d.c. problems. Seven partitioning rules are analyzed and some techniques aimed at improving the overall performance of the algorithm are proposed. The results of a computational experience are provided in order to point out the performance effectiveness of the proposed techniques.