In this paper, we employ the image space analysis (for short, ISA) to investigate vector quasi-equilibrium problems (for short, VQEPs) with a variable ordering relation, the constrained condition of which also consists of a variable ordering relation. The quasi relatively weak VQEP (for short,...

Methods are developed and analyzed for estimating the distance to a local minimizer of a nonlinear programming problem. One estimate, based on the solution of a constrained convex quadratic program, can be used when strict complementary slackness and the second-order sufficient optimality...

Surface subdivision schemes are used extensively in scientific and practical applications to generate continuous surfaces in an iterative manner, starting from a set of points. The first subdivision step defines the so called control polygon. This initial polygon can be considered as a very...

We present a method for computer simulation of diffusion. The method uses quasi-random walk of particles. We consider a pure initial value problem for a simple diffusion equation in s space dimensions. We introduce s spatial steps Δxi. A semi-discrete approximation to the equation is obtained...

It is known that a multiresolution scheme without control on the infinity norm can produce numerical artifacts. This work is intended to provide explicit error bounds for the reconstruction process associated with the interpolating wavelets introduced by Donoho [D. Donoho, Interpolating Wavelet...

A variant of the inexact augmented Lagrangian algorithm called SMALE (Dostál in Comput. Optim. Appl. 38:47–59, <CitationRef CitationID="CR10">2007</CitationRef>) for the solution of saddle point problems with a positive definite left upper block is studied. The algorithm SMALE-M presented here uses a fixed regularization parameter and...</citationref>