Parlay／OSA网关中SIP协议映射机制的设计

协议映射是Parlay/OSA网关开发中的核心内容,首先给出了Parlay/OSA网关中SIP协议映射的总体架构,接着重点对映射模型中的SIP协议适配器、CORBA通信模块两个关键模块进行了详细设计,所设计的Parlay/OSA网关中SIP协议映射机制主要考虑了映射过程中的消息传递机制和呼叫标识两个关键问题,从而保证了协议映射的一致性和可靠性.     

Hybrid Approach with Active Set Identification for Mathematical Programs with Complementarity Constraints

We consider a mathematical program with complementarity constraints (MPCC). Our purpose is to develop methods that enable us to compute a solution or a point with some kind of stationarity to MPCC by solving a finite number of nonlinear programs. We apply an active set identification technique to a smoothing continuation method (Ref. 1) and propose a hybrid algorithm for solving MPCC. We develop also two modifications: one makes use of an index addition strategy; the other adopts an index subtraction strategy. We show that, under reasonable assumptions, all the proposed algorithms possess a finite termination property. Further discussions and numerical experience are given as well This work was supported in part by the Scientific Research Grant-in-Aid from the Ministry of Education, Science, Sports, and Culture of Japan. The authors are grateful to Professor Paul Tseng for helpful suggestions on an earlier version of the paper.     

Global Convergence of a Smooth Approximation Method for Mathematical Programs with Complementarity Constraints

A new smoothing approach was given for solving the mathematical programs with complementarity constraints (MPCC) by using the aggregation technique. As the smoothing parameter tends to zero, if the KKT point sequence generated from the smoothed problems satisfies the second-order necessary condition, then any accumulation point of the sequence is a B-stationary point of MPCC if the linear independence constraint qualification (LICQ) and the upper level strict complementarity (ULSC) condition hold at the limit point. The ULSC condition is weaker than the lower level strict complementarity (LLSC) condition generally used in the literatures. Moreover, the method can be easily extended to the mathematical programs with general vertical complementarity constraints.     

Extension of Quasi-Newton Methods to Mathematical Programs with Complementarity Constraints

Quasi-Newton methods in conjunction with the piecewise sequential quadratic programming are investigated for solving mathematical programming with equilibrium constraints, in particular for problems with complementarity constraints. Local convergence as well as superlinear convergence of these quasi-Newton methods can be established under suitable assumptions. In particular, several well-known quasi-Newton methods such as BFGS and DFP are proved to exhibit the local and superlinear convergence.     

非线性均衡问题一个超线性收敛的光滑逼近SQP算法

研究非线性均衡问题,引入一个磨光算子将原问题转化为光滑问题,并用此光滑问题来逼近原来的问题而求解.在每步迭代中,通过转轴运算,求解一个线性约束二次规划问题和显式修正方向来得到主方向,并通过一个显式公式来得到高阶修正方向使得算法避免Maratos效应.在不需要上层互补条件下证明了算法具有全局收敛性和强收敛性且具有超线性收敛速度.     

Parameter estimation in metabolic flux balance models for batch fermentation—Formulation & Solution using Differential Variational Inequalities (DVIs)

Recent years have witnessed a surge in research in cellular biology. There has been particular interest in the interaction between cellular metabolism and its environment. In this work we present a framework for fitting fermentation models that include this interaction. Differential equations describe the evolution of extracellular metabolites, while a Linear Program (LP) models cell metabolism, and piecewise smooth functions model the links between cell metabolism and its environment. We show that the fermentation dynamics can be described using Differential Variational Inequalities (DVIs). Discretization of the system and reformulation of the VIs using optimality conditions converts the DVI to a Mathematical Program with Complementarity Constraints (MPCC). We briefly describe an interior point algorithm for solving MPCCs. Encouraging numerical results are presented in estimating model parameters to fit model prediction and data obtained from fermentation, using cultures of Saccharomyces cerevisiae reported in the literature.     

Mathematical programs with vanishing constraints: constraint qualifications,their applications,and a new regularization method

ABSTRACT

We propose a new family of relaxation schemes for mathematical programs with vanishing constraints that extend the relaxation of Hoheisel, Kanzow & Schwartz from 2012. We discuss the properties of the sequence of relaxed non-linear programs as well as stationary properties of limiting points. Our relaxation schemes have the desired property of converging to an M-stationary point. A main advantage of this new method is to converge to an S-stationary point satisfying MPVC-LICQ for a large class of problem. We also study MPVC constraint qualification connected to this study and prove convergence of the method under the new MPVC-CRSC. Additionally, we obtain the new MPVC-wGCQ and prove that it is the weakest MPVC constraint qualification.     

下一代网络核心业务平台中SIP协议映射的研究

首先分析了支持SIP（Session Initiation Protocol）协议映射的Parlay网关和SIP服务器的结构和功能模型.然后描述了MPCC SCF（Multi-Party Call Control Service Capabilty Features）和SIP服务器的具体设计和实现方案.最后以呼叫前转业务为例,给出了组成SIP协议映射的进程类型和功能描述.实践表明,使用本技术能实现屏蔽底层SIP协议,为开发者提供标准的、与协议无关的Parlay API的目的.     

Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs

We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration of a decomposition method, one step of a nonlinear programming scheme is applied to one piece of the MPEC to obtain the next iterate. Our goal is to understand global convergence to B-stationary points of these methods when the embedded nonlinear programming solver is a trust-region scheme, and the selection of pieces is determined using multipliers generated by solving the trust-region subproblem. To this end we study global convergence of a linear trust-region scheme for linearly-constrained NLPs that we call a trust-search method. The trust-search has two features that are critical to global convergence of decomposition methods for MPECs: a robustness property with respect to switching pieces, and a multiplier convergence result that appears to be quite new for trust-region methods. These combine to clarify and strengthen global convergence of decomposition methods without resorting either to additional conditions such as eventual inactivity of the trust-region constraint, or more complex methods that require a separate subproblem for multiplier estimation.      

群零模正则化问题的等价Lipschitz优化模型

针对群零模正则化问题, 从零模函数的变分刻画入手, 将其等价地表示为带有 互补约束的数学规划问题(简称MPCC问题), 然后证明将互补约束直接罚到MPCC的目标函数而得到的罚问题是MPCC问题的全局精确罚. 此精确罚问题的目标函数不仅在可行集上全局Lipschitz连续而且还具有满意的双线性结构, 为设计群零模正则化问题的序列凸松弛算法提供了满意的等价Lipschitz优化模型.