-
### Team Name:
Quantastox
### Project Description:
Almost everyone knows about stocks, and many take their well-earned money to invest in the ones they feel may be profitable. Through utili…
-
**Issue by [bob-carpenter](https://github.com/bob-carpenter)**
_Tuesday Feb 20, 2018 at 21:22 GMT_
_Originally opened as https://github.com/stan-dev/stan/issues/2473_
----
#### Summary:
Add an o…
-
My main use-case for this is benchmarking Optim. This package currently allows the user to solve a `CUTEst.jl` problem. Do you, @timholy , also see the scope containing the examples we have in the pro…
-
When there is no active set present in a problem and the CUDA backend tries to perform the polishing step, there is a NULL pointer error thrown by CUDA:
```
Filters: test_no_active_set
------------…
-
1.How to set M? Do I need to keep M?
2.The second question is, why can't I find the minimum using Newton's method? Is it because the problem is more complicated?
-
When solving an unconstrained problem with the CUDA backend with polishing enabled, there is a NULL pointer error when doing a matrix-vector multiplication:
```
Filters: test_unconstrained
--------…
-
The reason for the `p` in the optimization problem definition is to allow for ChainRules support. Specifically:
https://arxiv.org/abs/1804.05098
https://web.stanford.edu/~boyd/papers/pdf/diff_cvxp…
-
```
== Current refinement ==
Refinement generates potential splits and then tries to choose the best one.
For the latter, it checks if the split globally resolves the invariant
violation (e.g., th…
-
Hi,
I'm trying to solve a robust optimization problem in which the uncertain variable is a unit vector. When I run `optimize`, I get an error message that says `Report bug in problem classification…
-
topic: computationally cheap tools
McFadden reference here
https://github.com/statsmodels/statsmodels/issues/2637#issuecomment-145311645
also points out one-step estimators, similar to Davidson and M…