| Algorithm 1 Adam | |
| Input: —initial solution, , , —learning step sizes, | |
| 1. | set iteration number to 0 |
| 2. | initialize the and tensors filled with zeros |
| 3. | set |
| 4. | while the stop condition is not met do: |
| 5. | |
| 6. | |
| 7. | |
| 8. | |
| 9. | end loop |
| 10. | return |
| Algorithm 1 Adam | |
| Input: —initial solution, , , —learning step sizes, | |
| 1. | set iteration number to 0 |
| 2. | initialize the and tensors filled with zeros |
| 3. | set |
| 4. | while the stop condition is not met do: |
| 5. | |
| 6. | |
| 7. | |
| 8. | |
| 9. | end loop |
| 10. | return |