How fast does the solver find a local optimal solution for a large-scale mixed-integer nonlinear optimization?

24 views

Skip to first unread message

Shuai Lu

unread,

Jul 20, 2019, 7:02:20 AM7/20/19

to YALMIP

For a large scale MINLP problem, about hundreds of thousands of variables, if I have a feasible solution, is it fast for the solver to find a local optimal solution?

If I have no feasible solution, how likely can the solver find the local optimal solution? For example, IPOPT & BARON.

Reply all

Reply to author

Forward

0 new messages