818 research outputs found
Nonlinear Schwarz preconditioning for nonlinear optimization problems with bound constraints
We propose a nonlinear additive Schwarz method for solving nonlinear
optimization problems with bound constraints. Our method is used as a
"right-preconditioner" for solving the first-order optimality system arising
within the sequential quadratic programming (SQP) framework using Newton's
method. The algorithmic scalability of this preconditioner is enhanced by
incorporating a solution-dependent coarse space, which takes into account the
restricted constraints from the fine level. By means of numerical examples, we
demonstrate that the proposed preconditioned Newton methods outperform standard
active-set methods considered in the literature
Rate of Convergence for some constraint Dcomposition methods for nonlinear variational inequalities.
Internal and subspace correction approximations of implicit variational inequalities
International audienceThe aim of this paper is to study the existence of solutions and some approximations for a class of implicit evolution variational inequalities that represents a generalization of several quasistatic contact problems in elasticity. Using appropriate estimates for the incremental solutions, the existence of a continuous solution and convergence results are proved for some corresponding internal approximation and backward difference scheme. To solve the fully discrete problems, general additive subspace correction algorithms are considered, for which global convergence is proved and some error estimates are established
Nonparametric frontier estimation from noisy data
A new nonparametric estimator of production frontiers is defined and studied when the data set of production units is contaminated by measurement error. The measurement error is assumed to be an additive normal random variable on the input variable, but its variance is unknown. The estimator is a modification of the m-frontier, which necessitates the computation of a consistent estimator of the conditional survival function of the input variable given the output variable. In this paper, the identification and the consistency of a new estimator of the survival function is proved in the presence of additive noise with unknown variance. The performance of the estimator is also studied through simulated data.production frontier, deconvolution, measurement error, efficiency analysis
A full approximation scheme multilevel method for nonlinear variational inequalities
We present the full approximation scheme constraint decomposition (FASCD)
multilevel method for solving variational inequalities (VIs). FASCD is a common
extension of both the full approximation scheme (FAS) multigrid technique for
nonlinear partial differential equations, due to A.~Brandt, and the constraint
decomposition (CD) method introduced by X.-C.~Tai for VIs arising in
optimization. We extend the CD idea by exploiting the telescoping nature of
certain function space subset decompositions arising from multilevel mesh
hierarchies. When a reduced-space (active set) Newton method is applied as a
smoother, with work proportional to the number of unknowns on a given mesh
level, FASCD V-cycles exhibit nearly mesh-independent convergence rates, and
full multigrid cycles are optimal solvers. The example problems include
differential operators which are symmetric linear, nonsymmetric linear, and
nonlinear, in unilateral and bilateral VI problems.Comment: 25 pages, 9 figure
Approximation results and subspace correction algorithms for implicit variational inequalities
International audienceThis paper deals with the mathematical analysis and the subspace approximation of a system of variational inequalities representing a unified approach to several quasistatic contact problems in elasticity. Using an implicit time discretization scheme and some estimates, convergence properties of the incremental solutions and existence results are presented for a class of abstract implicit evolution variational inequalities involving a nonlinear operator. To solve the corresponding semi-discrete and the fully discrete problems, some general subspace correction algorithms are proposed, for which global convergence is analyzed and error estimates are established
- …