Constraint incorporation in optimization

Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations) cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods, barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework relies on addition and chain rules for constraint incorporation which we develop here.     

Division and <Emphasis Type="Italic">k</Emphasis>-th root theorems for <Emphasis Type="Italic">Q</Emphasis>-manifolds

We prove that a locally compact ANR-space X is a Q-manifold if and only if it has the Disjoint Disk Property (DDP), all points of X are homological Z _∞-points and X has the countable-dimensional approximation property (cd-AP), which means that each map f: K → X of a compact polyhedron can be approximated by a map with the countable-dimensional image. As an application we prove that a space X with DDP and cd-AP is a Q-manifold if some finite power of X is a Q-manifold. If some finite power of a space X with cd-AP is a Q-manifold, then X ² and X × [0, 1] are Q-manifolds as well. We construct a countable family χ of spaces with DDP and cd-AP such that no space X ∈ χ is homeomorphic to the Hilbert cube Q whereas the product X × Y of any different spaces X, Y ∈ χ is homeomorphic to Q. We also show that no uncountable family χ with such properties exists. This work was supported by the Slovenian-Ukrainian (Grant No. SLO-UKR 04-06/07)     

A Spherical Decomposition for Riemannian Open 3-Manifolds

We show that open 3-manifolds that have a locally finite decomposition along 2-spheres are characterized by the existence of a Riemannian metric with respect to which the second homotopy group of the manifold is generated by small elements. Received: November 2005 Revision: February 2006 Accepted: May 2006     

Lagrangian skeletons,periodic geodesic flows and symplectic cuttings

In this paper, we investigate symplectic manifolds endowed with a Morse–Bott function with only two critical submanifolds, one of which is Lagrangian while the other one is symplectic.     

Prime Fano threefolds and integrable systems

For a general K3 surface S of genus g, with 2 ≤ g ≤ 10, we prove that the intermediate Jacobians of the family of prime Fano threefolds of genus g containing S as a hyperplane section, form generically an algebraic completely integrable Hamiltonian system. The first author is partially supported by grant MI1503/2005 of the Bulgarian Foundation for Scientific Research.     

Primes in quadratic progressions on average

In this paper, we establish a theorem on the distribution of primes in quadratic progressions on average.     

Inverse problems for a mathematical model of redox sorption

We consider a mathematical model of sorption that allows for external diffusion kinetics and a redox reaction. Two inverse problems are considered for this model, uniqueness is proved, and numerical solution methods are proposed. The efficiency of the numerical methods is investigated by computer experiments. __________ Translated from Prikladnaya Matematika i Informatika, No. 23, pp. 15–23, 2006.     

Scale-free behavior of the Internet global performance

Measurements and data analysis have proved very effective in the study of the Internet's physical fabric and have shown heterogeneities and statistical fluctuations extending over several orders of magnitude. Here we focus on the relationship between the Round-Trip-Time (RTT) and the geographical distance. We define dimensionless variables that contain information on the quality of Internet connections finding that their probability distributions are characterized by a slow power-law decay signalling the presence of scale-free features. These results point out the extreme heterogeneity of Internet delay since the transmission speed between different points of the network exhibits very large fluctuations. The associated scaling exponents appear to have fairly stable values in different data sets and thus define an invariant characteristic of the Internet that might be used in the future as a benchmark of the overall state of “health” of the Internet. Received 25 January 2003 Published online 7 May 2003     

CAS based approach for discussing subset construction

This paper continues the discussion of teaching nondeterminism (see [6]) where we presented a didactic approach introducing the notion of nondeterministic automata. Although in this paper we use the same methodology we have to face up to new didactic challenges. Namely, teaching the subset construction requires answers to the question how can CAS be used in teaching the different phases of mathematical problem solving so that we can reach higher cognitive efficiency.