Optimal <Emphasis Type="Italic">L</Emphasis><Superscript>1</Superscript>-Control in Coefficients for Dirichlet Elliptic Problems: <Emphasis Type="Italic">W</Emphasis>-Optimal Solutions

In this paper, we study a Dirichlet optimal control problem associated with a linear elliptic equation the coefficients of which we take as controls in the class of integrable functions. The coefficients may degenerate and, therefore, the problems may exhibit the so-called Lavrentieff phenomenon and non-uniqueness of weak solutions. We consider the solvability of this problem in the class of W-variational solutions. Using a concept of variational convergence of constrained minimization problems in variable spaces, we prove the existence of W-solutions to the optimal control problem and provide the way for their approximation. We emphasize that control problems of this type are important in material and topology optimization as well as in damage or life-cycle optimization.     

基于SOM&SVM组合分类器的客户细分方法实证研究

为解决传统的RFM客户细分方法还不能很好地刻画客户行为,同时也没有就RFM指标权重进行分析这一问题,在RFM指标的基础上扩充了客户细分的指标体系,并提出了基于AHP的RFM指标权重确定策略.鉴于传统的单一分类器存在的很多缺陷,提出基于SOM&SVM的组合分类器模型,充分利用SOM和SVM单一分类器各自的优点,综合两种分类器的分类信息,避免单一分类器可能存在的片面性,从而提高分类的准确性.最后通过实例对上述模型的有效性进行验证.     

Bayesian neural network learning for repeat purchase modelling in direct marketing

We focus on purchase incidence modelling for a European direct mail company. Response models based on statistical and neural network techniques are contrasted. The evidence framework of MacKay is used as an example implementation of Bayesian neural network learning, a method that is fairly robust with respect to problems typically encountered when implementing neural networks. The automatic relevance determination (ARD) method, an integrated feature of this framework, allows us to assess the relative importance of the inputs. The basic response models use operationalisations of the traditionally discussed Recency, Frequency and Monetary (RFM) predictor categories. In a second experiment, the RFM response framework is enriched by the inclusion of other (non-RFM) customer profiling predictors. We contribute to the literature by providing experimental evidence that: (1) Bayesian neural networks offer a viable alternative for purchase incidence modelling; (2) a combined use of all three RFM predictor categories is advocated by the ARD method; (3) the inclusion of non-RFM variables allows to significantly augment the predictive power of the constructed RFM classifiers; (4) this rise is mainly attributed to the inclusion of customer/company interaction variables and a variable measuring whether a customer uses the credit facilities of the direct mailing company.     

Multi-Duality in Minimal Surface—Type Problems

The multi-duality of the nonlinear variational problem inf J(u, Λu) is studied for minimal surfaces-type problems. By using the method developed by Gao and Strang [1], the Fenchel-Rockafellar's duality theory is generalized to the problems with affine operator Λ. Two dual variational principles are established for nonparametric surfaces with constant mean curvature. We show that for the same primal problem, there may exist different dual problems. The primal problem may or may not possess a solution, whereas each dual problem possesses a unique solution. An evolutionary method for solving the nonlinear optimal-shape design problem is presented with numerical results.     

An <Emphasis Type="BoldItalic">O</Emphasis>(<Emphasis Type="BoldItalic">h</Emphasis><Superscript><Emphasis Type="Bold">6</Emphasis></Superscript>) numerical solution of general nonlinear fifth-order two point boundary value problems

A sixth-order numerical scheme is developed for general nonlinear fifth-order two point boundary-value problems. The standard sextic spline for the solution of fifth order two point boundary-value problems gives only O(h ²) accuracy and leads to non-optimal approximations. In order to derive higher orders of accuracy, high order perturbations of the problem are generated and applied to construct the numerical algorithm. O(h ⁶) global error estimates obtained for these problems. The convergence properties of the method is studied. This scheme has been applied to the system of nonlinear fifth order two-point boundary value problem too. Numerical results are given to illustrate the efficiency of the proposed method computationally. Results from the numerical experiments, verify the theoretical behavior of the orders of convergence.     

<Emphasis Type="Bold">NP</Emphasis> -Hardness of Largest Contained and Smallest Containing Simplices for <Emphasis Type="Italic">V</Emphasis>- and <Emphasis Type="Italic">H</Emphasis>-Polytopes

   Abstract. The problem of finding a d -simplex of maximum volume in an arbitrary d -dimensional V -polytope, for arbitrary d , was shown by Gritzmann et al. [GKL] in 1995 to be NP-hard. They conjectured that the corresponding problem for H -polytopes is also NP-hard. This paper presents a unified way of proving the NP-hardness of both these problems. The approach also yields NP-hardness proofs for the problems of finding d -simplices of minimum volume containing d -dimensional V - or H -polytopes. The polytopes that play the key role in the hardness proofs are truncations of simplices. A construction is presented which associates a truncated simplex to a given directed graph, and the hardness results follow from the hardness of detecting whether a directed graph has a partition into directed triangles.     

