-error estimate for a discrete two-sided obstacle problem and multilevel projective algorithm.
Large-scale Kalman filtering using the limited memory BFGS method.
Least regret control, virtual control and decomposition methods
Least regret control, virtual control and decomposition methods
"Least regret control" consists in trying to find a control which "optimizes the situation" with the constraint of not making things too worse with respect to a known reference control, in presence of more or less significant perturbations. This notion was introduced in [7]. It is recalled on a simple example (an elliptic system, with distributed control and boundary perturbation) in Section 2. We show that the problem reduces to a standard optimal control problem for augmented state equations. On...
L...-Error Estimate for an Approximation of a Parabolic Variational Inequality.
Limited-memory variable metric methods that use quantities from the preceding iteration
Linear complementarity problem and extremal hyperplanes
Linear convergence in the approximation of rank-one convex envelopes
A linearly convergent iterative algorithm that approximates the rank-1 convex envelope of a given function , i.e. the largest function below which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington.
Linear convergence in the approximation of rank-one convex envelopes
A linearly convergent iterative algorithm that approximates the rank-1 convex envelope of a given function , i.e. the largest function below f which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington.
LMS-Newton adaptive filtering using FFT-based conjugate gradient iterations.
Local analysis of a cubically convergent method for variational inclusions
This paper deals with variational inclusions of the form 0 ∈ φ(x) + F(x) where φ is a single-valued function admitting a second order Fréchet derivative and F is a set-valued map from to the closed subsets of . When a solution z̅ of the previous inclusion satisfies some semistability properties, we obtain local superquadratic or cubic convergent sequences.
Local convergence analysis for a certain class of inexact methods.
Local minimizers of functionals with multiple volume constraints
We study variational problems with volume constraints, i.e., with level sets of prescribed measure. We introduce a numerical method to approximate local minimizers and illustrate it with some two-dimensional examples. We demonstrate numerically nonexistence results which had been obtained analytically in previous work. Moreover, we show the existence of discontinuous dependence of global minimizers from the data by using a Γ-limit argument and illustrate this with numerical computations. Finally...