Solving piecewise linear systems in abs-normal form

@article{Griewank2015SolvingPL,
  title={Solving piecewise linear systems in abs-normal form},
  author={Andreas Griewank and Jens Uwe Bernt and Manuel Radons and Thomas Streubel},
  journal={Linear Algebra and its Applications},
  year={2015},
  volume={471},
  pages={500-530}
}

Figures and Tables from this paper

An algorithm for nonsmooth optimization by successive piecewise linearization
TLDR
It is shown that the new method when started from within a compact level set generates a sequence of iterates whose cluster points are all Clarke stationary, which illustrates the capabilities of the proposed approach.
Finite convergence of an active signature method to local minima of piecewise linear functions
TLDR
A new method is presented that computes a local minimizer of the proximal model objective, which is also known as criticality in nonsmooth optimization, and provides opportunities for structure exploitation like warm starts in the context of the nonlinear, outer loop.
(Almost) matrix‐free solver for piecewise linear functions in abs‐normal form
  • T. Bosse
  • Computer Science, Mathematics
    Numer. Linear Algebra Appl.
  • 2019
TLDR
The first (almost) matrix‐free versions of some solver for ANFs are presented and the question if a solver is based on the ANF and uses the (Schur‐complement) matrices of the explicit ANF representation, it has to be considered computationally expensive is addressed.
Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization
TLDR
This paper presents a minimization method for Lipschitz continuous, piecewise smooth objective functions based on algorithmic differentiation (AD), and presents corresponding drivers for the AD tool ADOL-C which are embedded in the nonsmooth solver LiPsMin.
On Lipschitz optimization based on gray-box piecewise linearization
TLDR
This work addresses the problem of minimizing objectives from the class of piecewise differentiable functions whose nonsmoothness can be encapsulated in the absolute value function and demonstrates how the local model can be minimized by a bundle-type method, which benefits from the availability of additional gray-box information via the abs-normal form.
Enumeration of subdifferentials of piecewise linear functions with abs-normal form
  • Koichi Kubota
  • Mathematics, Computer Science
    Optim. Methods Softw.
  • 2018
TLDR
A method for computing and enumerating the elements of the limiting subdifferential at a given non-differential point is described with branch and bound search and it is shown that there may be some cases in which computational work may be reduced using the branch and Bound search.
An Open Newton Method for Piecewise Smooth Functions
Recent research has shown that piecewise smooth (PS) functions can be approximated by piecewise linear functions with second order error in the distance to a given reference point. A semismooth
First- and second-order optimality conditions for piecewise smooth objective functions
TLDR
This work describes local optimality by first- and second-order necessary and sufficient conditions, which generalize the corresponding Kuhn-Tucker-Karush (KKT) theory for smooth problems and exemplifies the theory on two nonsmooth examples of Nesterov.
Direct solution of piecewise linear systems
  • Manuel Radons
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 2016
Integrating Lipschitzian dynamical systems using piecewise algorithmic differentiation
TLDR
A generalized trapezoidal rule is proposed for initial value problems with piecewise smooth right-hand side based on a generalization of algorithmic differentiation that can achieve a higher convergence order than with the classical method.
...
1
2
3
4
...

References

SHOWING 1-10 OF 32 REFERENCES
On stable piecewise linearization and generalized algorithmic differentiation
It is shown how functions that are defined by evaluation programs involving the absolute value function abs() (besides smooth elementals) can be approximated locally by piecewise-linear models in the
Using Piecewise Linear Functions for Solving MINLP s
TLDR
This chapter wants to demonstrate that in certain cases general mixed integer nonlinear programs (MINLPs) can be solved by just applying purely techniques from the mixed integer linear world, and to approximate the nonlinearities by piecewise linear functions.
Iterative Solution of Piecewise Linear Systems
TLDR
In the present paper a simple Newton-type procedure for certain piecewise linear systems is derived and shown to have a finite termination property, i.e., it converges to the exact solution in a finite number of steps.
Solution of Complementarity Problems via Piecewise Linearization
My master thesis concerns the solution linear complementarity problems (LCP). The Lemke algorithm, the most commonly used algorithm for solving a LCP until this day, was compared with the piecewise
Direct solution of piecewise linear systems
  • Manuel Radons
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 2016
On Iterative Solution for Linear Complementarity Problem with an H+-Matrix
TLDR
This work assumes that the real matrix of the LCP is an $H-matrix and solves it by using a new method, the scaled extrapolated block modulus algorithm, as well as an improved version of the very recently introduced modulus-based matrix splitting modified AOR iteration method.
Evaluating an element of the Clarke generalized Jacobian of a composite piecewise differentiable function
TLDR
Methods are developed for evaluating generalized Jacobian elements for a nonsmooth function that is expressed as a finite composition of known elemental piecewise differentiable functions.
Widely convergent method for finding multiple solutions of simultaneous nonlinear equations
A new method has been developed for solving a system of nonlinear equations g(x) = 0. This method is based on solving the related system of differential equations dg/dt±g(x)= 0 where in the sign is
Evaluating derivatives - principles and techniques of algorithmic differentiation, Second Edition
TLDR
This second edition has been updated and expanded to cover recent developments in applications and theory, including an elegant NP completeness argument by Uwe Naumann and a brief introduction to scarcity, a generalization of sparsity.
Lexicographic differentiation of nonsmooth functions
TLDR
It is shown that an appropriately defined lexicographic subdifferential ensures a more rigorous selection of a candidate optimal solution than the sub differential of Clarke.
...
1
2
3
4
...