CSMO 2013: System Modeling and Optimization pp 327-336 | Cite as
Representation and Analysis of Piecewise Linear Functions in Abs-Normal Form
Conference paper
First Online:
Abstract
It follows from the well known min/max representation given by Scholtes in his recent Springer book, that all piecewise linear continuous functions \(y = F(x) : \mathbb {R}^n \rightarrow \mathbb {R}^m\) can be written in a so-called abs-normal form. This means in particular, that all nonsmoothness is encapsulated in \(s\) absolute value functions that are applied to intermediate switching variables \(z_i\) for \(i=1, \ldots ,s\). The relation between the vectors \(x, z\), and \(y\) is described by four matrices \(Y, L, J\), and \(Z\), such that This form can be generated by ADOL-C or other automatic differentation tools. Here \(L\) is a strictly lower triangular matrix, and therefore \( z_i\) can be computed successively from previous results. We show that in the square case \(n=m\) the system of equations \(F(x) = 0\) can be rewritten in terms of the variable vector \(z\) as a linear complementarity problem (LCP). The transformation itself and the properties of the LCP depend on the Schur complement \(S = L - Z J^{-1} Y\).
$$ \left[ \begin{array}{c} z \\ y \end{array}\right] = \left[ \begin{array}{c} c \\ b \end{array}\right] + \left[ \begin{array}{cc} Z &{} L \\ J &{} Y \end{array}\right] \left[ \begin{array}{c} x \\ |z |\end{array}\right] $$
Keywords
Piecewise linearization (PL) Algorithmic differentiation (AD) Equation solving Semi-smooth newton Smooth dominance Complementary piecewise linear system (CLP) Linear complementarity (LCP)References
- 1.van Bokhoven, W.M.G.: Piecewise-linear Modelling and Analysis. Kluwer Technische Boeken, The Netherlands (1981)Google Scholar
- 2.Brugnano, L., Casulli, V.: Iterative solution of piecewise linear systems. SIAM J. Sci. Comput. 30(1), 463–472 (2008). SIAMMathSciNetCrossRefMATHGoogle Scholar
- 3.Griewank, A., Walther, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. SIAM, Philadelphia (2008)CrossRefGoogle Scholar
- 4.Griewank, A.: On stable piecewise linearization and generalized algorithmic differentiation. Optim. Methods Softw. 28(6), 1139–1178 (2013)MathSciNetCrossRefMATHGoogle Scholar
- 5.Griewank, A., Bernt, J.-U., Radons, M., Streubel, T.: Solving piecewise linear equations in abs-normal form. optimization-online (2013)Google Scholar
- 6.Khan, K.A., Barton, P.I.: Evaluating an element of the Clarke generalized Jacobian of a piecewise differentiable function. In: Forth, S., et al. (eds.) Recent Advances in Algorithmic Differentiation, pp. 115–125. Springer, Heidelberg (2012)CrossRefGoogle Scholar
- 7.Munson, T.S.: Algorithms and environments for complementarity. University of wisconsin, Diss. (2000)Google Scholar
- 8.Naumann, U.: The Art of Differentiating Computer Programs: An Introduction to Algorithmic Differentiation. SIAM, Philadelphia (2011)CrossRefGoogle Scholar
- 9.Qi, L., Sun, D.: Nonsmooth equations and smoothing Newton methods. Applied Mathematics Report AMR 98.10 (1998)Google Scholar
- 10.Qi, L., Sun, J.: A nonsmooth version of Newton’s method. Math. Prog. 58(1–3), 353–367 (1993)MathSciNetCrossRefMATHGoogle Scholar
- 11.Rump, S.M.: Theorems of Perron-Frobenius type for matrices without sign restrictions. Linear Algebra Appl. 266, 1–42 (1997)MathSciNetCrossRefMATHGoogle Scholar
- 12.Scholtes, S.: Introduction to Piecewise Differentiable Equations. Springer, New York (2012)CrossRefMATHGoogle Scholar
Copyright information
© IFIP International Federation for Information Processing 2014