Timeline for Recursively Updating Initial Points for NMaximize Over a List
Current License: CC BY-SA 3.0
20 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 15, 2017 at 9:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 15, 2017 at 8:31 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 16, 2017 at 7:58 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 17, 2017 at 7:38 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 17, 2017 at 7:10 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 18, 2017 at 6:37 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 18, 2017 at 4:42 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 19, 2017 at 4:29 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 17, 2017 at 3:59 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 18, 2017 at 3:23 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 19, 2016 at 2:43 | history | edited | Michael E2 | CC BY-SA 3.0 |
Improved formatting
|
| Dec 19, 2016 at 2:13 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 7, 2016 at 11:09 | history | edited | Junaid Aftab | CC BY-SA 3.0 |
added 1281 characters in body
|
| Nov 6, 2016 at 15:40 | answer | added | Jack LaVigne | timeline score: 1 | |
| Nov 6, 2016 at 15:17 | comment | added | Jack LaVigne |
I have to leave on a trip and have run out of time. I think you could think of using FoldList, NestList or maybe Map to accomplish your goal. The first step I took was to define a function that returned the answer given bounds on the inputs and the index of the list DifferenceProbability2. fun[\[Alpha]Min_, \[Alpha]Max_, \[Chi]Min_, \[Chi]Max_, i_] := NMaximize[ {DifferenceProbability2[\[Alpha], \[Chi]][[i]], \[Alpha]Min <= \[Alpha] <= \[Alpha]Max, \[Chi]Min <= \[Chi] <= \[Chi]Max}, {\[Alpha], \[Chi]}, MaxIterations -> 1000, PrecisionGoal -> 5 ][[2]]
|
|
| Nov 6, 2016 at 10:31 | comment | added | Junaid Aftab | @JackLaVigne Done. | |
| Nov 6, 2016 at 10:31 | history | edited | Junaid Aftab | CC BY-SA 3.0 |
added 20943 characters in body
|
| Nov 5, 2016 at 23:02 | comment | added | Jack LaVigne |
Supplying the function DifferenceProbability2 will probably get you more help.
|
|
| Nov 5, 2016 at 19:26 | comment | added | Junaid Aftab | Why the downvote? Let me know how I can improve the question. | |
| Nov 5, 2016 at 18:56 | history | asked | Junaid Aftab | CC BY-SA 3.0 |