An optimal bound for d. c. programs with convex constraints
From MaRDI portal
Publication:1396998
DOI10.1007/PL00003997zbMath1031.90050MaRDI QIDQ1396998
Publication date: 16 July 2003
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31)
Related Items (8)
A note on equity across groups in facility location ⋮ Location of a distribution center for a perishable product ⋮ Equity models in planar location ⋮ An algorithm for bounded-error identification of nonlinear systems based on DC functions ⋮ Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations ⋮ The hill detouring method for minimizing hinging hyperplanes functions ⋮ A branch and reduce approach for solving a class of low rank d.c. programs ⋮ Big segment small segment global optimization algorithm on networks
This page was built for publication: An optimal bound for d. c. programs with convex constraints
