A branch and reduce approach for solving a class of low rank d.c. programs
type: Item
instance of: scholarly article
title: A branch and reduce approach for solving a class of low rank d.c. programs
zbMATH Open document ID: 1176.90565
author: Riccardo Cambini
author: Francesca Salvi
published in: Journal of Computational and Applied Mathematics
publication date: 2009-10-09T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 5612617
zbMATH Keywords: d.c. programming
zbMATH Keywords: branch and reduce
MaRDI profile type: Publication
full work available at URL: j.cam.2009.07.053
OpenAlex ID: W2067453315
cites work: Approximate optimality conditions and stopping criteria in canonical DC programming
cites work: Outer approximation algorithms for canonical DC problems
cites work: A finite algorithm for a particular D.C. quadratic programming problem
cites work: An optimal bound for d. c. programs with convex constraints
cites work: Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function
cites work: Handbook of test problems in local and global optimization
cites work: A branch and bound algorithm for solving a class of D-C programming
cites work: Handbook of global optimization
cites work: DC programming: overview.
cites work: Q3997222
cites work: Optimization on low rank nonconvex structures
cites work: Portfolio optimization under D.C. transaction costs and minimal transaction unit constraints
cites work: Global optimization of multiplicative programs
cites work: Discrete tomography by convex--concave regularization and D.C. programming
cites work: Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
cites work: Q5688514
cites work: On global optimality conditions and cutting plane algorithms
cites work: Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
cites work: A finite algorithm for global minimization of separable concave programs
cites work: An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
cites work: Towards Tikhonov regularization of non-linear ill-posed problems: a dc programming approach
cites work: A new efficient algorithm based on DC programming and DCA for clustering
cites work: A continuous DC programming approach to the strategic supply chain design problem from qualified partner set
cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
cites work: A continuous approach for the concave cost supply problem via DC programming and DCA
cites work: Solving an inverse problem for an elliptic equation by d.c. programming
cites work: Decomposition methods for solving nonconvex quadratic programs via branch and bound
cites work: An Algorithm for Separable Nonconvex Programming Problems
cites work: Convex analysis and global optimization
cites work: On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
cites work: A branch-and-reduce approach to global optimization
cites work: State Constraints in Convex Control Problems of Bolza
cites work: Q3738922
cites work: D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
DOI: 10.1016/J.CAM.2009.07.053
description: scientific article; zbMATH DE number 5612617