arXiv math/06112802006-11-09math.OC

一般类具有向量积的非线性离散输入输出系统的模型匹配问题。数学方法

The Model Matching Problem for a General Class of Non-Linear Discrete Input - Output Systems with Cross-Products. an Algorithmic Approach

S. Kotsios

备注：: It is under reviewing at IEEE-TAC

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

摘要英文摘要相关论文

摘要：

本文通过一种特殊的分解方法研究了含有输入输出时滞乘积的非线性输入输出离散系统的模型匹配问题。我们采用$\de \e$ -算子的代数框架和星积来描述这些系统。此外，类似于欧几里德除法的某个过程允许我们发现这些系统的线性因子，关于上述操作。整个方法是象征性的算法，并涉及使用合适的软件。

英文摘要：

In this paper we examine the model matching problem that concerns nonlinear input - output discrete systems, containing products among delays of input and output signals, through a special factorization. The algebraic framework of $\de \e$-operators and the star-product that we adopt describe these systems. Moreover, a certain procedure that resembles the Euclidean division, allows us to discover the linear factors of those systems, with respect to the above mentioned operations. The entire approach is symbolically algorithmic and involves the use of suitable software.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

摘要英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Discrete Convex Functions on Graphs and Their Algorithmic Applications

The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by combinatorial dualities in multiflow problems and the complexity classification of facility location problems on graphs. We outline the theory and algorithmic applications in combinatorial optimization problems.

2017-09-07math.OC

Equitable Partitions into Matchings and Coverings in Mixed Graphs

Matchings and coverings are central topics in graph theory. The close relationship between these two has been key to many fundamental algorithmic and polyhedral results. For mixed graphs, the notion of matching forest was proposed as a common generalization of matchings and branchings. In this paper, we propose the notion of mixed edge cover as a covering counterpart of matching forest, and extend the matching--covering framework to mixed graphs. While algorithmic and polyhedral results extend fairly easily, partition problems are considerably more difficult in the mixed case. We address the p…

2019-10-16cs.DMmath.COmath.OC

离散力学系统的受控拉格朗日量与镇定I

Controlled Lagrangians and Stabilization of Discrete Mechanical Systems I

控制拉格朗日和匹配技术的稳定化的相对平衡和平衡的离散力学系统的对称性以及对称性破缺。有趣的新现象出现在控制拉格朗日方法在离散的情况下，不存在于连续的理论。特别是，为了使离散理论有效，可以适当地选择动量水平，或者，引入一个新的参数到受控拉格朗日来完成动力学匹配过程。具体而言，新的条款，在控制的形状方程是必要的潜在的匹配在离散设置。本文以倾斜小车-摆系统的稳定问题为例说明了这一理论。本文还讨论了数字和模型预测控制器。

2007-04-30math.OC

Algorithmic aspects of multigrid methods for optimization in shape spaces

We examine the interaction of multigrid methods and shape optimization in appropriate shape spaces. Our aim is a scalable algorithm for application on supercomputers, which can only be achieved by mesh-independent convergence. The impact of discrete approximations of geometrical quantities, like the mean curvature, on a multigrid shape optimization algorithm with quasi-Newton updates is investigated. For the purpose of illustration, we consider a complex model for the identification of cellular structures in biology with minimal compliance in terms of elasticity and diffusion equations.

2017-11-07math.OC

开放问题：通过凯莱表完成分离几何压缩与算法压缩

Open Problem: Separating Geometric and Algorithmic Compression via Cayley-Table Completion

Dongsung Huh

提出凯莱表完成作为测试缺失的算法复杂度最小化归纳偏置的规范问题，并挑战社区将连续平坦性先验推广以自主发现离散算法公理。

2026-05-28cond-mat.dis-nncs.LGmath.OC

Approximating Stable Matchings with Ties of Bounded Size

Finding a stable matching is one of the central problems in algorithmic game theory. If participants are allowed to have ties and incomplete preferences, computing a stable matching of maximum cardinality is known to be NP-hard. In this paper we present a $(3L-2)/(2L-1)$-approximation algorithm for the stable matching problem with ties of size at most $L$ and incomplete lists. Our result matches the known lower bound on the integrality gap for the associated LP formulation.

2020-07-14cs.GTmath.OC

更多相关论文收起更多论文

Consensus-based Distributed Discrete Optimal Transport for Decentralized Resource Matching

Optimal transport has been used extensively in resource matching to promote the efficiency of resources usages by matching sources to targets. However, it requires a significant amount of computations and storage spaces for large-scale problems. In this paper, we take a consensus-based approach to decentralize discrete optimal transport problems and develop fully distributed algorithms with alternating direction method of multipliers. We show that our algorithms guarantee certain levels of efficiency and privacy besides the distributed nature. We further derive primal and dual algorithms by ex…

2019-04-08cs.DCmath.OC

$\mathcal{W}_\infty$-transport with discrete target as a combinatorial matching problem

In this short note, we show that given a cost function $c$, any coupling $π$ of two probability measures where the second is a discrete measure can be associated to a certain bipartite graph containing a perfect matching, based on the value of the infinity transport cost $\norm{c}_{L^\infty(π)}$. This correspondence between couplings and bipartite graphs is explicitly constructed. We give two applications of this result to the $\mathcal{W}_\infty$ optimal transport problem when the target measure is discrete, the first is a condition to ensure existence of an optimal plan induced by a mapping,…

2020-07-15cs.NAmath.NAmath.OC

多智能体覆盖控制：从离散分配到连续多智能体分布匹配

Multi-agent Coverage Control: From Discrete Assignments to Continuous Multi-agent Distribution Matching

本文综述多智能体覆盖控制问题，涵盖静态与动态部署、离散与连续任务分配，指出统一特征并给出新参考文献，大纲包括并发区域划分、离散任务分配及大规模群体连续分配。

2024-07-18cs.ROmath.OC

计算最优Morse匹配

Computing Optimal Morse Matchings

Morse匹配捕获离散Morse函数的基本结构信息。我们表明，计算最佳莫尔斯匹配是NP-困难的，并给出了一个整数规划制定的问题。然后，我们提出相应的多面体和报告的计算结果多面体的结果。

2004-08-24math.COmath.OC

Non-convex online learning via algorithmic equivalence

Google AI Princeton（谷歌AI普林斯顿）；Princeton University（普林斯顿大学）

We study an algorithmic equivalence technique between non-convex gradient descent and convex mirror descent. We start by looking at a harder problem of regret minimization in online non-convex optimization. We show that under certain geometric and smoothness conditions, online gradient descent applied to non-convex functions is an approximation of online mirror descent applied to convex functions under reparameterization. In continuous time, the gradient flow with this reparameterization was shown to be exactly equivalent to continuous-time mirror descent by Amid and Warmuth 2020, but theory f…

2022-10-12cs.LGmath.OC

On the approximability of the stable matching problem with ties of size two

The stable matching problem is one of the central problems of algorithmic game theory. If participants are allowed to have ties, the problem of finding a stable matching of maximum cardinality is an NP-hard problem, even when the ties are of size two. Moreover, in this setting it is UGC-hard to provide an approximation for the maximum cardinality stable matching problem with a constant factor smaller than 4/3. In this paper, we give a tight analysis of an approximation algorithm given by Huang and Kavitha for the maximum cardinality stable matching problem with ties of size two, demonstrating …

2019-02-15cs.GTmath.OC