[Ipopt] solving non-smooth large scale problem using ipopt

Sebastian Nowozin nowozin at gmail.com
Fri May 8 10:57:40 EDT 2015

Hi Chivalry,

convex + non-smooth problems often originate from minimizing the maximum of
multiple smooth convex problems.

If this is the case in your instance, you can reformulate the problem by
introducing additional variables containing the individual objective
function values, and a set of inequality constraints.
The resulting instance is a smooth convex problem with convex constraints
and as such amenable using IpOpt.


On Fri, May 8, 2015 at 3:45 PM, key01023 at gmail.com <key01023 at gmail.com>

> Dear all,
> I have a large class of non smooth convex optimization problems with about
> 8000 dimensions and I am looking for c++ solvers to solve that. I tried
> level method  (extremely slow due to built up of sub-gradients), optimal
> gradient method due to Nesterov (very slow convergence), limited memory
> bundle method (LMBM) (no compilable solver available, failed to compile
> LMBM). I want to ask whether ipopt can be applied to solve this problem,
> because it uses limited memory BFGS which i guess somewhat resembles the
> LMBM methods. If so, is there some c++ file examples showing a case where
> we don’t need to provide the Hessian. Thank you.
> With regards,
> Chivalry
> _______________________________________________
> Ipopt mailing list
> Ipopt at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/ipopt
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/ipopt/attachments/20150508/e599bcd9/attachment.html>

More information about the Ipopt mailing list