Q-superlinear convergence of the iterates in primal-dual interior-point methods

Sufficient conditions are given for the Q-superlinear convergence of the iterates produced by primal-dual interior-point methods for linear complementarity problems. It is shown that those conditions are satisfied by several well known interior-point methods. In particular it is shown that the iteration sequences produced by the simplified predictor–corrector method of Gonzaga and Tapia, the simplified largest step method of Gonzaga and Bonnans, the LPF+ algorithm of Wright, the higher order methods of Wright and Zhang, Potra and Sheng, and Stoer, Wechs and Mizuno are Q-superlinearly convergent. Received: February 9, 2000 / Accepted: February 20, 2001?Published online May 3, 2001     

On reductions for the Steiner Problem in Graphs

Several authors have demonstrated how reductions can be used to improve the efficiency with which the Steiner Problem in Graphs can be solved. Previous reduction algorithms have been largely ad hoc in nature. This paper uses a theory of confluence to show that, in many cases, all maximal reduction sequences are equivalent, gaining insights into the design of reduction algorithms that obtain a maximum degree of reduction.     

EXISTENCE AND UNIQUENESS THEOREMS FOR HIGHER-ORDER BOUNDARY VALUE PROBLEMS

An existence and uniqueness of solutions for boundary value problemsandare established, by employing a priori estimates for all solutions and the Schau-der fixed point theorem. Some of these results extend earlier results due toUsmani(1979), Yang(1988), and Pei(1997).     

Primal separation algorithms

Given an integer polyhedron , an integer point , and a point , the primal separation problem is the problem of finding a linear inequality which is valid for P _I , violated by x ^*, and satisfied at equality by . The primal separation problem plays a key role in the primal approach to integer programming. In this paper we examine the complexity of primal separation for several well-known classes of inequalities for various important combinatorial optimization problems, including the knapsack, stable set and travelling salesman problems.Received: November 2002, Revised: March 2003,     

A Global Solution to a Two-dimensional Riemann Problem Involving Shocks as Free Boundaries

We present a global solution to a Riemann problem for the pressure gradient system of equations.The Riemann problem has initially two shock waves and two contact discontinuities. The angle between the two shock waves is set initially to be close to 180 degrees. The solution has a shock wave that is usually regarded as a free boundary in the self-similar variable plane. Our main contribution in methodology is handling the tangential oblique derivative boundary values.     

Children’s use of realistic considerations in problem solving: some English evidence

This is the second of two papers exploring children’s responses to an extended version of a division-with-remainder problem intended to elicit general rather than particular realistic considerations during mathematical problem solving. Responses to two problems are analyzed. The first is a ‘realistically’ contextualised item drawn from national tests in England whose ambiguities have been previously discussed (Cooper, 1992); the second is a version of this problem revised to encourage a wider range of realistic responses. In Cooper and Harries (2002), the responses of children at the end of their first year of secondary schooling were analyzed. Here the responses of children at the end of their primary schooling are analyzed and compared with the previous results. It is shown that many children, given suitable encouragement, are willing and able to enter into an extended form of realistic thinking during problem solving, although the original test item renders this invisible.     

广义Lienard方程边值问题

By coincidence degree,the existence of solution to the boundary value problem of a generalized Liénard equation a(t)x＂+F(x,x′)x′+g(x)=e(t),x(0)=x(2π),x′(0)=x′(2π)is proved,where a∈C1[0,2π],a(t)>0(0≤t≤2π),a(0)=a(2π),F(x,y)=f(x)+α| y|β,α>0,β>0 are all constants,f∈C(R,R),e∈C[0,2π]. An example is given as an application.     

Modified Mini finite element for the Stokes problem in ℝ2 or ℝ3

We analyze a modified version of the Mini finite element (or the Mini* finite element) for the Stokes problem in ℝ² or ℝ³. The cross‐grid element of order one in ℝ³ is also analyzed. The stability is verified with the aid of the macroelement technique introduced by Stenberg. Each of these methods converges with first order in h as the Mini element does. Numerical tests are given for the Mini* element in comparison with the Mini element when Ω is a unit square on ℝ². This revised version was published online in June 2006 with corrections to the Cover Date.     

The Lanczos Method with Semi-Definite Inner Product

The spectral transformation Lanczos method is very popular for solving large scale real symmetric generalized eigenvalue problems. The method uses a special inner product so that the symmetric Lanczos method can be used. Sometimes, a semi-definite inner product must be used. This may lead to instabilities and break-down. In this paper, we suggest cures for breakdown by use of implicit restarting and the pseudo-Lanczos method.This revised version was published online in October 2005 with corrections to the Cover Date.