-error analysis for a system of quasivariational inequalities with noncoercive operators.
-error estimate for a discrete two-sided obstacle problem and multilevel projective algorithm.
Lagrange multipliers and geometric measure theory
Lagrange multipliers method and quadratic programming in Hilbert space
Lagrangean decomposition for integer programming : theory and applications
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...
Limited-memory variable metric methods that use quantities from the preceding iteration
Limiti di problemi di Dirichlet nonlineari in domini variabili
Si studia il comportamento limite di successioni di problemi variazionali nonlineari con condizioni al contorno di Dirichlet su aperti variabili. I principali strumenti usati in questa ricerca sono le nozioni di -convergenza e di -capacità nonlineare.
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.
Linear programming interpretations of Mather’s variational principle
We discuss some implications of linear programming for Mather theory [13, 14, 15] and its finite dimensional approximations. We find that the complementary slackness condition of duality theory formally implies that the Mather set lies in an -dimensional graph and as well predicts the relevant nonlinear PDE for the “weak KAM” theory of Fathi [6, 7, 8, 5].
Linear programming interpretations of Mather's variational principle
We discuss some implications of linear programming for Mather theory [13-15] and its finite dimensional approximations. We find that the complementary slackness condition of duality theory formally implies that the Mather set lies in an n-dimensional graph and as well predicts the relevant nonlinear PDE for the “weak KAM” theory of Fathi [5-8].
Linear-quadratic optimal control for the Oseen equations with stabilized finite elements
For robust discretizations of the Navier-Stokes equations with small viscosity, standard Galerkin schemes have to be augmented by stabilization terms due to the indefinite convective terms and due to a possible lost of a discrete inf-sup condition. For optimal control problems for fluids such stabilization have in general an undesired effect in the sense that optimization and discretization do not commute. This is the case for the combination of streamline upwind Petrov-Galerkin (SUPG) and pressure...
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 convergence analysis of a modified Newton-Jarratt's composition under weak conditions
A. Cordero et. al (2010) considered a modified Newton-Jarratt's composition to solve nonlinear equations. In this study, using decomposition technique under weaker assumptions we extend the applicability of this method. Numerical examples where earlier results cannot apply to solve equations but our results can apply are also given in this study.
Local convergence for the curve tracing of the homotopy method.
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...
Local quadratic convergence of SQP for elliptic optimal control problems with mixed control-state constraints