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 Convergence Analysis for Partitioned Quasi-Newton Updates.
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...
Macroscopic contact angle and liquid drops on rough solid surfaces via homogenization and numerical simulations
We discuss a numerical formulation for the cell problem related to a homogenization approach for the study of wetting on micro rough surfaces. Regularity properties of the solution are described in details and it is shown that the problem is a convex one. Stability of the solution with respect to small changes of the cell bottom surface allows for an estimate of the numerical error, at least in two dimensions. Several benchmark experiments are presented and the reliability of the numerical solution...
Mapping the convergence of genetic algorithms.
Mathematical Modeling of Atmospheric Flow and Computation of Convex Envelopes
Atmospheric flow equations govern the time evolution of chemical concentrations in the atmosphere. When considering gas and particle phases, the underlying partial differential equations involve advection and diffusion operators, coagulation effects, and evaporation and condensation phenomena between the aerosol particles and the gas phase. Operator splitting techniques are generally used in global air quality models. When considering organic aerosol...
Mathematical modeling of delamination and nonmonotone friction problems by hemivariational inequalities
The paper deals with approximations and the numerical realization of a class of hemivariational inequalities used for modeling of delamination and nonmonotone friction problems. Assumptions guaranteeing convergence of discrete models are verified and numerical results of several model examples computed by a nonsmooth variant of Newton method are presented.
Mathematical programming via the least-squares method
The least-squares method is used to obtain a stable algorithm for a system of linear inequalities as well as linear and nonlinear programming. For these problems the solution with minimal norm for a system of linear inequalities is found by solving the non-negative least-squares (NNLS) problem. Approximate and exact solutions of these problems are discussed. Attention is mainly paid to finding the initial solution to an LP problem. For this purpose an NNLS problem is formulated, enabling finding...
Maximal flow problem in a network with a variable structure
Maximization of distances of regular polygons on a circle
This paper presents the solution of a basic problem defined by J. Černý which solves a concrete everyday problem in railway and road transport (the problem of optimization of time-tables by some criteria).
Maximum norm analysis of an overlapping nonmatching grids method for the obstacle problem.
Max-separable equations and the set covering
Mesh-independence and preconditioning for solving parabolic control problems with mixed control-state constraints
Optimal control problems for the heat equation with pointwise bilateral control-state constraints are considered. A locally superlinearly convergent numerical solution algorithm is proposed and its mesh independence is established. Further, for the efficient numerical solution reduced space and Schur complement based preconditioners are proposed which take into account the active and inactive set structure of the problem. The paper ends by numerical tests illustrating our theoretical findings and...
Mesh-independence and preconditioning for solving parabolic control problems with mixed control-state constraints
Optimal control problems for the heat equation with pointwise bilateral control-state constraints are considered. A locally superlinearly convergent numerical solution algorithm is proposed and its mesh independence is established. Further, for the efficient numerical solution reduced space and Schur complement based preconditioners are proposed which take into account the active and inactive set structure of the problem. The paper ends by numerical tests illustrating our theoretical findings and comparing...