On a free boundary problem for the Reynolds equation derived from the Stokes system with Tresca boundary conditions

The asymptotic behaviour of a Stokes flow with Tresca free boundary friction conditions when one dimension of the fluid domain tends to zero is studied. A specific Reynolds equation associated with variational inequalities is obtained and uniqueness is proved.     

A transform method for linear evolution PDEs on a finite interval

We study initial boundary value problems for linear scalar evolutionpartial differential equations, with spatial derivatives ofarbitrary order, posed on the domain {t > 0, 0 < x <L}. We show that the solution can be expressed as an integralin the complex k-plane. This integral is defined in terms ofan x-transform of the initial condition and a t-transform ofthe boundary conditions. The derivation of this integral representationrelies on the analysis of the global relation, which is an algebraicrelation defined in the complex k-plane coupling all boundaryvalues of the solution. For particular cases, such as the case of periodic boundaryconditions, or the case of boundary value problems for even-orderPDEs, it is possible to obtain directly from the global relationan alternative representation for the solution, in the formof an infinite series. We stress, however, that there existinitial boundary value problems for which the only representationis an integral which cannot be written as an infinite series.An example of such a problem is provided by the linearized versionof the KdV equation. Similarly, in general the solution of odd-orderlinear initial boundary value problems on a finite intervalcannot be expressed in terms of an infinite series.     

Critical Point Theorems and Applications to Differential Equations

This paper contains a generalization of the well-known Palais-Smale and Cerami compactness conditions. The compactness condition introduced is used to prove some general existence theorems for critical points. Some applications are given to differential equations.     

Generic Well-Posedness of Constrained Variational Problems Without Convexity Assumptions

In our previous work, a generic well-posedness result (with respect to variations of the integrand of the integral functional) without the convexity condition was established for a class of optimal control problems satisfying the Cesari growth condition. In this paper, we extend this generic well-posedness result to classes of constrained variational problems in which the values at the endpoints and constraint maps are also subject to variations.     

Augmented Lagrangian Algorithms Based on the Spectral Projected Gradient Method for Solving Nonlinear Programming Problems

The spectral projected gradient method SPG is an algorithm for large-scale bound-constrained optimization introduced recently by Birgin, Martínez, and Raydan. It is based on the Raydan unconstrained generalization of the Barzilai-Borwein method for quadratics. The SPG algorithm turned out to be surprisingly effective for solving many large-scale minimization problems with box constraints. Therefore, it is natural to test its perfomance for solving the sub-problems that appear in nonlinear programming methods based on augmented Lagrangians. In this work, augmented Lagrangian methods which use SPG as the underlying convex-constraint solver are introduced (ALSPG) and the methods are tested in two sets of problems. First, a meaningful subset of large-scale nonlinearly constrained problems of the CUTE collection is solved and compared with the perfomance of LANCELOT. Second, a family of location problems in the minimax formulation is solved against the package FFSQP.     

On the Existence of Solutions to Vector Quasivariational Inequalities and Quasicomplementarity Problems with Applications Break to Traffic Network Equilibria

For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions.     

Elliptic and parabolic problems in unbounded domains

We consider elliptic and parabolic problems in unbounded domains. We give general existence and regularity results in Besov spaces and semi‐explicit representation formulas via operator‐valued fundamental solutions which turn out to be a powerful tool to derive a series of qualitative results about the solutions. We give a sample of possible applications including asymptotic behavior in the large, singular perturbations, exact boundary conditions on artificial boundaries and validity of maximum principles. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

Multilevel a posteriori error analysis for reaction–convection–diffusion problems

We present a new approach to the a posteriori error analysis of stable Galerkin approximations of reaction–convection–diffusion problems. It relies upon a non-standard variational formulation of the exact problem, based on the anisotropic wavelet decomposition of the equation residual into convection-dominated scales and diffusion-dominated scales. The associated norm, which is stronger than the standard energy norm, provides a robust (i.e., uniform in the convection limit) control over the streamline derivative of the solution. We propose an upper estimator and a lower estimator of the error, in this norm, between the exact solution and any finite dimensional approximation of it. We investigate the behaviour of such estimators, both theoretically and through numerical experiments. As an output of our analysis, we find that the lower estimator is quantitatively accurate and robust.     

A greedy algorithm for multicut and integral multiflow in rooted trees

We present an O(min(Kn,n²)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality.