Open AccessBook
Linear complementarity, linear and nonlinear programming
About:
The article was published on 1988-01-01 and is currently open access. It has received 1012 citations till now. The article focuses on the topics: Mixed complementarity problem & Complementarity theory.read more
Citations
More filters
Book ChapterDOI
Kalman-Yakubovich-Popov Lemma
TL;DR: The first results on the Kalman-Yakubovich-Kalman-Popov lemma were due to Yakubovich and Popov as mentioned in this paper, who used general factorization of matrix polynomials.
Posted Content
Complexity Aspects of Fundamental Questions in Polynomial Optimization
TL;DR: This thesis settles the computational complexity of some fundamental questions in polynomial optimization, and proposes SDP relaxations for NP-hard problems related to Nash equilibria, such as that of finding the highest achievable welfare under any Nash equilibrium.
Journal ArticleDOI
Q-matrix recognition via secondary and universal polytopes
TL;DR: This work explains how one can use the polyhedral structure of the set of all triangulations of a finite point set to determine if an n×n matrix M is a Q-matrix.
Optimization for structural equation modeling: applications to substance use disorders
TL;DR: This document summarizes current capabilities, research and operational priorities, and plans for further studies that were established at the 2015 USGS workshop on quantitative hazard assessments of earthquake-triggered landsliding and liquefaction.
Journal ArticleDOI
On the Structure of Linear Programs with Overlapping Cardinality Constraints
Tobias Fischer,Marc E. Pfetsch +1 more
TL;DR: This article presents the components of a branch-and-cut solution approach, including new branching rules that exploit the structure of the corresponding conflict hypergraph, and investigates valid or facet defining cutting planes for the convex hull of the feasible solution set.