AN ASYMPTOTICAL O((k + 1)n~3L) AFFINE SCALING ALGORITHM FOR THE P_*(k)-MATRIX LINEAR COMPLEMENTRITY PROBLEM

1. IlltroductionAn LCP is normally for finding vectors x, s E Wu such that:where q E aam and M E Rrsxn. An LCP is called monotonic if M is positive semi-definite. Inthis paperg M is assumed to be a P*(K)--matrir[6][9] i.e. for a K 2 0, M satisfies:for any u E ac. Obviouslys positive semi-definite matrix is a p*(0)-matrix. It wajs proved in[10] that M is a P*(K)--matrix if f M is a sufficient[1].Based on Dikin's approach, Monteiro and Adler proposed in [81 an affine scaling algorith…     

On solving the maximum clique problem

The Maximum Clique Problem (MCP) is regarded here as the maximization of an indefinite quadratic form over the canonical simplex. For solving MCP an algorithm based upon Global Optimality Conditions (GOC) is applied. Furthermore, each step of the algorithm is analytically investigated and tested. The computational results for the proposed algorithm are compared with other Global Search approaches.     

Spherical Minimax Location Problem

This paper presents an algorithm for determining a minimax location to service demand points that are equally weighted and distributed over a sphere. The norm under consideration is geodesic. The algorithm presented here is based on enumeration and has a polynomial time complexity.     

建立模糊诊断矩阵的一种新方法

本文首先提出了一个新的模糊逻辑算子——模糊加权综合算子“#”,进而给出建立模糊诊断矩阵的新方法——网络法 ,并给出了相应的算法     

Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity

This paper presents an infeasible-interior-point algorithm for a class of nonmonotone complementarity problems, and analyses its convergence and computational complexity. The results indicate that the proposed algorithm is a polynomial-time one.     

A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method

A technique for maintaining the positive definiteness of the matrices in the quasi-Newton version of the SQP algorithm is proposed. In our algorithm, matrices approximating the Hessian of the augmented Lagrangian are updated. The positive definiteness of these matrices in the space tangent to the constraint manifold is ensured by a so-called piecewise line-search technique, while their positive definiteness in a complementary subspace is obtained by setting the augmentation parameter. In our experiment, the combination of these two ideas leads to a new algorithm that turns out to be more robust and often improves the results obtained with other approaches.     

GLOBAL CONVERGENCE OF NONMONOTONIC TRUST REGION ALGORITHM FOR NONLINEAR OPTIMIZATION

§ 1　 IntroductionIn this paper we study the following nonlinear equality constrained optimization prob-lem:minimize f(x) ,subjectto h(x) =0 ,(P)where h(x) =(h1 (x) ,h2 (x) ,...,hm(x) ) T,f and hi(i=1 ,2 ,...,m) are Rn→R twice conti-nously differentiable(m≤n) .Many authors have studied the problem(P) with trustregion method(see,references[1～ 3 ] ) .These methods have the same property:to enforce strict monotonicity for meritfunction at every iteration.Paper[4 ] shows thatstrictmonotonic …     

Decidability of the representation extension property for finite semigroups

We prove that the decision problem of whether or not a finite semigroup has the representation extension property is decidable.     

The apolar bilinear form in geometric modeling

Some recent methods of Computer Aided Geometric Design are related to the apolar bilinear form, an inner product on the space of homogeneous multivariate polynomials of a fixed degree, already known in 19th century invariant theory. Using a generalized version of this inner product, we derive in a straightforward way some of the recent results in CAGD, like Marsden's identity, the expression for the de Boor-Fix functionals, and recursion schemes for the computation of B-patches and their derivatives.

     

AN ITERATION METHOD FOR INCOMPRESSIBLE VISCOUS/INVISCID COUPLED PROBLEM VIA A SPECTRALAPPROXIMATION

1.IntroductionDomaindecompositionmethodsareusefulapproximationtechniquestofacecomputationalfluiddynamicsproblems,especiallyincomplexphysicaldomainsandusingparallelcomputationalenvironments.Theyhavebeenfirstemployedinfinitedifferenceandfiniteelementme...