[Ipopt] Non-convex Objective that is Convex on a (Convex) Feasible Region

[Victor Wu]

Hello,

I have a nonlinear problem where the objective function is non-convex in
general, but is convex over the (convex) feasible region of interest (thus,
theoretically I have a convex problem).  Do you have any recommendations on
how I should represent the objective (i.e., write the objective in its
original non-convex form and enforce my feasible region or do something
else) in IpOpt?  My concern is whether IpOpt would reach the
*theoretically* global minimizer and if it depends on my implementation.

Thank you,
Victor Wu
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/ipopt/attachments/20160912/4132f9d3/attachment.html>