-
Notifications
You must be signed in to change notification settings - Fork 8
Open
Description
I am interested in solving
where every function can be non-convex and
I wish to implement
- The convex and non-convex Basis-Pursuit problems:
$$min_x \lVert x \rVert_1$$ and$$min_x \lVert x \rVert_0$$ subject to$$Ax = b$$ : Add basis pursuit model #89. - The Low rank matrix completion problem
- The FH problem; this problem can be reformulated as
$$\min_x \int |u(x,t) - u_{obs}(t)|^2 dt + \lVert x \rVert_0 $$ subject to$$du/dt = F(t,u,x)$$ , we can usePDENLPModels.jlto model the smooth part of this problem.
Reactions are currently unavailable
Metadata
Metadata
Assignees
Labels
No labels