Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

Well-Posedness by Perturbations of Variational Problems

In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.     

Synthesis and Reactions of Some New Pyrrolylfuro[2,3‐d]Pyrimidines and Pyrrolopyrazinofuropyrimidines

5‐Amino‐4‐methyl‐2‐phenyl‐6‐substitutedfuro[2,3‐d]pyrimidines ( 2a‐c ) were reacted with 2,5‐dimethoxytetrahydrfuran to afford the pyrrolyl derivatives 3a‐c . Compound 3a was chosen as intermediate for the synthesis of poly fused heterocycles incorporated furopyrimidines moiety 4–11 . Some of the synthesized compounds were screened for their antibacterial and antifungal activities.     

CsNiCl3晶体的光谱精细结构、零场分裂参量及Jahn-Teller效应

应用不可约张量理论构造了三角对称晶场中3d²/3d⁸态离子的45阶可完全对角化的微扰哈密顿矩阵，研究了CsNiCl₃晶体的光谱精细结构、晶体结构、零场分裂参量、Jahn-Telller效应以及自旋单重态对Ni²⁺离子基态能级的影响，理论与实验相符合.在此基础上，进一步研究了以前工作中被忽略的自旋-自旋耦合作用和Trees修正对CsNiCl₃晶体的光谱精细结构和零场分裂参量的影响，发现有四种机理会影响零场分裂参量：1)自旋-轨道耦合机理，2)自旋-自旋耦合机理；3)自旋-轨道与自旋-自旋联合耦合机理；4)自旋-轨道与Trees修正联合耦合机理，其中自旋-轨道耦合机理是最主要的，其他三种机理也是不可忽略的. 关键词： 基态能级 精细结构 零场分裂 自旋-自旋耦合     

The Hahn–Banach Theorem for Partially Ordered Totally Convex, Positively Convex and Superconvex Modules

The Hahn–Banach Theorem for partially ordered totally convex modules [3] and a necessary and sufficient condition for the existence of an extension of a morphism from a submodule C ₀ of a partially ordered totally convex module C (with the ordered unit ball of the reals as codomain) to C, are proved. Moreover, the categories of partially ordered positively convex and superconvex modules are introduced and for both categories the Hahn–Banach Theorem is proved.     

An efficient numerical scheme for precise time integration of a diffusion-dissolution/precipitation chemical system

A numerical scheme based on an operator splitting method and a dense output event location algorithm is proposed to integrate a diffusion-dissolution/precipitation chemical initial-boundary value problem with jumping nonlinearities. The numerical analysis of the scheme is carried out and it is proved to be of order 2 in time. This global order estimate is illustrated numerically on a test case.

     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

线性分式规划最优解集的求法

本文使用多面集的表示定理，导出了线性分式规划最优解集的结构，并给出确定全部最优解的计算步骤。