Results 61 to 70 of about 13,849 (192)
ABSTRACT This paper develops a framework for designing output feedback controllers for constrained linear parameter‐varying systems that experience persistent disturbances. We specifically propose an incremental parameter‐varying output feedback control law to address control rate constraints, as well as state and control amplitude constraints.
Jackson G. Ernesto +2 more
wiley +1 more source
On the existence of 0/1 polytopes with high semidefinite extension complexity
In Rothvo\ss{} it was shown that there exists a 0/1 polytope (a polytope whose vertices are in \{0,1\}^{n}) such that any higher-dimensional polytope projecting to it must have 2^{\Omega(n)} facets, i.e., its linear extension complexity is exponential ...
A. Ben-Tal +6 more
core +1 more source
Stochastic Multiplicative Updates for Symmetric Nonnegative Matrix Factorization
Innen maskinlæring brukes symmetrisk ikkenegativ matrisefaktorisering (NMF) i forbindelse med clusteranalyse. NMF utføres ofte ved hjelp av algoritmer som tar i bruk multiplikative oppdateringer (MU). Disse har den fordelen at de automatisk opprettholder ikkenegativitet i faktormatrisen.
Schlüter, Klara, Riege, Jon
openaire +2 more sources
Vector Field‐Based Collision‐Free Navigation in Tunnel‐Like Environments
ABSTRACT Tunnel‐like environments, renowned for their vast scale, confined spaces, and limited visibility, present significant challenges for autonomous robot navigation. This study addresses the critical issue of guiding robots through such environments while ensuring collision‐free navigation and maintaining a specified safety margin from both tunnel
Bao Jianjun +5 more
wiley +1 more source
The matching polytope does not admit fully-polynomial size relaxation schemes
The groundbreaking work of Rothvo{\ss} [arxiv:1311.2369] established that every linear program expressing the matching polytope has an exponential number of inequalities (formally, the matching polytope has exponential extension complexity).
Braun, Gábor, Pokutta, Sebastian
core +1 more source
Fast and Effective Algorithms for Symmetric Nonnegative Matrix Factorization
Symmetric Nonnegative Matrix Factorization (SNMF) models arise naturally as simple reformulations of many standard clustering algorithms including the popular spectral clustering method. Recent work has demonstrated that an elementary instance of SNMF provides superior clustering quality compared to many classic clustering algorithms on a variety of ...
Borhani, Reza +2 more
openaire +2 more sources
A new smooth failure criterion for concrete inspired by Lubliner's condition
Abstract A new failure criterion with 10 parameters is proposed, based on Lubliner's idea of joining two Drucker–Prager cones. The novelty lies in the way of introducing deviatoric shape variation: through two Podgórski's functions. This feature allows for improving plane stress cross‐section's compatibility with experimental data.
Inez Kamińska, Aleksander Szwed
wiley +1 more source
When in Doubt, Tax More Progressively? Uncertainty and Progressive Income Taxation
ABSTRACT We study the optimal income tax problem under parameter uncertainty about household preferences and wage dynamics. We derive conditions characterizing how such uncertainty affects optimal tax policy. To quantify the effect, we estimate a life‐cycle model using US data and a Bayesian approach.
Minsu Chang, Chunzan Wu
wiley +1 more source
Clustering and Latent Semantic Indexing Aspects of the Nonnegative Matrix Factorization [PDF]
This paper provides a theoretical support for clustering aspect of the nonnegative matrix factorization (NMF). By utilizing the Karush-Kuhn-Tucker optimality conditions, we show that NMF objective is equivalent to graph clustering objective, so ...
Mirzal, Andri
core
Network Games With Triadic Interactions
ABSTRACT We propose a model for network‐mediated interactions incorporating higher‐order relationships such as triadic interactions. The marginal utility of an individual's action depends explicitly on endogenous actions of multiple units. Conditions ensuring a unique Nash equilibrium are derived using a variational inequality approach. We estimate the
Wei Shi, Chunchao Wang, Pei Yu
wiley +1 more source