On <Emphasis Type="Italic">G</Emphasis>-invex multiobjective programming. Part II. Duality

This paper represents the second part of a study concerning the so-called G-multiobjective programming. A new approach to duality in differentiable vector optimization problems is presented. The techniques used are based on the results established in the paper: On G-invex multiobjective programming. Part I. Optimality by T.Antczak. In this work, we use a generalization of convexity, namely G-invexity, to prove new duality results for nonlinear differentiable multiobjective programming problems. For such vector optimization problems, a number of new vector duality problems is introduced. The so-called G-Mond–Weir, G-Wolfe and G-mixed dual vector problems to the primal one are defined. Furthermore, various so-called G-duality theorems are proved between the considered differentiable multiobjective programming problem and its nonconvex vector G-dual problems. Some previous duality results for differentiable multiobjective programming problems turn out to be special cases of the results described in the paper.     

On a nonstandard problem for heat conduction in a cylinder

Decay bounds are derived for the solution of a heat conduction problem in a semi-infinite cylinder when the lateral surface is held at zero temperature, a nonzero temperature is prescribed on the finite base, and the temperature at time T is prescribed to be a constant multiple of the temperature at initial time. Both energy and pointwise decay bounds are computed for a range of values of the constant multiple. Such problems were originally introduced as a means of stabilizing the backward-in-time problem for the heat equation.     

Finite groups with a <Emphasis Type="Italic">D</Emphasis>-block of cardinality 3

The results of this paper are connected with one of the main problems of the representation theory, the problem of dependence between the character table of a finite group and its abstract structure. Finite groups that have a D-block of cardinality 3 for some normal subset D are investigated. Some properties of classical p-blocks (where p is a prime number) consisting of three irreducible characters are also obtained.     

Systems of pairs of <Emphasis Type="Italic">q</Emphasis>-distant representatives,and graph colorings

The NP-completeness of a number of graph coloring problems related to the frequency assignment problem is proved. For this purpose, we introduce problems concerning systems of pairs of q-distant representatives (which are related to the well-known problem about the system of distinct representatives, but are NP-complete for q 2), which turned out to be convenient for proving the NP-completeness of various graph coloring problems. Bibliography: 11 titles.Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 293, 2002, pp. 5–25.This revised version was published online in April 2005 with a corrected cover date and article title.     

Spatial behaviour of solutions of the dual‐phase‐lag heat equation

In this paper we study the spatial behaviour of solutions of some problems for the dual‐phase‐lag heat equation on a semi‐infinite cylinder. The theory of dual‐phase‐lag heat conduction leads to a hyperbolic partial differential equation with a third derivative with respect to time. First, we investigate the spatial evolution of solutions of an initial boundary‐value problem with zero boundary conditions on the lateral surface of the cylinder. Under a boundedness restriction on the initial data, an energy estimate is obtained. An upper bound for the amplitude term in this estimate in terms of the initial and boundary data is also established. For the case of zero initial conditions, a more explicit estimate is obtained which shows that solutions decay exponentially along certain spatial‐time lines. A class of non‐standard problems is also considered for which the temperature and its first two time derivatives at a fixed time T are assumed proportional to their initial values. Copyright © 2004 John Wiley & Sons, Ltd.     

Second Order Elliptic Differential-Operator Equations with Unbounded Operator Boundary Conditions in <Emphasis Type="Italic">UMD</Emphasis> Banach Spaces

In a UMD Banach space E, we consider a boundary value problem for a second order elliptic differential-operator equation with a spectral parameter when one of the boundary conditions, in the principal part, contains a linear unbounded operator in E. A theorem on an isomorphism is proved and an appropriate estimate of the solution with respect to the space variable and the spectral parameter is obtained. In this way, Fredholm property of the problem is shown. Moreover, discreteness of the spectrum and completeness of a system of root functions corresponding to the homogeneous problem are established. Finally, applications of obtained abstract results to nonlocal boundary value problems for elliptic differential equations with a parameter in non-smooth domains are given.     

Perfect colorings of the Johnson graphs <Emphasis Type="Italic">J</Emphasis>(8, 3) and <Emphasis Type="Italic">J</Emphasis>(8, 4) with two colors

In this article the parameter matrices are enumerated of all perfect 2-colorings of the Johnson graphs J(8, 3) and J(8, 4), and several constructions are presented for perfect 2-coloring of J(2w, w) and J(2m, 3). The concept of a perfect coloring generalizes the concept of completely regular code introduced by P. Delsarte. The problem of existence of similar structures in Johnson graphs is closely related to the problem of existence of completely regular codes in Johnson graphs and, in particular, to the Delsarte conjecture on the nonexistence of nontrivial perfect codes in Johnson graphs, the problem of existence of block designs, and other well-known problems.     

