Timeline for Fredholm integral with functions constrained to [0;1]
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 17, 2015 at 19:17 | comment | added | Dirk | For some reason I confused $g$ and $f$. Of course $f$ should be the unknown… Corrected. | |
| Mar 17, 2015 at 19:16 | history | edited | Dirk | CC BY-SA 3.0 |
corrected variable names
|
| Mar 17, 2015 at 13:08 | vote | accept | Kurt | ||
| Mar 17, 2015 at 12:39 | comment | added | Kurt | Is the method still valid if the unknown is $f$? If yes, I will definitely take a look at that! Thank you Dirk! | |
| Mar 16, 2015 at 20:13 | comment | added | Dirk | The most simple thing that comes to mind is the projected gradient method, see my update. | |
| Mar 16, 2015 at 20:12 | history | edited | Dirk | CC BY-SA 3.0 |
added 361 characters in body
|
| Mar 16, 2015 at 20:03 | comment | added | Kurt | Thank you Dirk! I am indeed trying to use "least squares" i.e. minimization. Now, do you know any source of info about methods that make practical use of constraints on $g$ and $f$? | |
| Mar 16, 2015 at 19:59 | history | answered | Dirk | CC BY-SA 3.0 |