Trajectories of lattice particles using the new approach to no integrability

We study two systems which lead to a lattice when an integration path is specified in “aesthetic field theory”. One of these cases involves nonsoliton type particles (magnitudes of maxima and minima oscillate in time). The other system is made up of soliton type particles. The two systems are intrinsically three-dimensional. We speak of the third dimension as “time”. In one of our solutions, the particles move on straight line trajectories, insofar as our numerical work indicates. In the other solution, the soliton type particles undergo what appears to be simple harmonic motion in both the x- and y-directions (loop motion). We then study these two systems using the new approach to integrability which involves a superposition principle and is characterized by a unique change function at each point. We still find multi maxima and minima. The systems are not as symmetric as the lattice. The soliton characteristic is preserved by the new method. We investigated the motion of lattice particles. We found evidence of maxima (minima) regions coalescing so that the location of the maxima (minima) became difficult to follow. The concept of location of particles may not even have a well-defined meaning here. We find examples of soliton particles appearing and disappearing. We conclude that the manner of integration in a no integrability theory can transform a system with well-defined trajectories into a system where particles can no longer be followed in time.     

An Improvement to Goyal's Modified VAM for the Unbalanced Transportation Problem

This note points out how Goyal's modification of Vogel's approximation method for the unbalanced transportation problem can be improved by subtracting or adding suitable constants to the rows and columns of the cost matrix. We subtract column minima before applying Goyal's technique, and then subtract row/column minima before the application of VAM.     

Notes on lattice points of zonotopes and lattice-face polytopes

Minkowski’s second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowski’s bound by replacing the volume by the lattice point enumerator of a convex body. In this context we are interested in bounds on the coefficients of Ehrhart polynomials of lattice polytopes via the successive minima. Our results for lattice zonotopes and lattice-face polytopes imply, in particular, that for 0-symmetric lattice-face polytopes and lattice parallelepipeds the volume can be replaced by the lattice point enumerator.     

Dynamics on rugged landscapes of energy and ultrametric diffusion

We discuss the interbasin kinetics approximation for random walk on a complex (rugged) landscape of energy. In this approximation the random walk is described by the system of kinetic equations corresponding to transitions between the local minima of energy. If we approximate the transition rates between the local minima by the Arrhenius formula then the system of kinetic equations will be hierarchical. We discuss for a generic landscape of energy the anzats of interbasin kinetics which is equivalent to the ultrametric diffusion generated by an ultrametric pseudodifferential operator.     

Klein polyhedra and relative minima of lattices

We prove that in ?³, the relative minima of almost any lattice belong to the surface of the corresponding Klein polyhedron. We also prove, for almost any lattice in ?³, that the set of relative minima with nonnegative coordinates coincides with the union of the set of extremal points of the Klein polyhedron and a set of special points belonging to the triangular faces of the Klein polyhedron.     

Increasing the attraction area of the global minimum in the binary optimization problem

The problem of binary minimization of a quadratic functional in the configuration space is discussed. In order to increase the efficiency of the random-search algorithm it is proposed to change the energy functional by raising to a power the matrix it is based on. We demonstrate that this brings about changes of the energy surface: deep minima displace slightly in the space and become still deeper and their attraction areas grow significantly. Experiments show that this approach results in a considerable displacement of the spectrum of the sought-for minima to the area of greater depth, and the probability of finding the global minimum increases abruptly (by a factor of 10³ in the case of the 10 × 10 Edwards–Anderson spin glass).     

Small Noise Asymptotics of the Bayesian Estimator in Nonidentifiable Models

We study the asymptotic behavior of the Bayesian estimator for a deterministic signal in additive Gaussian white noise, in the case where the set of minima of the Kullback–Leibler information is a submanifold of the parameter space. This problem includes as a special case the study of the asymptotic behavior of the nonlinear filter, when the state equation is noise-free, and when the limiting deterministic system is nonobservable. As the noise intensity goes to zero, the posterior probability distribution of the parameter asymptotically concentrates on the submanifold of minima of the Kullback–Leibler information. We give an explicit expression of the limit, and we study the rate of convergence. We apply these results to a practical example where nonidentifiability occurs.     

