基于核函数求解线性互补问题的不可行内点算法

本文研究了线性互补问题内点算法.利用全牛顿步长求解迭代方向,获得了算法迭代复杂性为O(nlogn/ε),推广了Roos等关于线性规划问题不可行内点算法,其复杂性与目前最好的不可行内点算法复杂性一致.     

一种求解不等式约束优化问题的光滑化算法

利用光滑函数建立了不等式约束优化问题KT条件的一个扰动方程组,提出了一个新的内点型算法.该算法在有限步终止时当前迭代点即为优化问题的一个精确稳定点.在一定条件下算法具有全局收敛性,数值试验表明该算法是有效的.     

对称线性互补问题的乘性Schwarz算法

本文提出了求解对称性互补问题的乘性Schwarz算法,其中子问题用投影迭代方法求解.利用投影迭代算子的性质及投影迭代的收敛性,证明了算法产生的迭代点列的聚点为原互补问题的解,并在一定条件下,证明算法产生的迭代点列的聚点存在.     

一种新的逼近精确罚函数的罚函数及性质

针对可微非线性规划问题提出了一个新的逼近精确罚函数的罚函数形式,给出了近似逼近算法与渐进算法,并证明了近似算法所得序列若有聚点,则必为原问题最优解. 在较弱的假设条件下,证明了算法所得的极小点列有界,且其聚点均为原问题的最优解,并得到在Mangasarian-Fromovitz约束条件下,经过有限次迭代所得的极小点为可行点.     

张量方法在信赖域算法中的应用

信赖域算法是求解无约束优化问题的一种有效的算法.对于该算法的子问题,本文将原来目标函数的二次模型扩展成四次张量模型,提出了一个带信赖域约束的四次张量模型优化问题的求解算法.该方法的最大特点是:不仅在张量模型的非稳定点可以得到下降方向及相应的迭代步长,而且在非局部极小值点的稳定点也可以得到下降方向及相应的迭代步长,从而在算法产生的迭代点列中存在一个子列收敛到信赖域子问题的局部极小值点.     

一种改进的无约束非光滑优化问题的信赖域算法

本文提出了一种新的求解无约束非光滑优化问题的信赖域算法,并证明了该算法的迭代点列的任何聚点都是的问题的稳定点。     

单调线性互补问题的一种内点算法

本文研究了单调线性互补问题的一种内点算法.利用牛顿方向和中心路径方向,获得了求解单调线性互补问题的一种内点算法,并证明该算法经过多项式次迭代之后收敛到原问题的一个最优解.数值实验表明此方法是有效的.     

最小权点覆盖问题的一个近似算法

在点、边赋权的简单图中,关于最小权点覆盖问题,以经典的最短路算法-Dijkstra算法为基础,提出了一个求解该问题的近似算法.首先,在给定的赋权图中任选一点作为初始点,并给出允许集及相关定义.然后,利用经典的最短路算法-Dijkstra算法,求出初始点到允许集中各顶点的最短路径,并按照一定的原则选择近似最小权点覆盖集.最后,通过算例阐释了算法的实现过程的合理性及有效性.     

求解线性互补问题的一种新的势下降内点算法

本文针对具有半正定矩阵的线性互补问题提出了一个新的内点方法———势函数下降内点方法.采用部分校正技术和Sherman-Morrison-Woodbury准则获得问题的近似最优解.讨论了该算法的收敛性,并证明了该算法为多项式算法.     

不等式约束优化全局收敛的滤子线性方程组算法

设计了求解不等式约束非线性规划问题的一种新的滤子序列线性方程组算法,该算法每步迭代由减小约束违反度和目标函数值两部分构成.利用约束函数在某个中介点线性化的方法产生搜索方向.每步迭代仅需求解两个线性方程组,计算量较小.在一般条件下,证明了算法产生的无穷迭代点列所有聚点都是可行点并且所有聚点都是所求解问题的KKT点.     

Realizability of words in mosaic labyrinths

In this paper we study mosaic labyrinths with the help of words generated by them in the alphabet of labels attached to arcs and vertices of a labyrinth. We consider the problem of the characterization of words generated by a labyrinth. We propose a constructive recognition criterion, it defines whether a word is generated by a labyrinth or not. We establish conditions under which a word can be generated by a unique labyrinth, by a finite number of labyrinths, or by infinitely many labyrinths.     

