Loading...
Please wait, while we are loading the content...
An Improved Spsa Algorithm for Stochastic Optimization with Bound Constraints
| Content Provider | Semantic Scholar |
|---|---|
| Author | Popovic, Dobrivoje Teel, Andrew R. Jankovic, Mrdjan J. |
| Copyright Year | 2005 |
| Abstract | Abstract We show that the Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm with projection may exhibit slow convergence in constrained stochastic optimization problems when the optimum is situated on the constraints. The cause of the slow convergence is a geometric interaction between the projection operator and the SPSA gradient estimate. The effect of this interaction can be described as “bouncing of iterates against the constraints.” We describe this on two low dimensional noise-free examples, and present a new algorithm that does not exhibit the bouncing effect and the consequent slow convergence. |
| Starting Page | 47 |
| Ending Page | 52 |
| Page Count | 6 |
| File Format | PDF HTM / HTML |
| DOI | 10.3182/20050703-6-CZ-1902.00360 |
| Volume Number | 38 |
| Alternate Webpage(s) | http://www.nt.ntnu.no/users/skoge/prost/proceedings/ifac2005/Fullpapers/01480.pdf |
| Alternate Webpage(s) | http://folk.ntnu.no/skoge/prost/proceedings/ifac2005/Fullpapers/01480.pdf |
| Alternate Webpage(s) | https://doi.org/10.3182/20050703-6-CZ-1902.00360 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
