Combinatorial Problems -- 10. Other Models for Robust Optimization -- 11. Open Problems. …This book offers a self-contained introduction to the world of robust combinatorial optimization. It explores decision …-making using the min-max and min-max regret criteria, while also delving into the two-stage and recoverable robust optimization …

Introduction -- Primer of convex analysis -- Variational analysis -- Linear and nonlinear optimization problems … nonsmooth convex optimization over simple domains -- Bundle methods for nonsmooth convex optimization over simple domains … -- Methods for nonlinearly constrained nonsmooth optimization problems -- Methods for nonsmooth optimization with mixed …

computing the L1- median are available. Problem speci c algorithms can be used, but also general optimization routines. The aim … based on the optimization routine NLM (non- linear minimization) clearly outperforms other approaches. Its low computation …

, but also general optimization routines. The aim is to compare different algorithms with respect to their precision and … environment R. In most situations, the algorithm based on the optimization routine NLM (non-linear minimization) clearly …