A continuous approach for the concave cost supply problem via DC programming and DCA

Authors:
Hoai An Le Thi;Tao Pham Dinh
Affiliations:
Laboratory of Theoretical and Applied Computer Science de UFR MIM, University of Metz, Ile du Saulcy, 57045 Metz, France;Laboratory of Modelling, Optimization and Operations Research, National Institute for Applied Sciences, Place Emile Blondel, BP 8, 76 131 Mont Saint Aignan, France
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 5
Cited 5

A D. C. Optimization Algorithm for Solving the Trust-Region Subproblem

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

Journal of Global Optimization
Large-Scale Molecular Optimization from Distance Matrices by a D. C. Optimization Approach

SIAM Journal on 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
Binary tomography by iterating linear programs from noisy projections

IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis

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

Journal of Computational and Applied Mathematics
Recovering sparse signals with a certain family of nonconvex penalties and DC programming

IEEE Transactions on Signal Processing
DCA for minimizing the cost and tardiness of preventive maintenance tasks under real-time allocation constraint

ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Exact penalty and error bounds in DC programming

Journal of Global Optimization
Sparse high-dimensional fractional-norm support vector machine via DC programming

Computational Statistics & Data Analysis

Quantified Score

Hi-index	0.05

Visualization

Abstract

The paper addresses an important but difficult class of concave cost supply management problems which consist in minimizing a separable increasing concave objective function subject to linear and disjunctive constraints. We first recast these problems into mixed zero-one nondifferentiable concave minimization over linear constraints problems and then apply exact penalty techniques to state equivalent nondifferentiable polyhedral DC (Difference of Convex functions) programs. A new deterministic approach based on DC programming and DCA (DC Algorithms) is investigated to solve the latter ones. Finally numerical simulations are reported which show the efficiency, the robustness and the globality of our approach.