Well-posedness by perturbations of mixed variational inequalities in Banach spaces

In this paper, we consider an extension of the notion of well-posedness by perturbations, introduced by Zolezzi for a minimization problem, to a mixed variational inequality problem in a Banach space. We establish some metric characterizations of the well-posedness by perturbations. We also show that under suitable conditions, the well-posedness by perturbations of a mixed variational inequality problem is equivalent to the well-posedness by perturbations of a corresponding inclusion problem and a corresponding fixed point problem. Also, we derive some conditions under which the well-posedness by perturbations of a mixed variational inequality is equivalent to the existence and uniqueness of its solution.     

Variational approach to scattering of plane elastic waves by diffraction gratings

The scattering of a time‐harmonic plane elastic wave by a two‐dimensional periodic structure is studied. The grating profile is given by a Lipschitz curve on which the displacement vanishes. Using a variational formulation in a bounded periodic cell involving a nonlocal boundary operator, existence of solutions in quasiperiodic Sobolev spaces is investigated by establishing the Fredholmness of the operator generated by the corresponding sesquilinear form. Moreover, by a Rellich identity, uniqueness is proved under the assumption that the grating profile is given by a Lipschitz graph. The direct scattering problem for transmission gratings is also investigated. In this case, uniqueness is proved except for a discrete set of frequencies. Copyright © 2010 John Wiley & Sons, Ltd.     

Further results on pinnacle sets

The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis, Nelson, Petersen, and Tenner and also results proven recently by Fang, this paper aims to add to our understanding of pinnacle sets by giving a simpler and more combinatorial proof of a weighted sum formula previously proven by Fang.     

Proof of the Branner-Hubbard conjecture on Cantor Julia sets

By means of a nested sequence of some critical pieces constructed by Kozlovski, Shen, and van Strien, and by using a covering lemma recently proved by Kahn and Lyubich, we prove that a component of the filled-in Julia set of any polynomial is a point if and only if its forward orbit contains no periodic critical components. It follows immediately that the Julia set of a polynomial is a Cantor set if and only if each critical component of the filled-in Julia set is aperiodic. This result was a conjecture raised by Branner and Hubbard in 1992. This work was supported by the National Natural Science Foundation of China     

Singular Double Porosity Model

We consider the linear parabolic equation describing the transport of a contaminant in a porous media crossed by a net of infinitely thin fractures. The permeability is very high in the fractures but very low in the porous blocks. We derive the homogenized model corresponding to a net of infinitely thin fractures, by means of the singular measures technique. We assume that these singular measures are supported by hyperplanes of codimension one. We prove in a second step that this homogenized model could be obtained indistinctly either by letting the fracture thickness, in the standard double porosity model, tend to zero, or by homogenizing a model with infinitely thin fractures.     

Optimal steady-state versus periodic operation in discrete systems

The problem of improving the optimal steady state of a discrete system by means of a suitable cyclic operation is discussed. Two sufficient conditions are found by negating a necessary condition and by following a frequency-domain approach, respectively. The connection between the two conditions is also shown.This work has been supported by the Consiglio Nazionale delle Ricerche, Rome, Italy.     

Stress-driven local-solution approach to quasistatic brittle delamination

A unilateral contact problem between elastic bodies at small strains glued by a brittle adhesive is addressed in the quasistatic rate-independent setting. The delamination process is modeled as governed by stresses rather than by energies. This leads to a specific scaling of an approximating elastic adhesive contact problem, discretized by a semi-implicit scheme and regularized by a BV-type gradient term. An analytical zero-dimensional example motivates the model and a specific local-solution concept. Two-dimensional numerical simulations performed on an engineering benchmark problem of debonding a fiber in an elastic matrix further illustrate the validity of the model, convergence, and algorithmical efficiency even for very rigid adhesives with high elastic moduli.     

Automation and group structures in certain economic adjustment mechanisms

It is shown that the economic adjustment mechanism developed by Hurwicz and his associates has the structure of automata. It is then shown that certain price adjustment mechanisms, having an acceptability condition, impose a group structure upon the automaton. This condition is a bilinear invariance implied by a budget constraint. Then the automaton is defined by a subgroup, depending on agents' tastes, technologies and strategies, and by the representations of the subgroup imposed by the automaton.