Penalty and Augmented Lagrangian Methods for Constrained DC Programming

In this paper, we consider a class of structured nonsmooth difference-of-convex (DC) constrained DC programs in which the first convex component of the objective and constraints is the sum of a smooth and a nonsmooth function, and their second convex component is the supremum of finitely many convex smooth functions. The existing methods for this problem usually have a weak convergence guarantee or require a feasible initial point. Inspired by the recent work by Pang et al. [Pang J-S, Razaviyayn M, Alvarado A (2017) Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. 42(1):95–118.], in this paper, we propose two infeasible methods with a strong convergence guarantee for the considered problem. The first one is a penalty method that consists of finding an approximate D-stationary point of a sequence of penalty subproblems. We show that any feasible accumulation point of the solution sequence generated by such a penalty method is a B-stationary point of the problem under a weakest possible assumption that it satisfies a pointwise Slater constraint qualification (PSCQ). The second one is an augmented Lagrangian (AL) method that consists of finding an approximate D-stationary point of a sequence of AL subproblems. Under the same PSCQ condition as for the penalty method, we show that any feasible accumulation point of the solution sequence generated by such an AL method is a B-stationary point of the problem, and moreover, it satisfies a Karush–Kuhn–Tucker type of optimality condition for the problem, together with any accumulation point of the sequence of a set of auxiliary Lagrangian multipliers. We also propose an efficient successive convex approximation method for computing an approximate D-stationary point of the penalty and AL subproblems. Finally, some numerical experiments are conducted to demonstrate the efficiency of our proposed methods.

On Singularities of Certain Non-linear Second-Order Ordinary Differential Equations

The method of blowing up points of indeterminacy of certain systems of two ordinary differential equations is applied to obtain information about the singularity structure of the solutions of the corresponding non-linear differential equations. We first deal with the so-called Painlevé example, which passes the Painlevé test, but the solutions have more complicated singularities. Resolving base points in the equivalent system of equations we can explain the complicated structure of singularities of the original equation. The Smith example has a solution with non-isolated singularity, which is an accumulation point of algebraic singularities. Smith’s equation can be written as a system in two ways. We show that the sequence of blow-ups for both systems can be infinite. Another example that we consider is the Painlevé-Ince equation. When the usual Painlevé analysis is applied, it possesses both positive and negative resonances. We show that for three equivalent systems there is an infinite sequence of blow-ups and another one that terminates, which further gives a Laurent expansion of the solution around a movable pole. Moreover, for one system it is even possible to obtain the general solution after a sequence of blow-ups.

Optimality Conditions, Qualifications and Approximation Method for a Class of Non-Lipschitz Mathematical Programs with Switching Constraints

In this paper, we consider a class of mathematical programs with switching constraints (MPSCs) where the objective involves a non-Lipschitz term. Due to the non-Lipschitz continuity of the objective function, the existing constraint qualifications for local Lipschitz MPSCs are invalid to ensure that necessary conditions hold at the local minimizer. Therefore, we propose some MPSC-tailored qualifications which are related to the constraints and the non-Lipschitz term to ensure that local minimizers satisfy the necessary optimality conditions. Moreover, we study the weak, Mordukhovich, Bouligand, strongly (W-, M-, B-, S-) stationay, analyze what qualifications making local minimizers satisfy the (M-, B-, S-) stationay, and discuss the relationship between the given MPSC-tailored qualifications. Finally, an approximation method for solving the non-Lipschitz MPSCs is given, and we show that the accumulation point of the sequence generated by the approximation method satisfies S-stationary under the second-order necessary condition and MPSC Mangasarian-Fromovitz (MF) qualification.

A New Sequential Optimality Condition of Cardinality-Constrained Optimization Problem and Application

In this paper, we consider the cardinality-constrained optimization problem and propose a new sequential optimality condition for the continuous relaxation reformulation which is popular recently. It is stronger than the existing results and is still a first-order necessity condition for the cardinality constraint problem without any additional assumptions. Meanwhile, we provide a problem-tailored weaker constraint qualification, which can guarantee that new sequential conditions are Mordukhovich-type stationary points. On the other hand, we improve the theoretical results of the augmented Lagrangian algorithm. Under the same condition as the existing results, we prove that any feasible accumulation point of the iterative sequence generated by the algorithm satisfies the new sequence optimality condition. Furthermore, the algorithm can converge to the Mordukhovich-type (essentially strong) stationary point if the problem-tailored constraint qualification is satisfied.

