Name
Title | ||
|---|---|---|
Objective-Domain Dual Decomposition: An Effective Approach to Optimizing Partially Differentiable Objective Functions. |
Abstract | ||
|---|---|---|
This paper addresses a class of optimization problems in which either part of the objective function is differentiable while the rest is nondifferentiable or the objective function is differentiable in only part of the domain. Accordingly, we propose a dual-decomposition-based approach that includes both objective decomposition and domain decomposition. In the former, the original objective functi... |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TCYB.2018.2870487 | IEEE Transactions on Cybernetics |
Keywords | Field | DocType |
Optimization,Linear programming,Search problems,Convergence,Heuristic algorithms,Cybernetics,Computer science | Convergence (routing),Mathematical optimization,Differentiable function,Linear programming,Domain decomposition methods,Cybernetics,Mathematics,Decomposition | Journal |
Volume | Issue | ISSN |
50 | 3 | 2168-2267 |
Citations | PageRank | References |
0 | 0.34 | 23 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yiu-ming Cheung | 1 | 1687 | 146.57 |
| Fangqing Gu | 2 | 42 | 4.03 |
| Hai-lin Liu | 3 | 668 | 52.80 |
| Kay Chen Tan | 4 | 2767 | 164.86 |
| han huang | 5 | 17 | 4.73 |