Algorithms for Nonsmooth, Nonconvex Optimization

  • Romain Dujol (Participant)

Activity: Participating in or organising an event typesParticipation in conference

Description

by Michael Overton There are many algorithms for minimization when the objective function is differentiable, convex, or has some other known structure, but few options when none of the above hold. We describe two simple algorithmic approaches for mini
Period1 Jul 2008
Event typeConference
LocationNamur, Facultes Universitaires Notre-Dame de la Paix, BelgiumShow on map