Elliptic optimal control problems with <Emphasis Type="Italic">L</Emphasis><Superscript>1</Superscript>-control cost and applications for the placement of control devices

Elliptic optimal control problems with L ¹-control cost are analyzed. Due to the nonsmooth objective functional the optimal controls are identically zero on large parts of the control domain. For applications, in which one cannot put control devices (or actuators) all over the control domain, this provides information about where it is most efficient to put them. We analyze structural properties of L ¹-control cost solutions. For solving the non-differentiable optimal control problem we propose a semismooth Newton method that can be stated and analyzed in function space and converges locally with a superlinear rate. Numerical tests on model problems show the usefulness of the approach for the location of control devices and the efficiency of our algorithm.     

A new full-Newton step <Emphasis Type="Italic">O</Emphasis>(<Emphasis Type="Italic">n</Emphasis>) infeasible interior-point algorithm for semidefinite optimization

Interior-point methods for semidefinite optimization have been studied intensively, due to their polynomial complexity and practical efficiency. Recently, the second author designed a primal-dual infeasible interior-point algorithm with the currently best iteration bound for linear optimization problems. Since the algorithm uses only full Newton steps, it has the advantage that no line-searches are needed. In this paper we extend the algorithm to semidefinite optimization. The algorithm constructs strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem, close to their central paths. Two types of full-Newton steps are used, feasibility steps and (ordinary) centering steps, respectively. The algorithm starts from strictly feasible iterates of a perturbed pair, on its central path, and feasibility steps find strictly feasible iterates for the next perturbed pair. By using centering steps for the new perturbed pair, we obtain strictly feasible iterates close enough to the central path of the new perturbed pair. The starting point depends on a positive number ζ. The algorithm terminates either by finding an ε-solution or by detecting that the primal-dual problem pair has no optimal solution (X ^*,y ^*,S ^*) with vanishing duality gap such that the eigenvalues of X ^* and S ^* do not exceed ζ. The iteration bound coincides with the currently best iteration bound for semidefinite optimization problems.     

The max-cut problem and quadratic 0–1 optimization; polyhedral aspects,relaxations and bounds

Given a graphG, themaximum cut problem consists of finding the subsetS of vertices such that the number of edges having exactly one endpoint inS is as large as possible. In the weighted version of this problem there are given real weights on the edges ofG, and the objective is to maximize the sum of the weights of the edges having exactly one endpoint in the subsetS. In this paper, we consider the maximum cut problem and some related problems, likemaximum-2-satisfiability, weighted signed graph balancing. We describe the relation of these problems to the unconstrained quadratic 0–1 programming problem, and we survey the known methods for lower and upper bounds to this optimization problem. We also give the relation between the related polyhedra, and we describe some of the known and some new classes of facets for them.     

The <Emphasis Type="Italic">K</Emphasis>th-Best Approach for Linear Bilevel Multi-follower Programming

The majority of research on bilevel programming has centered on the linear version of the problem in which only one leader and one follower are involved. This paper addresses linear bilevel multi-follower programming (BLMFP) problems in which there is no sharing information among followers. It explores the theoretical properties of linear BLMFP, extends the Kth-best approach for solving linear BLMFP problems and gives a computational test for this approach.     

Preconditioning trace coupled 3d‐1d systems using fractional Laplacian

Multiscale or multiphysics problems often involve coupling of partial differential equations posed on domains of different dimensionality. In this work, we consider a simplified model problem of a 3d‐1d coupling and the main objective is to construct algorithms that may utilize standard multilevel algorithms for the 3d domain, which has the dominating computational complexity. Preconditioning for a system of two elliptic problems posed, respectively, in a three‐dimensional domain and an embedded one dimensional curve and coupled by the trace constraint is discussed. Investigating numerically the properties of the well‐defined discrete trace operator, it is found that negative fractional Sobolev norms are suitable preconditioners for the Schur complement of the system. The norms are employed to construct a robust block diagonal preconditioner for the coupled problem.     

One‐level and two‐level finite element methods for the Boussinesq problem

Previous works on the convergence of numerical methods for the Boussinesq problem were conducted, while the optimal L²‐norm error estimates for the velocity and temperature are still lacked. In this paper, the backward Euler scheme is used to discrete the time terms, standard Galerkin finite element method is adopted to approximate the variables. The MINI element is used to approximate the velocity and pressure, the temperature field is simulated by the linear polynomial. Under some restriction on the time step, we firstly present the optimal L² error estimates of approximate solutions. Secondly, two‐level method based on Stokes iteration for the Boussinesq problem is developed and the corresponding convergence results are presented. By this method, the original problem is decoupled into two small linear subproblems. Compared with the standard Galerkin method, the two‐level method not only keeps good accuracy but also saves a lot of computational cost. Finally, some numerical examples are provided to support the established theoretical analysis.