- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
To the best of my understanding, the paper aims to construct an algorithm that has both proximal minimization elements and attraction basin hopping elements. I am sorry for the harsh review, but I have to say I stopped reading at Theorem 1, since the paper's text is simply extremely hard to follow. It uses notation before it is defined, and the notation is unclear and not obvious. It may be the case that I should have used AI to "parse through", but the point is that the paper should be readable to a human.
Critical strengths
None
Critical weaknesses
The entire paper is very hard to follow. Notation is either used before being defined, and even when defined, it is not obvious what it is. Examples:
- On line 107, the operator is used without being defined. It's impossible to understand at this stage what is the meaning of the potential and its relationship to the proximal operator w.r.t the solver . The attractor set is defined only on line 155, much later.
- On line 165, what does mean? Is it the closure or the complement? I can guess it's the closure, but if it's not, then the entire meaning of subsequent things changes.
- On line 172, Eq (5), what does mean? Is it the polar set? If so - this assumption seems unreasonably strong - so strong that it is not even obvious why it should even hold somewhere. Requires explanation.
- In Eq (7) you have M on both sides of the equation. It appears meaningless. I can't even understand what it means.
- On line 195, what does " does not \emph{see} ..." mean? is a point. It doesn't see anything. What does it mean?
- In Lemma 1, if is the closure, a projection of a point outside the set is going to be on the boundary. So if the set of attractors open, then this intersection is always empty. What kind of function satisfy this assumption? Why is it reasonable?
- In Equation (8), inside Theorem 1, what is ? You defined , but what does it mean to be indexed by ? In the same theorem, is computed but not used anywhere - why is it useful?
At this stage I stopped reading, since I was not able to understand even the beginning of the paper. I believe it requires a serious re-writing - the authors need to turn the set of equations, symbols, and notations, theorems and lemmas into something people can read. With well-defined concepts, and not a huge number of those. It requires a serious work of eliciting the essence and presenting it coherently.
I do have optimization background, and especially in proximal minimization, but not basin hopping. So I believe a large intended audience will not find any use for this paper before serious revisions.
Questions for authors
NA