On covering method for d.c. optimization.

DOI10.1023/A:1008366808825zbMath1039.90055OpenAlexW1570728672MaRDI QIDQ5928427

Rafael Blanquero, Emilio Carrizosa

Publication date: 2000

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008366808825

zbMATH Keywords

global optimizationcovering methodd.c. functionouter approximationpower diagram

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items

Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients ⋮ A new linearization method for generalized linear multiplicative programming ⋮ Single-facility huff location problems on networks ⋮ Optimization of the norm of a vector-valued DC function and applications ⋮ On the norm of a dc function ⋮ New global optimality conditions for nonsmooth DC optimization problems

This page was built for publication: On covering method for d.c. optimization.