Closure System and Its Semantics

It is well known that topological spaces are axiomatically characterized by the topological closure operator satisfying the Kuratowski Closure Axioms. Equivalently, they can be axiomatized by other set operators encoding primitive semantics of topology, such as interior operator, exterior operator, boundary operator, or derived-set operator (or dually, co-derived-set operator). It is also known that a topological closure operator (and dually, a topological interior operator) can be weakened into generalized closure (interior) systems. What about boundary operator, exterior operator, and derived-set (and co-derived-set) operator in the weakened systems? Our paper completely answers this question by showing that the above six set operators can all be weakened (from their topological counterparts) in an appropriate way such that their inter-relationships remain essentially the same as in topological systems. Moreover, we show that the semantics of an interior point, an exterior point, a boundary point, an accumulation point, a co-accumulation point, an isolated point, a repelling point, etc. with respect to a given set, can be extended to an arbitrary subset system simply by treating the subset system as a base of a generalized interior system (and hence its dual, a generalized closure system). This allows us to extend topological semantics, namely the characterization of points with respect to an arbitrary set, in terms of both its spatial relations (interior, exterior, or boundary) and its dynamic convergence of any sequence (accumulation, co-accumulation, and isolation), to much weakened systems and hence with wider applicability. Examples from the theory of matroid and of Knowledge/Learning Spaces are used as an illustration.

The Second-Order Differential Equation System with the Controlled Process for Variational Inequality with Constraints

In this paper, the variational inequality with constraints can be viewed as an optimization problem. Using Lagrange function and projection operator, the equivalent operator equations for the variational inequality with constraints under the certain conditions are obtained. Then, the second-order differential equation system with the controlled process is established for solving the variational inequality with constraints. We prove that any accumulation point of the trajectory of the second-order differential equation system is a solution to the variational inequality with constraints. In the end, one example with three kinds of different cases by using this differential equation system is solved. The numerical results are reported to verify the effectiveness of the second-order differential equation system with the controlled process for solving the variational inequality with constraints.

Palynological evidence from a sub-alpine marsh of enhanced Little Ice Age snowpack in the Marrakech High Atlas, North Africa

The grazing lands of the High Atlas are vulnerable to climate change and the decline of traditional management practices. However, prior to the mid-20th century, there is little information to examine historical environmental change and resilience to past climate variability. Here, we present a new pollen, non-pollen palynomorph (NPP) and microcharcoal record from a sub-alpine marsh (pozzine) at Oukaïmeden, located in the Marrakech High Atlas, Morocco. The record reveals a history of grazing impacts with diverse non-arboreal pollen assemblages dominant throughout the record as well as recurrent shifts between wetter and drier conditions. A large suite of radiocarbon dates (n = 22) constrains the deposit to the last ~ 1,000 years although multiple reversed ages preclude development of a robust age-depth model for all intervals. Between relatively dry conditions during the Medieval period and in the 20th century, intervening wet conditions are observed, which we interpret as a locally enhanced snowpack during the Little Ice Age. Hydrological fluctuations evidenced by wetland pollen and NPPs are possibly associated with centennial-scale precipitation variability evidenced in regional speleothem records. The pollen record reveals an herbaceous grassland flora resilient against climatic fluctuations through the last millennium, possibly supported by sustainable collective management practices (agdal), with grazing indicators suggesting a flourishing pastoral economy. However, during the 20th century, floristic changes and increases in charcoal accumulation point to a decline in management practices, diversification of land-use (including afforestation) and intensification of human activity.

Local stabilization of viscous Burgers equation with memory

