-
## 🚀 Feature
The option for constraint-aware optimization techniques within torch.optim. [Sequential Quadratic Programming](https://en.wikipedia.org/wiki/Sequential_quadratic_programming) is a very c…
-
This is more of a feature request.
We have a license (and Fortran source) for SNOPT. SNOPT would be a good option to have, because it is a sequential quadratic programming method (IPOPT is interio…
-
It would be good if there would be a set/sets that would allow to encode
that two specific nodes of a graph (modelled as a NxN boolean adjacency matrix)
are / are not reachable from one another.
…
-
![image](https://user-images.githubusercontent.com/108192034/193803773-8d1e32b5-ff5d-4ec0-8654-35334a4ae3d1.png)
Even if b=0, c=0 it is still a quadratic eqn .
so only condition a=0 is enough right?…
-
Hi All,
I am wondering if spark-tfocs solves a linear regression problem with linear constraints. i.e.
min ||Ax-b||_2^2
s.t. Ux
ghost updated
7 months ago
-
## Summary
I would like to make a request for Pyomo team to consider integrating the Mindopt solver into the Pyomo library.
### Description
The Mindopt solver has the following capabilit…
-
```
Allow Ceres Solver to deal with equality constraints using the augmented
lagrangian.
```
Original issue reported on code.google.com by `sameerag...@google.com` on 5 Mar 2013 at 9:03
-
Adaptive due to sub-algorithms
Адаптивність за рахунок під-алгоритмів
Implement a recursive O(n log n) sorting algorithm (e.g. quicksort or merge sort), and for small sub-array sizes use one of th…
-
I love an idea behind the project and I sure there are plenty of engineering problems new contributors might help with. Could you please add (or label) up-for-grab issues? Thank you!
-
I am trying to design a custom MPC to follow a trajectory. The cost function has the form of
(x-x_i)^T Q_i (x-x_i) + (u-u_i)^T R (u-u_i)
where the x_i is desired value at that point. Is this …
nag92 updated
2 years ago