-
-
```
using DAQP
using JuMP
function main()
model = Model(DAQP.Optimizer)
@variable(model, x, Bin)
@variable(model, y, Bin)
@objective(model,Min, (2*x+y)^2)
println…
-
I did an naive attempt to implement the SQP algorithm, using the package NLOPT. I have pushed the branch "sqp".
To use the branch, please check if NLOPT is installed on your cluster and change the pa…
-
In https://doi.org/10.1006/jcph.2001.6750 Sandu describes a method to project a negative approximation back to the reaction simplex without sacrificing accuracy.
-
In GitLab by @AaBelov on Aug 19, 2016, 01:06
ICE uses quadratic programming to find abundances on each iteration. The current `lsei` method seems to be slow.
-
## Description of the issue
As described in https://github.com/OpenEnergyPlatform/ontology/issues/859 most of the individuals in the OEO are lacking a definition.
In addition the upper classes are…
Ludee updated
4 weeks ago
-
Hi,
I am having some issues when running the VarID2_Figure4.R.
I tried to reproduce the pipeline by using the same data. Because some data points were severely scattered, I deleted them.
After do…
ytLiz updated
5 months ago
-
Hi all,
Thanks for the hard work put into OSQP.
When using OSQP.jl from JuMP.jl to solve a quadratic programming problem, I find that OSQP does not satisfy the constraints that I require.
The…
-
How can i find the work "Safe Gaussian process-based MPC using efficient sampling within a sequential quadratic programming framework"? Does it published? @manish-pra @lahramon
-
$$
\min_x \ \frac{1}{2} x^T Q x + q^T x \ \ \ni Q >0 \ \textrm{(Convex)} \\ \ni Ax \leq b \\ \ni Cx = d
$$