<Emphasis Type="Italic">C</Emphasis><Superscript>1</Superscript>-Classification of Gapped Parent Hamiltonians of Quantum Spin Chains

We consider the C ¹-classification of gapped Hamiltonians introduced in Fannes et al. (Commun Math Phys 144:443–490, 1992) and Nachtergaele (Commun Math Phys 175:565–606, 1996) as parent Hamiltonians of translation invariant finitely correlated states. Within this family, we show that the number of edge modes, which is equal at the left and right edge, is the complete invariant. The construction proves that translation invariance of the ‘bulk’ ground state does not need to be broken to establish C ¹-equivalence, namely that the spin chain does not need to be blocked.     

Distribution function estimates by Wasserstein metric and Bernstein approximation for C-1 functions

The aim of the paper is to estimate the density functions or distribution functions measured by Wasserstein metric, a typical kind of statistical distances, which is usually required in the statistical learningBased on the classical Bernstein approximation, a scheme is presented.To get the error estimates of the scheme, the problem turns to estimating the L1 norm of the Bernstein approximation for monotone C-1functions, which was rarely discussed in the classical approximation theoryFinally, we get a probability estimate by the statistical distance.     

Symplectic invariants for curves and integrable systems in similarity symplectic geometry

In this paper, similarity symplectic geometry for curves is proposed and studied. Explicit expressions of the symplectic invariants, Frenet frame and Frenet formulae for curves in similarity symplectic geometry are obtained by using the equivariant moving frame method. The relationships between the Euclidean symplectic invariants, Frenet frame, Frenet formulae and the similarity symplectic invariants, Frenet frame, Frenet formulae for curves are established. Invariant curve flows in four-dimensional similarity symplectic geometry are also studied. It is shown that certain intrinsic invariant curve flows in four-dimensional similarity symplectic geometry are related to the integrable Burgers and matrix Burgers equations.     

Barrier method in nonsmooth convex optimization without convex representation

In this article we want to demonstrate that under mild conditions the barrier method is an effective solution approach for convex optimization problems whose objective is nonsmooth and whose feasible set is described by smooth inequality constraints in which all the constraint functions need not be convex.     

Quantitative stability of full random two-stage stochastic programs with recourse

In this paper, we consider quantitative stability analysis for two-stage stochastic linear programs when recourse costs, the technology matrix, the recourse matrix and the right-hand side vector are all random. For this purpose, we first investigate continuity properties of parametric linear programs. After deriving an explicit expression for the upper bound of its feasible solutions, we establish locally Lipschitz continuity of the feasible solution sets of parametric linear programs. These results are then applied to prove continuity of the generalized objective function derived from the full random second-stage recourse problem, from which we derive new forms of quantitative stability results of the optimal value function and the optimal solution set with respect to the Fortet–Mourier probability metric. The obtained results are finally applied to establish asymptotic behavior of an empirical approximation algorithm for full random two-stage stochastic programs.     

On a convex set with nondifferentiable metric projection

A remarkable example of a nonempty closed convex set in the Euclidean plane for which the directional derivative of the metric projection mapping fails to exist was constructed by A. Shapiro. In this paper, we revisit and modify that construction to obtain a convex set with \(C^{1,1}\) boundary which possesses the same property.     

Ragnar Frisch and interior-point methods

The distinguished econometrician Ragnar Frisch (1895–1973) also played an important role in optimization theory. In fact, he was a pioneer of interior-point methods. This note reconsiders his contribution, relating it to history and modern developments.     

Algorithm and code optimizations for real-time passive ranging by imaging detection on single DSP

Monocular vision-based passive ranging system is attractive for potential applications in navigation, transportation and traffic control, robotics, and air defense. Conventionally system estimates target distance by using imaging direction and distance-related features, and the latter are extracted from the image sequence. It is not only challenging to DSP device hardware capability but also to programming optimization that to transplant the traditional feature extraction algorithm to a real-time system due to the complexity and time-consuming. In this paper, a simplified scale invariant feature transform image matching algorithm and code optimization procedure are developed, and the improvement of operation speed is demonstrated clearly. For an image sequence with size of \(256\times 256\) pixels, the operation speed was improved to 25–27 frames per second from 4 s per frame by using a single C64x+ DSP core, which meets the requirements of real-time ranging algorithm perfectly while the ranging error is less than \(7\,\%\).     

A Control Lyapunov Function Approach to Stabilization of Affine Nonlinear Systems with Bounded Uncertain Parameters

This paper considers the robust stabilization problem of a class of affine nonlinear systems with bounded uncertain time-invariant parameters. A robust control Lyapunov function (RCLF) is introduced for the considered system. Based on the RCLF, a globally asymptotically stabilizing controller is then designed. The proposed controller is robust under the variant of system parameters. As the applications of the proposed scheme, the stabilization of uncertain feedback linearizable systems and the unified chaotic system are investigated, respectively. A numerical example on the unified chaotic system is also provided to illustrate the effectiveness of the presented method.