On covering method for d.c. optimization.
The authors consider the problem to maximize a d.c. function \(f\) over a polytope \(X\). It is assumed that the decomposition of \(f\) into two convex functions is known, i.e. \(f(x)=f_1(x)+f_2(x)\) where \(f_1(x)\) is convex and \(f_2(x)\) is concave on an open set containing \(X\). If this problem is solved by a covering algorithm one may use the convex bounding functions \(k_i(x):=f_1(x)+(f_2(x_i)+ \xi_2(x_i)'(x-x_i))\) where \(\xi_2(x_i)\) is an arbitrary subgradient of \(f_2\) at \(x_i\). In this case the subproblem \(\max_{x \in X}\min_{1 \leq i \leq n}k_i(x)\) can be formulated as a convex maximization problem with linear constraints. For solving this subproblem power diagrams may be helpful. Computational results on 3 multidimensional test problems are reported.
- On solving a d.c. programming problem by a sequence of linear programs
- A branch and bound algorithm for solving a class of D-C programming
- Solving polyhedral d.c. optimization problems via concave minimization
- Conical partition algorithm for maximizing the sum of dc ratios
- scientific article; zbMATH DE number 4032473
- The design centering problem as a d.c. programming problem
- New global optimality conditions for nonsmooth DC optimization problems
- Single-facility huff location problems on networks
- Constrained, global optimization of unknown functions with Lipschitz continuous gradients
- Optimization of the norm of a vector-valued DC function and applications
- A new linearization method for generalized linear multiplicative programming
- On the norm of a dc function
This page was built for publication: On covering method for d.c. optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5928427)
