English
Related papers

Related papers: Cut time in sub-Riemannian problem on Engel group

200 papers

Given a supersingular elliptic curve E and a non-scalar endomorphism $\alpha$ of E, we prove that the endomorphism ring of E can be computed in classical time about disc(Z[$\alpha$])^1/4 , and in quantum subexponential time, assuming the…

Cryptography and Security · Computer Science 2025-07-08 Arthur Herlédan Le Merdy , Benjamin Wesolowski

We study the least-energy way to reshape a probability distribution when motion is constrained to a horizontal bundle, that is, optimal transport and distribution steering in sub-Riemannian geometry, motivated by density control over…

Optimization and Control · Mathematics 2026-05-18 Daniel Owusu Adu , Karthik Elamvazhuthi , Bahman Gharesifard

The minimization of energy-like cost functionals is addressed in the context of optimal control problems. For a general class of dynamical systems, with possibly unstable and nonlinear free dynamics, it is shown that a sequence of solutions…

Optimization and Control · Mathematics 2022-12-06 Sérgio S. Rodrigues

In this work, we study an optimal control problem for a multi-agent system modeled by an undirected formation graph with nodes describing the kinematics of each agent, given by a left-invariant control system on a Lie group. The agents…

Optimization and Control · Mathematics 2020-11-26 Leonardo Colombo , Dimos Dimarogonas

The first-order optimality conditions for a generic nonlinear optimization problem are generated as part of the terminal transversality conditions of an optimal control problem. It is shown that the Lagrangian of the optimization problem is…

Optimization and Control · Mathematics 2022-03-17 I. M. Ross

Problem of time-optimal control of linear systems with fractional dynamics is treated in the paper from the convex-analytic standpoint. A linear system of fractional differential equations involving Riemann--Liouville derivatives is…

Optimization and Control · Mathematics 2020-07-02 Ivan Matychyn

The Transversal problem, i.e, the enumeration of all the minimal transversals of a hypergraph in output-polynomial time, i.e, in time polynomial in its size and the cumulated size of all its minimal transversals, is a fifty years old open…

Data Structures and Algorithms · Computer Science 2014-07-09 Mamadou Moustapha Kanté , Vincent Limouzy , Arnaud Mary , Lhouari Nourine , Takeaki Uno

The discussion is limited to first-class parametrized systems, where the definition of time evolution and observables is not trivial, and to finite dimensional systems in order that technicalities do not obscure the conceptual framework.…

General Relativity and Quantum Cosmology · Physics 2009-10-28 Petr Hajicek

We derive an optimal control formulation for a nonholonomic mechanical system using the nonholonomic constraint itself as the control. We focus on Suslov's problem, which is defined as the motion of a rigid body with a vanishing projection…

Optimization and Control · Mathematics 2018-11-13 Vakhtang Putkaradze , Stuart Rogers

This work is concerned with the time optimal control problem for evolution equations in Hilbert spaces. The attention is focused on the maximum principle for the time optimal controllers having the dimension smaller that of the state…

Analysis of PDEs · Mathematics 2020-04-22 Gabriela Marinoschi

We consider a control-constrained optimal control problem subject to time-harmonic Maxwell's equations; the control variable belongs to a finite-dimensional set and enters the state equation as a coefficient. We derive existence of optimal…

Numerical Analysis · Mathematics 2024-05-10 Francisco Fuica , Felipe Lepe , Pablo Venegas

An optimal control problem with a time-parameter is considered. The functional to be optimized includes the maximum over time-horizon reached by a function of the state variable, and so an $L^\infty$-term. In addition to the classical…

Optimization and Control · Mathematics 2018-11-01 Sébastien Court , Karl Kunisch , Laurent Pfeiffer

In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP-complete. We revisit the problem and…

Discrete Mathematics · Computer Science 2021-07-15 Van Bang Le , Jan Arne Telle

We consider the energy minimization problem for undirected graphical models, also known as MAP-inference problem for Markov random fields which is NP-hard in general. We propose a novel polynomial time algorithm to obtain a part of its…

Artificial Intelligence · Computer Science 2015-08-19 Paul Swoboda , Alexander Shekhovtsov , Jörg Hendrik Kappes , Christoph Schnörr , Bogdan Savchynskyy

In this paper we study the scalar geometries occurring in the dimensional reduction of minimal five-dimensional supergravity to three Euclidean dimensions, and find that these depend on whether one first reduces over space or over time. In…

High Energy Physics - Theory · Physics 2015-06-18 Vicente Cortés , Paul Dempster , Thomas Mohaupt

We consider Calder\'{o}n's inverse boundary value problems for a class of nonlinear Helmholtz Schr\"{o}dinger equations and Maxwell's equations in a bounded domain in $\R^n$. The main method is the higher-order linearization of the…

Analysis of PDEs · Mathematics 2022-07-01 Xuezhu Lu

We consider optimal control of fractional in time (subdiffusive, i.e., for $% 0<\gamma <1$) semilinear parabolic PDEs associated with various notions of diffusion operators in an unifying fashion. Under general assumptions on the…

Optimization and Control · Mathematics 2021-10-08 Harbir Antil , Ciprian G. Gal , Mahamadi Warma

Let (N,g) be a nilpotent Lie group endowed with an invariant geometric structure (cf. symplectic, complex, hypercomplex or any of their `almost' versions). We define a left invariant Riemannian metric on N compatible with g to be minimal,…

Differential Geometry · Mathematics 2007-05-23 Jorge Lauret

The article poses a general model for optimal control subject to information constraints, motivated in part by recent work of Sims and others on information-constrained decision-making by economic agents. In the average-cost optimal control…

Optimization and Control · Mathematics 2016-02-24 Ehsan Shafieepoorfard , Maxim Raginsky , Sean P. Meyn

The exact complexity of geometric cuts and bisections is the longstanding open problem including even the dimension one. In this paper, we resolve this problem for dimension one (the real line) by designing an exact polynomial time…

Data Structures and Algorithms · Computer Science 2012-07-05 Marek Karpinski , Andrzej Lingas , Dzmitry Sledneu