Nonsmooth convex optimization—theory and solution methodology
Research Project, 1998
– 2026
In a long series of projects, we study nonsmooth convex optimization problems. The topics studied include theory -mathematical and related complexity properties-as well as methodology development and convergence analyses. The problems studied are composed by linear and/or nonlinear convex functions and polyhedral and/or general convex sets. In particular, we study Lagrangean dual reformulations of convex optimization problems and methodology for their solution.
We have developed and analyzed generalized subgradient optimization methods. Further, since (Lagrangean) dual subgradient schemes do not automatically produce primal feasible solutions, we construct - at minor cost - an ergodic sequence of primal subproblem solutions which is shown to converge to the primal solution set. We have further elaborated with the construction of the primal ergodic sequences, in order to increase the convergence speed.
Participants
An error has occured
Please contact an administrator and give the following data:
'Newtonsoft.Json.Linq.JValue' does not contain a definition for 'PersonRoleName_en'
at CallSite.Target(Closure, CallSite, Object) at System.Dynamic.UpdateDelegates.UpdateAndExecute1[T0,TRet](CallSite site, T0 arg0) at CallSite.Target(Closure, CallSite, Object) at ResearchWeb2024.Pages.Pages_Project.<>c.<ExecuteAsync>b__18_3(Object p) in C:\home\site\repository\ResearchWeb2024\Pages\Project.cshtml:line 369 at System.Linq.EnumerableSorter`2.ComputeKeys(TElement[] elements, Int32 count) at System.Linq.EnumerableSorter`1.ComputeMap(TElement[] elements, Int32 count) at System.Linq.OrderedEnumerable`1.GetEnumerator(Int32 minIdx, Int32 maxIdx)+MoveNext() at ResearchWeb2024.Pages.Pages_Project.ExecuteAsync() in C:\home\site\repository\ResearchWeb2024\Pages\Project.cshtml:line 369
Project Id: 6814