-
|
Is it possible to solve non-convex optimization problems (such as this one) using SCP (Sequential Convex Programming). In the paper, they used an algorithm (algorithm 1) presented in another paper. |
Beta Was this translation helpful? Give feedback.
Answered by
svigerske
Jan 25, 2023
Replies: 1 comment
-
|
Ipopt implements an interior point algorithm only. There are no plans to add other, significantly different, algorithms. |
Beta Was this translation helpful? Give feedback.
0 replies
Answer selected by
svigerske
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Ipopt implements an interior point algorithm only. There are no plans to add other, significantly different, algorithms.