The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 6 of 379
Back to Result List

An active signature method for constrained abs-linear minimization

  • In this paper we consider the solution of optimization tasks with a piecewise linear objective function and piecewise linear constraints. First, we state optimality conditions for that class of problems using the abs-linearization approach and prove that they can be verified in polynomial time. Subsequently, we propose an algorithm called Constrained Active Signature Method that explicitly exploits the piecewise linear structure to solve such optimization problems. Convergence of the algorithm within a finite number of iterations is proven. Numerical results for various testcases including linear complementarity conditions and a bi-level problem illustrate the performance of the new algorithm.
Metadaten
Author:Timo Kreimeier, Andrea Walther, Andreas Griewank
Document Type:Preprint
Language:English
Date of Publication (online):2021/11/12
Release Date:2021/11/12
Institutes:Humboldt-Universität zu Berlin
Subprojects:B10
Licence (German):License LogoCreative Commons - CC BY-SA - Namensnennung - Weitergabe unter gleichen Bedingungen 4.0 International