Discrete global descent method for discrete global optimization and nonlinear integer programming

A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function. The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer variables and up to 1.38 × 10¹⁰⁴ feasible points have demonstrated the applicability and efficiency of the proposed method.     

具有生产性与福利性公共支出的随机内生增长模型

文章建立一个随机内生增长模型来阐明主要政策参数对经济增长与社会福利的影响.若对生产函数、效用函数、偏好及随机干扰作一些特殊的假设,我们证明了主要政策参数的均衡值能被模型参数唯一决定.进一步我们还得到了期望增长率与储蓄的清晰解.文章的最后,我们证明了政府支出直接影响个体决策者的决策:即提高经济增长率将减少福利;反之,增加福利将减少增长率.     

Continuous modified Newton’s-type method for nonlinear operator equations

A nonlinear operator equation F(x)=0, F:H→H, in a Hilbert space is considered. Continuous Newton’s-type procedures based on a construction of a dynamical system with the trajectory starting at some initial point x ₀ and becoming asymptotically close to a solution of F(x)=0 as t→+∞ are discussed. Well-posed and ill-posed problems are investigated. Received: June 29, 2001; in final form: February 26, 2002?Published online: February 20, 2003 This paper was finished when AGR was visiting Institute for Theoretical Physics, University of Giessen. The author thanks DAAD for support     

Solving a class of multiplicative programming problems via c-programming

In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques.     

Pattern Search Method for Discrete <Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript>–Approximation

We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical experiments seem to be encouraging. This work was supported by M.U.R.S.T., Rome, Italy.     

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.     

Protein Conformation of a Lattice Model Using Tabu Search

We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model.     

多夹层板壳的非线性理论及应用（Ⅲ）：扁壳的弯曲和稳定

本文根据文[1]获得的多夹层扁壳非线性基本方程，求解了各种载荷及边界条件下矩形底面多夹层扁壳的非线性弯曲问题，多夹层板、扁柱亮在轴向压力作用下的稳定问题，以及一般形状的扁壳在边界作用力下的变形．     

A molecular network model to describe the nonlinear viscoelastic behavior of polymers

A transient molecular network model is built to describe the nonlinear viscoelasticity of polymers by considering the effect of entanglement loss and regeneration on the relaxation of molecular strands. It is an extension of previous network theories. The experimental data on three thermoplastic polymers (ABS, PVC and PA6) obtained under various loading conditions are used to test the model. Agreement between the theoretical and experimental curves shows that the suggested model can describe successfully the relaxation behavior of the thermoplastic polymers under different loading rates by using relatively few relaxation modes. Thus the micromechanism responsible for strain-rate dependence of relaxation process and the origin of nonlinear viscoelasticity may be disclosed. The project supported by the National Natural Science Foundation of China and Doctorial Fund     

Nonlinear and chaotic oscillations of a constrained cantilevered pipe conveying fluid: A full nonlinear analysis

In this paper, the planar dynamics of a nonlinearly constrained pipe conveying fluid is examined numerically, by considering the full nonlinear equation of motions and a refined trilinear-spring model for the impact constraints—completing the circle of several studies on the subject. The effect of varying system parameters is investigated for the two-degree-of-freedom (N=2) model of the system, followed by less extensive similar investigations forN=3 and 4. Phase portraits, bifurcation diagrams, power spectra and Lyapunov exponents are presented for a selected set of system parameters, showing some rather interesting, and sometimes unexpected, results. The numerical results are compared with experimental ones obtained previously. It is found that in the parameter space that includesN, there exists a subspace wherein excellent qualitative, and reasonably good (N=2) to excellent (N=4) quantitative agreement with experiment. In the latter case, excellent agreement is not only obtained in the threshold flow velocities (u) for the key bifurcations, but the inclusion of the nonlinear terms improves agreement with experiment in terms of amplitudes of motion and by capturing features of behaviour not hitherto predicted by theory.