An approximate bundle method for solving nonsmooth equilibrium problems

We present an approximate bundle method for solving nonsmooth equilibrium problems. An inexact cutting-plane linearization of the objective function is established at each iteration, which is actually an approximation produced by an oracle that gives inaccurate values for the functions and subgradients. The errors in function and subgradient evaluations are bounded and they need not vanish in the limit. A descent criterion adapting the setting of inexact oracles is put forward to measure the current descent behavior. The sequence generated by the algorithm converges to the approximately critical points of the equilibrium problem under proper assumptions. As a special illustration, the proposed algorithm is utilized to solve generalized variational inequality problems. The numerical experiments show that the algorithm is effective in solving nonsmooth equilibrium problems.     

An optimal regularized projection method for solving ill-posed problems via dynamical systems method

A new regularized projection method was developed for numerically solving ill-posed equations of the first kind. This method consists of combining the dynamical systems method with an adaptive projection discretization scheme. Optimality of the proposed method was proved on wide classes of ill-posed problems.     

An approximate method for solving the convex programming problem

We consider an iterative process for maximization of a convex nondifferentiable functional in a real Hilbert space. Two-sided bounds on the optimal functional value are derived. Stability of the approximate solutions is considered. Convergence of the proposed iterative process is proved.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 59, pp. 122–129, 1986     

An analytic approximate method for solving stochastic integrodifferential equations

In this paper we compare the solution of a general stochastic integrodifferential equation of the Ito type, with the solutions of a sequence of appropriate equations of the same type, whose coefficients are Taylor series of the coefficients of the original equation. The approximate solutions are defined on a partition of the time-interval. The rate of the closeness between the original and approximate solutions is measured in the sense of the Lp-norm, so that it decreases if the degrees of these Taylor series increase, analogously to real analysis. The convergence with probability one is also proved.     

Quasilinearization method for coupled dynamic problems of thermoviscoelasticity

Use of the quasilinearization method is proposed for the solution of coupled dynamic (particularly, quasistatic) problems of thermoviscoelasticity under cyclic loading. The coupled problems under consideration here include vibrations of a one-dimensional body (beam, plate, shell) and shear vibrations of a hollow cylinder made of a material with temperature-dependent properties, with the principle of temperature-time analogy applicable in the latter case. The quasilinearization method is shown to be a fast converging one when applied to the solution of these problems.Institute of Mechanics, Academy of Sciences of the Ukrainian SSR, Kiev. Translated from Mekhanika Polimerov, No. 2, pp. 310–316, March–April, 1976.     

Method of approximations for solving problems of the linear theory of thermoviscoelasticity

A general approximate method of solving problems of the linear theory of thermoviscoelasticity is proposed. Use is made of the Laplace transformation and certain properties of the dependence of solutions to problems of the theory of elasticity on Poisson's ratio that make possible a simple approximation. As a result, the inverse transforms become elementary and the general solution of the problem is expressed by creep and relaxation functions.Mekhanika Polimerov, Vol. 4, No. 2, pp. 210–221, 1968     

A new method for solving split equality problems via projection dynamical systems

Numerical Algorithms - In this paper, we propose a projection dynamical system for solving the split equality problem, or more generally the approximate split equality problem, in Hilbert spaces....     

Coupled problems of thermoviscoelasticity

The author derives a heat flux equation with allowance for the dissipation of internal forces on the basis of the fundamental equations of continuum mechanics and the thermodynamics of irreversible processes.Moscow Lomonosov State University. Translated from Mekhanika Polimerov, No. 3, pp. 415–421, May–June, 1969.     

An extragradient-type method for solving nonmonotone quasi-equilibrium problems

In this paper, a quasi-equilibrium problem with a nonmonotone bifunction is considered in a finite-dimensional space. The primary difficulty with this problem is related to the fact that one must simultaneously solve a nonmonotone equilibrium problem and calculate a fixed point of a multivalued mapping. An extragradient-type method is presented and analysed for its solution. The convergence of the method is proved under the assumption that the solution set of an associated dual equilibrium problem is nonempty. Finally, some numerical experiments are reported.     

An integral method for solving nonlinear eigenvalue problems

We propose a numerical method for computing all eigenvalues (and the corresponding eigenvectors) of a nonlinear holomorphic eigenvalue problem that lie within a given contour in the complex plane. The method uses complex integrals of the resolvent operator, applied to at least k column vectors, where k is the number of eigenvalues inside the contour. The theorem of Keldysh is employed to show that the original nonlinear eigenvalue problem reduces to a linear eigenvalue problem of dimension k. No initial approximations of eigenvalues and eigenvectors are needed. The method is particularly suitable for moderately large eigenvalue problems where k is much smaller than the matrix dimension. We also give an extension of the method to the case where k is larger than the matrix dimension. The quadrature errors caused by the trapezoid sum are discussed for the case of analytic closed contours. Using well known techniques it is shown that the error decays exponentially with an exponent given by the product of the number of quadrature points and the minimal distance of the eigenvalues to the contour.     

An approximate method for solving a class of weakly-singular Volterra integro-differential equations

In this paper, we present a new approach to resolve linear and nonlinear weakly-singular Volterra integro-differential equations of first- or second-order by first removing the singularity using Taylor’s approximation and then transforming the given first- or second-order integro-differential equations into an ordinary differential equation such as the well-known Legendre, degenerate hypergeometric, Euler or Abel equations in such a manner that Adomian’s asymptotic decomposition method can be applied, which permits convenient resolution of these equations. Some examples with closed-form solutions are studied in detail to further illustrate the proposed technique, and the results obtained demonstrate this approach is indeed practical and efficient.     

An asymptotic method of solving transient dynamic contact problems

Using a special approximation in the complex plane of the symbol of the kernel of the contact-problem integral equation, an asymptotic form of its solution is constructed which is the fundamental solution of the transient dynamic plane contact problem of the impact of a rigid punch with an elastic half-plane for short interaction times. The proposed approximation of the kernel symbol enables it to be approximated in the complex plane with any previously specified accuracy. Unlike existing approaches [1, 2, etc.], the approximation of the kernel symbol of the integral equation employed here enables the solution of this problem to be obtained in the form of simple formulae not containing singular quadratures.     

An applicable method for solving the shortest path problems

A theorem of Hardy, Littlewood, and Polya, first time is used to find the variational form of the well known shortest path problem, and as a consequence of that theorem, one can find the shortest path problem via quadratic programming. In this paper, we use measure theory to solve this problem. The shortest path problem can be written as an optimal control problem. Then the resulting distributed control problem is expressed in measure theoretical form, in fact an infinite dimensional linear programming problem. The optimal measure representing the shortest path problem is approximated by the solution of a finite dimensional linear programming problem.     

An ε-active barrier-function method for solving minimax problems

A modification of an existing barrier-function method is presented. The modified algorithm may be used to solve semi-infinite minimax problems arising in engineering design. The modification preserves the global convergence properties, simple structure, and numerical robustness of the original algorithm, while substantially reducing the computational cost.This research was supported by the National Science Foundation Grant ECS-8517362, the Air Force Office Scientific Research Grant 86-0116, and the California State MICRO program.     

An exact penalty method for solving optimal control problems

This paper discusses an algorithm for solving optimal control problems. An optimal control problem is presented where the final time is unknown. The algorithm consists of an integrator and a minimizer; the latter is an exact penalty function used to solve constrained nonlinear programming problems. Essentially, the optimal control problem is converted to a mathematical programming problem such that a point satisfying the differential equations via the integrator is provided to the minimizer, a lower performance index is obtained, the integrator is reinitiated, etc., until a suitable stopping criterion is satisfied.