205 research outputs found
Transversality Conditions for Infinite Horizon Variational Problems on Time Scales
We consider problems of the calculus of variations on unbounded time scales.
We prove the validity of the Euler-Lagrange equation on time scales for
infinite horizon problems, and a new transversality condition.Comment: Submitted 6-October-2009; Accepted 19-March-2010 in revised form; for
publication in "Optimization Letters"
A General Backwards Calculus of Variations via Duality
We prove Euler-Lagrange and natural boundary necessary optimality conditions
for problems of the calculus of variations which are given by a composition of
nabla integrals on an arbitrary time scale. As an application, we get
optimality conditions for the product and the quotient of nabla variational
functionals.Comment: Submitted to Optimization Letters 03-June-2010; revised 01-July-2010;
accepted for publication 08-July-201
Necessary Optimality Conditions for Higher-Order Infinite Horizon Variational Problems on Time Scales
We obtain Euler-Lagrange and transversality optimality conditions for
higher-order infinite horizon variational problems on a time scale. The new
necessary optimality conditions improve the classical results both in the
continuous and discrete settings: our results seem new and interesting even in
the particular cases when the time scale is the set of real numbers or the set
of integers.Comment: This is a preprint of a paper whose final and definite form will
appear in Journal of Optimization Theory and Applications (JOTA). Paper
submitted 17-Nov-2011; revised 24-March-2012 and 10-April-2012; accepted for
publication 15-April-201
Euler-Lagrange equations for composition functionals in calculus of variations on time scales
In this paper we consider the problem of the calculus of variations for a
functional which is the composition of a certain scalar function with the
delta integral of a vector valued field , i.e., of the form
. Euler-Lagrange
equations, natural boundary conditions for such problems as well as a necessary
optimality condition for isoperimetric problems, on a general time scale, are
given. A number of corollaries are obtained, and several examples illustrating
the new results are discussed in detail.Comment: Submitted 10-May-2009 to Discrete and Continuous Dynamical Systems
(DCDS-B); revised 10-March-2010; accepted 04-July-201
Universality in Systems with Power-Law Memory and Fractional Dynamics
There are a few different ways to extend regular nonlinear dynamical systems
by introducing power-law memory or considering fractional
differential/difference equations instead of integer ones. This extension
allows the introduction of families of nonlinear dynamical systems converging
to regular systems in the case of an integer power-law memory or an integer
order of derivatives/differences. The examples considered in this review
include the logistic family of maps (converging in the case of the first order
difference to the regular logistic map), the universal family of maps, and the
standard family of maps (the latter two converging, in the case of the second
difference, to the regular universal and standard maps). Correspondingly, the
phenomenon of transition to chaos through a period doubling cascade of
bifurcations in regular nonlinear systems, known as "universality", can be
extended to fractional maps, which are maps with power-/asymptotically
power-law memory. The new features of universality, including cascades of
bifurcations on single trajectories, which appear in fractional (with memory)
nonlinear dynamical systems are the main subject of this review.Comment: 23 pages 7 Figures, to appear Oct 28 201
Hardness and approximation for the geodetic set problem in some graph classes
In this paper, we study the computational complexity of finding the
\emph{geodetic number} of graphs. A set of vertices of a graph is a
\emph{geodetic set} if any vertex of lies in some shortest path between
some pair of vertices from . The \textsc{Minimum Geodetic Set (MGS)} problem
is to find a geodetic set with minimum cardinality. In this paper, we prove
that solving the \textsc{MGS} problem is NP-hard on planar graphs with a
maximum degree six and line graphs. We also show that unless , there is
no polynomial time algorithm to solve the \textsc{MGS} problem with
sublogarithmic approximation factor (in terms of the number of vertices) even
on graphs with diameter . On the positive side, we give an
-approximation algorithm for the \textsc{MGS}
problem on general graphs of order . We also give a -approximation
algorithm for the \textsc{MGS} problem on the family of solid grid graphs which
is a subclass of planar graphs
The Hahn Quantum Variational Calculus
We introduce the Hahn quantum variational calculus. Necessary and sufficient
optimality conditions for the basic, isoperimetric, and Hahn quantum Lagrange
problems, are studied. We also show the validity of Leitmann's direct method
for the Hahn quantum variational calculus, and give explicit solutions to some
concrete problems. To illustrate the results, we provide several examples and
discuss a quantum version of the well known Ramsey model of economics.Comment: Submitted: 3/March/2010; 4th revision: 9/June/2010; accepted:
18/June/2010; for publication in Journal of Optimization Theory and
Application
Perfect Hash Families: The Generalization to Higher Indices
Perfect hash families are often represented as combinatorial arrays encoding partitions of kitems into v classes, so that every t or fewer of the items are completely separated by at least a specified number of chosen partitions. This specified number is the index of the hash family. The case when each t-set must be separated at least once has been extensively researched; they arise in diverse applications, both directly and as fundamental ingredients in a column replacement strategy for a variety of combinatorial arrays. In this paper, construction techniques and algorithmic methods for constructing perfect hash families are surveyed, in order to explore extensions to the situation when each t-set must be separated by more than one partition.https://digitalcommons.usmalibrary.org/books/1029/thumbnail.jp
A 2-Secure Code with Efficient Tracing Algorithm
A 2-secure code with efficient tracing algorith
- …