Timeline for Nelder-Mead optimization in C++
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 18, 2022 at 20:04 | comment | added | G. Sliepen | @JDługosz Yes. In fact, if you'd pass a lambda or any other invocable then without inlining it would be very inefficient as well. | |
| Jan 18, 2022 at 14:51 | comment | added | JDługosz | @G.Sliepen all of the new range-based algorithms take this "projection" argument, which saves code. Since it's now part of the standard, I would think the compiler's optimizers would be sure to handle these, at least in the specific form that the standard library has them. | |
| Jan 15, 2022 at 7:42 | comment | added | Deduplicator | True, if it is all inlined, and considering it is the only time it is called with that signature in the program, it is virtually guaranteed, it will be fine. | |
| Jan 15, 2022 at 7:25 | comment | added | G. Sliepen | @Deduplicator I'm assuming it will be inlined? | |
| Jan 15, 2022 at 2:28 | comment | added | Deduplicator | Correct me if I'm wrong, but isn't the use of a member-pointer quite inefficient? | |
| Jan 15, 2022 at 0:25 | history | edited | G. Sliepen | CC BY-SA 4.0 |
added 445 characters in body
|
| Jan 15, 2022 at 0:17 | history | answered | G. Sliepen | CC BY-SA 4.0 |