A TRUST REGION ALGORITHM VIA BILEVEL LINEAR PROGRAMMING FOR SOLVING THE GENERAL MULTICOMMODITY MINIMAL COST FLOW PROBLEMS

This paper proposes a nonmonotonic backtracking trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems.Using the duality theory of the linear programming and convex theory,the generalized directional derivative of the general multicommodity minimal cost flow problems is derived.The global convergence and superlinear convergence rate of the proposed algorithm are established under some mild conditions.

Integral Global Minimization of Constrained Problems with Discontinuous Penalty Functions

A class of discontinuous penalty functions was proposed to solve constrained minimization problems with the integral approach to global optimization, m-mean value and v-variance optimality conditions of a constrained and penalized minimization problem were investigated. A nonsequential algorithm was proposed. Numerical examples were given to illustrate the effectiveness of the algorithm.

Minimizing sequences of variational problems with small parameters

A class of variational problems with small parameters is studied. Their zeroth-order asymptotic solutions are constructed. It is shown that the zeroth-order asymptotic solution is just the minimizing sequence of variational problems as the small parameter approaches to zero.

Solving Large Scale Unconstrained Minimization Problems by a New ODE Numerical Integration Method

In reference [1], for large scale nonlinear equations , a new ODE solving method was given. This paper is a continuous work. Here has gradient structure i.e. , is a scalar function. The eigenvalues of the Jacobian of;or the Hessian of , are all real number. So the new method is very suitable for this structure. For quadratic function the convergence was proved and the spectral radius of iteration matrix was given and compared with traditional method. Examples show for large scale problems (dimension ) the new method is very efficient.

New Procedure of Finding an Initial Basic Feasible Solution of the Time Minimizing Transportation Problems

Minimization of transportation time is a great concern of the transportation problems like the cost minimizing transportation problems. In this writing, a transportation algorithm is developed and applied to obtain an Initial Basic Feasible Solution (IBFS) of transportation problems in minimizing transportation time. The developed method has also been illustrated numerically to test the efficiency of the method where it is observed that the proposed method yields a better result.

A Dual Approach for Solving Nonlinear Infinity-Norm Minimization Problems with Applications in Separable Cases

In this paper,we consider nonlinear infinity-norm minimization problems.We device a reliable Lagrangian dual approach for solving this kind of problems and based on this method we propose an algorithm for the mixed linear and nonlinear infinity- norm minimization problems.Numerical results are presented.

求解约束Minimax问题的神经网络模型

本文提出一种求解约束二次Minimax问题的神经网络模型 ,给出了它的Lyapunov能量函数 ,运用LaSalle不变性原理证明了它的大范围渐近稳定性 ,作为应用考察了L1范数极小化问题 .

EXISTENCE OF SOLUTIONS FOR PERIODIC BOUNDARY VALUE PROBLEMS FOR SECOND-ORDER INTEGRO-DIFFERENTIAL EQUATIONS

By establishing a comparison result and using monotone iterative methods, the theorem of existence for minimal and maximal solutions of periodic boundary value problems for second-order nonlinear integro-differential equations in Banach spaces is proved.

The Extremal Problem on Cartan-egg Domain of the First Type

In this paper,we study the extremal problem on Cartan-egg domain of the first type by using some inequalities.The extremal mapping and extremal value between the first type of Cartan-egg domain and the unit ball when k≤1 and k=2,m=2 are constructed.

Sparse Solutions of Mixed Complementarity Problems

In this paper, we consider an extragradient thresholding algorithm for finding the sparse solution of mixed complementarity problems (MCPs). We establish a relaxation l1 regularized projection minimization model for the original problem and design an extragradient thresholding algorithm (ETA) to solve the regularized model. Furthermore, we prove that any cluster point of the sequence generated by ETA is a solution of MCP. Finally, numerical experiments show that the ETA algorithm can effectively solve the l1 regularized projection minimization model and obtain the sparse solution of the mixed complementarity problem.

THE SOLUBILITY OF THE MULTIDIMENSIONAL TLS PROBLEM

A necessary and sufficient condition of the solubility far the multidimensional TLS problem is presented.

Viscosity approximation with weak contractions for fixed point problem,equilibrium problem,and variational inequality problem

This paper proposes a modified iterative algorithm using a viscosity approximation method with a weak contraction.The purpose is to find a common element of the set of common fixed points of an infinite family of nonexpansive mappings and the set of a finite family of equilibrium problems that is also a solution to a variational inequality.Under suitable conditions,some strong convergence theorems are established in the framework of Hilbert spaces.The results presented in the paper improve and extend the corresponding results of Colao et al.（Colao,V.,Acedo,G.L.,and Marino,G.An implicit method for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings.Nonlinear Anal.71,2708–2715（2009））,Plubtieng and Punpaeng（Plubtieng,S.and Punpaeng,R.A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces.J.Math.Anal.Appl.336,455–469（2007））,Colao et al.（Colao,V.,Marino,G.,and Xu,H.K.An iterative method for finding common solutions of equilibrium problem and fixed point problems.J.Math.Anal.Appl.344,340–352（2008））,Yao et al.（Yao,Y.,Liou,Y.C.,and Yao,J.C.Convergence theorem for equilibrium problems and fixed point problems of infinite family of nonexpansive mappings.Fixed Point Theory Application 2007,Article ID 64363（2007）DOI 10.1155/2007/64363）,and others.

