Non-negative matrix factorization revisited: Uniqueness and algorithm for symmetric decomposition
K Huang, ND Sidiropoulos… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
Non-negative matrix factorization (NMF) has found numerous applications, due to its ability
to provide interpretable decompositions. Perhaps surprisingly, existing results regarding its …
to provide interpretable decompositions. Perhaps surprisingly, existing results regarding its …
Static contract checking with abstract interpretation
M Fähndrich, F Logozzo - International conference on formal verification of …, 2010 - Springer
We present an overview of Clousot, our current tool to statically check CodeContracts.
CodeContracts enable a compiler and language-independent specification of Contracts …
CodeContracts enable a compiler and language-independent specification of Contracts …
Computing convex hulls and counting integer points with polymake
B Assarf, E Gawrilow, K Herr, M Joswig… - Mathematical …, 2017 - Springer
The main purpose of this paper is to report on the state of the art of computing integer hulls
and their facets as well as counting lattice points in convex polytopes. Using the polymake …
and their facets as well as counting lattice points in convex polytopes. Using the polymake …
[图书][B] Uncertainty quantification with experimental data and complex system models
TM Russi - 2010 - search.proquest.com
This dissertation discusses uncertainty quantification as posed in the Data Collaboration
framework. Data Collaboration is a methodology for combining experimental data and …
framework. Data Collaboration is a methodology for combining experimental data and …
[PDF][PDF] Nonlinear discrete optimization
S Onn - Zurich Lectures in Advanced Mathematics, European …, 2010 - pi.math.cornell.edu
Nonlinear Discrete Optimization Page 1 Shmuel Onn Technion – Israel Institute of Technology
http://ie.technion.ac.il/~onn Nonlinear Discrete Optimization Based on several papers joint with …
http://ie.technion.ac.il/~onn Nonlinear Discrete Optimization Based on several papers joint with …
On the hardness of computing intersection, union and minkowski sum of polytopes
HR Tiwary - Discrete & Computational Geometry, 2008 - Springer
Abstract For polytopes P 1, P 2⊂ ℝ d, we consider the intersection P 1∩ P 2, the convex hull
of the union CH (P 1∪ P 2), and the Minkowski sum P 1+ P 2. For the Minkowski sum, we …
of the union CH (P 1∪ P 2), and the Minkowski sum P 1+ P 2. For the Minkowski sum, we …
A concise, approximate representation of a collection of loads described by polytopes
S Barot, JA Taylor - International Journal of Electrical Power & Energy …, 2017 - Elsevier
Aggregations of flexible loads can provide several power system services through demand
response programs, for example load shifting and curtailment. The capabilities of demand …
response programs, for example load shifting and curtailment. The capabilities of demand …
A systematic formulation tightening approach for unit commitment problems
Unit Commitment is usually formulated as a Mixed Binary Linear Programming (MBLP)
problem. When considering a large number of units, state-of-the-art methods such as branch …
problem. When considering a large number of units, state-of-the-art methods such as branch …
Optimization with multivariate conditional value-at-risk constraints
For many decision-making problems under uncertainty, it is crucial to develop risk-averse
models and specify the decision makers' risk preferences based on multiple stochastic …
models and specify the decision makers' risk preferences based on multiple stochastic …
The verified polyhedron library: an overview
S Boulmé, A Marechaly, D Monniaux… - … on Symbolic and …, 2018 - ieeexplore.ieee.org
The Verified Polyhedra Library operates upon a constraint-only representation of convex
polyhedra and provides all common operations (image, pre-image, projection, convex hull …
polyhedra and provides all common operations (image, pre-image, projection, convex hull …