A quasi-multistart framework for global optimization of expensive functions using response surface models

We present the AQUARS (A QUAsi-multistart Response Surface) framework for finding the global minimum of a computationally expensive black-box function subject to bound constraints. In a traditional multistart approach, the local search method is blind to the trajectories of the previous local searches. Hence, the algorithm might find the same local minima even if the searches are initiated from points that are far apart. In contrast, AQUARS is a novel approach that locates the promising local minima of the objective function by performing local searches near the local minima of a response surface (RS) model of the objective function. It ignores neighborhoods of fully explored local minima of the RS model and it bounces between the best partially explored local minimum and the least explored local minimum of the RS model. We implement two AQUARS algorithms that use a radial basis function model and compare them with alternative global optimization methods on an 8-dimensional watershed model calibration problem and on 18 test problems. The alternatives include EGO, GLOBALm, MLMSRBF (Regis and Shoemaker in INFORMS J Comput 19(4):497–509, 2007), CGRBF-Restart (Regis and Shoemaker in J Global Optim 37(1):113–135 2007), and multi level single linkage (MLSL) coupled with two types of local solvers: SQP and Mesh Adaptive Direct Search (MADS) combined with kriging. The results show that the AQUARS methods generally use fewer function evaluations to identify the global minimum or to reach a target value compared to the alternatives. In particular, they are much better than EGO and MLSL coupled to MADS with kriging on the watershed calibration problem and on 15 of the test problems.     

Singular perturbed problems in the zero mass case: asymptotic behavior of spikes

We discuss the asymptotic behavior of the least energy solution of a Dirichlet problem in the zero mass case. If Q is a uniformly positive potential having k isolated local minima, then we prove the existence of a positive multi-spike solutions having k peaks concentrating at each local minima of the potential.     

Fractal regularity results on optimal irrigation patterns

In this paper the problem of the regularity, i.e. fractal behaviour, of the minima of the branched transport problem is addressed. We show that, under suitable conditions on the irrigated measure, the minima present a fractal regularity, that is on a given branch of length l the number of branches bifurcating from it whose length is comparable with ε   can be estimated both from above and below by l/ε$l/\epsilon$.     

Conjugate points and shocks in nonlinear optimal control

We investigate characteristics of the Hamilton-Jacobi-Bellman
equation arising in nonlinear optimal control and their relationship with weak and strong local minima. This leads to an extension of the Jacobi conjugate points theory to the Bolza control problem. Necessary and sufficient optimality conditions for weak and strong local minima are stated in terms of the existence of a solution to a corresponding matrix Riccati differential equation.

     

Monotone trajectories of multivalued dynamical systems

Summary We prove existence of ? monotone trajectories ? for a class of discrete and continuous systems sufficiently general to include problems of some interest in economic and biological theory. We prove existence of critical points which are Pareto minima. We study stability properties of Pareto minima. Entrata in Redazione il 7 settembre 1976. Sponsored in part by ARO Grant DAHC04-74-60012, and NSF MCS75-21868.     

The slimmest arrangements of hyperplanes

We show how the results of Dowling and Wilson on Whitney numbers in ‘The slimmest geometric lattices’ imply minimum values for the numbers of k-dimensional flats and d-dimensional cells of a projective d-arrangement of hyperplanes and for the number of d-cells missed by an extra hyperplane. Their theorems also characterize the extremal arrangements. We extend their lattice results to doubly indexed Whitney numbers; thence we obtain minima for the number of k-dimensional cells and the number of pairs of flats with x \(\subseteq\) y and dim x=k, dim y=l. The lower bounds are in terms of the rank and number of points of the geometric lattice, or the dimension d and the number of hyperplanes of the arrangement. The minima for k-cells were conjectured by Grünbaum; R. W. Shannon proved the minima for k-dimensional flats and cells and characterized attainment for the latter by a more strictly geometric, non-latticial technique.     