<p style='text-indent:20px;'>In this article, we study the local stabilization of the viscous Burgers equation with memory around the steady state zero using localized interior controls. We first consider the linearized equation around zero which corresponds to a system coupled between a parabolic equation and an ODE. We show the feedback stabilization of the system with any exponential decay <inline-formula><tex-math id="M1">\begin{document}$ -\omega $\end{document}</tex-math></inline-formula>, where <inline-formula><tex-math id="M2">\begin{document}$ \omega\in (0, \omega_0) $\end{document}</tex-math></inline-formula>, for some <inline-formula><tex-math id="M3">\begin{document}$ \omega_0&gt;0 $\end{document}</tex-math></inline-formula>, using a finite dimensional localized interior control. The control is obtained from the solution of a suitable degenerate Riccati equation. We do an explicit analysis of the spectrum of the corresponding linearized operator. In fact, <inline-formula><tex-math id="M4">\begin{document}$ \omega_0 $\end{document}</tex-math></inline-formula> is the unique accumulation point of the spectrum of the operator. We also show that the system is not stabilizable with exponential decay <inline-formula><tex-math id="M5">\begin{document}$ -\omega $\end{document}</tex-math></inline-formula>, where <inline-formula><tex-math id="M6">\begin{document}$ \omega&gt;\omega_0 $\end{document}</tex-math></inline-formula>, using any <inline-formula><tex-math id="M7">\begin{document}$ L^2 $\end{document}</tex-math></inline-formula>-control. Finally, we obtain the local stabilization result for the nonlinear system by means of the feedback control stabilizing the linearized system using the Banach fixed point theorem.</p>

Formalization of the Equivalence among Completeness Theorems of Real Number in Coq

The formalization of mathematics based on theorem prover becomes increasingly important in mathematics and computer science, and, particularly, formalizing fundamental mathematical theories becomes especially essential. In this paper, we describe the formalization in Coq of eight very representative completeness theorems of real numbers. These theorems include the Dedekind fundamental theorem, Supremum theorem, Monotone convergence theorem, Nested interval theorem, Finite cover theorem, Accumulation point theorem, Sequential compactness theorem, and Cauchy completeness theorem. We formalize the real number theory strictly following Landau’s Foundations of Analysis where the Dedekind fundamental theorem can be proved. We extend this system and complete the related notions and properties for finiteness and sequence. We prove these theorems in turn from Dedekind fundamental theorem, and finally prove the Dedekind fundamental theorem by the Cauchy completeness theorem. The full details of formal proof are checked by the proof assistant Coq, which embodies the characteristics of reliability and interactivity. This work can lay the foundation for many applications, especially in calculus and topology.

Semigroups of Isometries of the Hyperbolic Plane

Motivated by a problem on the dynamics of compositions of plane hyperbolic isometries, we prove several fundamental results on semigroups of isometries, thought of as real Möbius transformations. We define a semigroup $S$ of Möbius transformations to be semidiscrete if the identity map is not an accumulation point of $S$. We say that $S$ is inverse free if it does not contain the identity element. One of our main results states that if $S$ is a semigroup generated by some finite collection $\mathcal{F}$ of Möbius transformations, then $S$ is semidiscrete and inverse free if and only if every sequence of the form $F_n=f_1\dotsb f_n$, where $f_n\in \mathcal{F}$, converges pointwise on the upper half-plane to a point on the ideal boundary, where convergence is with respect to the chordal metric on the extended complex plane. We fully classify all two-generator semidiscrete semigroups and include a version of Jørgensen’s inequality for semigroups. We also prove theorems that have familiar counterparts in the theory of Fuchsian groups. For instance, we prove that every semigroup is one of four standard types: elementary, semidiscrete, dense in the Möbius group, or composed of transformations that fix some nontrivial subinterval of the extended real line. As a consequence of this theorem, we prove that, with certain minor exceptions, a finitely generated semigroup $S$ is semidiscrete if and only if every two-generator semigroup contained in $S$ is semidiscrete. After this we examine the relationship between the size of the “group part” of a semigroup and the intersection of its forward and backward limit sets. In particular, we prove that if $S$ is a finitely generated nonelementary semigroup, then $S$ is a group if and only if its two limit sets are equal. We finish by applying some of our methods to address an open question of Yoccoz.