Kathrin Hatz – Optimization Online

Regularizing Bilevel Nonlinear Programs by Lifting

Published: 2013/06/10

This paper considers a bilevel nonlinear program (NLP) whose lower-level problem satisfies a linear independence constraint qualification (LICQ) and a strong second-order condition (SSOC). One would expect the resulting mathematical program with complementarity constraints (MPCC), whose constraints are the first-order optimality conditions of the lower-level NLP, to satisfy an MPEC-LICQ. We provide an example which … Read more

Computing nonnegative tensor factorizations

Published: 2006/10/18

Michael P. Friedlander

Kathrin Hatz

Applications - Science and Engineering alternating least-squares, block gauss-seidel, n-dimensional arrays, nonnegative least-squares, nonnegative tensor factorization, regularization, sparse solutions, tensors

Nonnegative tensor factorization (NTF) is a technique for computing a parts-based representation of high-dimensional data. NTF excels at exposing latent structures in datasets, and at finding good low-rank approximations to the data. We describe an approach for computing the NTF of a dataset that relies only on iterative linear-algebra techniques and that is comparable in … Read more