On Kerckhoff Minima and Pleating Loci for Quasi-Fuchsian Groups

We show how Kerckhoff's results on minima of length functions on Teichmüller space can be used to analyse the possible bending loci of the boundary of the convex hull for quasi-Fuchsian groups near to the Fuchsian locus.     

A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming

A method for computing global minima of real multivariate polynomials based on semidefinite programming was developed by N.Z. Shor, J.B. Lasserre and P.A. Parrilo. The aim of this article is to extend a variant of their method to noncommutative symmetric polynomials in variables X and Y satisfying YX−XY=1 and X^*=X, Y^*=−Y. Global minima of such polynomials are defined and showed to be equal to minima of the spectra of the corresponding differential operators. We also discuss how to exploit sparsity and symmetry. Several numerical experiments are included. The last section explains how our theory fits into the framework of noncommutative real algebraic geometry.     

格中依次最短无关组与Minkowski约化基等价的充分条件

本文讨论了格中基子集、依次最短无关组及Minkowski约化基之间的向量长度关系,利用无关组与基之间的一些制约性质,给出了Minkowski约化基达到依次最短长度,以及依次最短无关组成为Minkowski约化基的一些充分条件.     

Lattice-point enumerators of ellipsoids

Minkowski’s second theorem on successive minima asserts that the volume of a 0-symmetric convex body K over the covolume of a lattice Λ can be bounded above by a quantity involving all the successive minima of K with respect to Λ. We will prove here that the number of lattice points inside K can also accept an upper bound of roughly the same size, in the special case where K is an ellipsoid. Whether this is also true for all K unconditionally is an open problem, but there is reasonable hope that the inductive approach used for ellipsoids could be extended to all cases.     

Variations on R. Schwartz��s Inequality for the Schwarzian Derivative

R. Schwartz??s inequality provides an upper bound for the Schwarzian derivative of a parameterization of a circle in the complex plane and on the potential of Hill??s equation with coexisting periodic solutions. We prove a discrete version of this inequality and obtain a version of the planar Blaschke?CSantalo inequality for not necessarily convex polygons. In the proof, we use some formulas from the theory of frieze patterns. We consider a centro-affine analog of Lük???s inequality for the average squared length of a chord subtending a fixed arc length of a curve??the role of the squared length played by the area??and prove that the central ellipses are local minima of the respective functionals on the space of star-shaped centrally symmetric curves. We conjecture that the central ellipses are global minima. In an appendix, we relate the Blaschke?CSantalo and Mahler inequalities with the asymptotic dynamics of outer billiards at infinity.     

Generating realistic terrains with higher-order Delaunay triangulations

For hydrologic applications, terrain models should have few local minima, and drainage lines should coincide with edges. We show that triangulating a set of points with elevations such that the number of local minima of the resulting terrain is minimized is NP-hard for degenerate point sets. The same result applies when there are no degeneracies for higher-order Delaunay triangulations. Two heuristics are presented to reduce the number of local minima for higher-order Delaunay triangulations, which start out with the Delaunay triangulation. We give efficient algorithms for their implementation, and test on real-world data how well they perform. We also study another desirable drainage characteristic, few valley components, and how to obtain it for higher-order Delaunay triangulations. This gives rise to a third heuristic. Tables and visualizations show how the heuristics perform for the drainage characteristics on real-world data.     

Error estimates for the numerical approximation of Neumann control problems governed by a class of quasilinear elliptic equations

We study the numerical approximation of Neumann boundary optimal control problems governed by a class of quasilinear elliptic equations. The coefficients of the main part of the operator depend on the state function, as a consequence the state equation is not monotone. We prove that strict local minima of the control problem can be approximated uniformly by local minima of discrete control problems and we also get an estimate of the rate of this convergence. One of the main issues in this study is the error analysis of the discretization of the state and adjoint state equations. Some difficulties arise due to the lack of uniqueness of solution of the discrete equations. The theoretical results are illustrated by numerical tests.