A REMARK ON THE REGULARITY OF VECTOR-VALUED MAPPINGS DEPENDING ON TWO VARIABLES WHICH MINIMIZE SPLITTING-TYPE VARIATIONAL INTEGRALS

We combine the maximum principle for vector-valued mappings established by D＇Ottavio, Leonetti and Musciano [7] with regularity results from [5] and prove the Holder continuity of the first derivatives for local minimizers u： Ω→^R^N of splitting-type variational integrals provided Ω is a domain in R^2.

LOCAL DISCONTINUOUS GALERKIN METHOD FOR ELLIPTIC INTERFACE PROBLEMS

In this paper,the minimal dissipation local discontinuous Galerkin method is studied to solve the elliptic interface problems in two-dimensional domains.The interface may be arbitrary smooth curves.It is shown that the error estimates in L;-norm for the solution and the flux are O（h;|log h|）and O(h|log h|;),respectively.In numerical experiments,the successive substitution iterative methods are used to solve the LDG schemes.Numerical results verify the efficiency and accuracy of the method.

ON THE SINGULAR VARIATIONAL PROBLEMS

The authors deal with the singular variational problemS(α,b,λ0)as well asS= S(α,b,λ1,λ2)where Nm/N-m+m(b-a),α,β(?)1,E= D1α,m(RN). The aim of this paper is to show the existence of minimizer for 5(α, b,λ0) and S(α,b,λ1,λ2).

New Approach to Find Initial Basic Feasible Solution (IBFS) for Optimal Solution in Transportation Problem

Minimizing transportation time and getting optimal solutions are always considered as important factors while solving transportation problem. This paper shows a new approach for finding initial basic solution for transportation problem which reduces cost of transportation more than any transportation method such as LCM, northwest, Vogel’s approximation and so on. This method has been illustrated by taking an example;afterwards, it compares basic initial feasible solution with other methods IBF and optimal dictate solutions such as MODI and Steppingstone method.

热传导方程Robin系数反问题解的唯一性及正则化解的存在性

Robin系数在热传导模型中刻画了热传导区域边界上的热交换,是一类非常重要的参数,本文基于某小时段温度测量值反演热传导模型中的Robin系数.首先,在边界值以及测量值满足一定的光滑性条件时,给出了反问题解的唯一性;其次,基于Tikhonov正则化思想,通过构造目标泛函将反问题转化为求目标泛函的极小值,并证明了泛函极小元的存在性.

大型离散不适定问题的广义G-K双对角正则化算法

不适定问题常常出现于科学和工程等诸多领域,求解此类问题的难点在于其解对扰动的高度敏感性。正则化方法由于用与原不适定问题相邻近的适定问题的解逼近原问题的解,成为求解不适定问题的一类有效算法。近来,用不同范数分别约束保真项和正则项的极小化模型求解不适定问题的正则化方法引起了广泛关注。本文针对大型离散不适定问题的不同范数约束优化模型,基于Majorization-Minimization优化算法和Golub-Kahan Lanczos双对角化过程,采用基于偏差原理的正则化参数选择策略,提出了一种求解大型离散不适定问题的广义Golub-Kahan双对角化正则化算法,并给出了所提算法的收敛性理论证明。本文对新算法进行了数值实验,并与已有算法进行了比较,数值结果表明所提算法与已有算法相比在计算效能等方面更具优势;新算法应用到图像恢复问题的算例验证了新算法在图像恢复应用中的实用性和有效性。新算法由于其更低迭代运算和更高计算效率而更具吸引力。

Minimal circumscribed Hermitian ellipsoid of Hartogs domains and an application to an extremal problem

In this paper we construct circumscribed Hermitian ellipsoids of Hartogs domains of least volume and as an application, we obtain the Carathéodory extremal mappings between the Hartogs domains and the unit ball, and also give an explicit formula for calculating the extremal values.

基于原子范数最小化的稀疏阵列稳健波束形成算法

为提高稀疏阵列在信号模型存在失配时的波束形成性能,提出一种基于原子范数最小化(Atomic Norm Minimization,ANM)的稳健波束形成算法。构建基于ANM的降噪问题模型,根据稀疏阵列的协方差矩阵结构将其转化为等价的半定规划问题,同时推导该问题的对偶问题以提高运行效率,求解得到阵列降噪后的接收数据和协方差矩阵。根据互质阵列的结构特性证明其空间谱的无模糊性,对所得的协方差矩阵直接使用多重信号分类算法获得入射信号的波达方向。利用虚拟填充技术得到与互质阵列孔径相同的均匀线性阵列的接收数据,最终获得阵列输出。通过计算机仿真实验,验证了所提算法的可行性和准确性,较其他被测算法输出的信干噪比至少提高1.5 dB。