Apr 6, 2018 · We present an optimization method for Lipschitz continuous, piecewise smooth (PS) objective functions based on successive piecewise linearization.

The method's idea is to locate an optimum of a PS objective function by explicitly handling the kink structure at the level of piecewise linear models. This.

An algorithm for nonsmooth optimization by successive piecewise linearization · S. Fiege, A. Walther, A. Griewank · Published in Mathematical programming 6 April ...

Dec 8, 2016 · The method's idea is to locate an optimum of a PS objective function by explicitly handling the kink structure at the level of piecewise linear ...

Sep 1, 2019 · The method's idea is to locate an optimum of a PS objective function by explicitly handling the kink structure at the level of piecewise linear ...

Abstract. We present an optimization method for Lipschitz continuous, piecewise smooth (PS) objective functions based on successive piecewise linearization.

Dec 20, 2019 · Fiege, A. Walther, and A. Griewank. An algorithm for nonsmooth opti- mization by successive piecewise linearization. Mathematical Programming,.

An algorithm for nonsmooth optimization by successive piecewise linearization. Article 06 April 2018. Accelerating convergence of a globalized sequential ...

A function is smooth if it is differentiable and the derivatives are continuous. More specifically, this is first-order smoothness.

We present and analyze the solution of nonsmooth optimization problems by a quadratic overestimation method in a function space setting.