Related papers: Numerical Solution for an Inverse Variational Prob…
This paper is devoted to the variational inequality problems. We consider two classes of problems, the first is classical constrained variational inequality and the second is the same problem with functional (inequality type) constraints.…
We consider the variational inequality problem over the intersection of fixed point sets of firmly nonexpansive operators. In order to solve the problem, we present an algorithm and subsequently show the strong convergence of the generated…
This paper studies the numerical approximation of solution of the Dirichlet problem for the fully nonlinear Monge-Ampere equation. In this approach, we take the advantage of reformulation the Monge-Ampere problem as an optimization problem,…
The article is devoted to some adaptive methods for variational inequalities with relatively smooth and relatively strongly monotone operators. Starting from the recently proposed proximal variant of the extragradient method for this class…
It is the aim of this work to identify and illustrate the potential and weaknesses of the computer algebra system Maple in the area of the Calculus of Variations: a classical area of mathematics that studies the methods for finding maximum…
The notion of upper variance under multiple probabilities is defined by a corresponding minimax optimization problem. This paper proposes a simple algorithm to solve the related minimax optimization problem exactly. As an application, we…
We investigate the method of conjugate gradients, exploiting inaccurate matrix-vector products, for the solution of convex quadratic optimization problems. Theoretical performance bounds are derived, and the necessary quantities occurring…
We propose a procedure for the numerical approximation of invariance equations arising in the moment matching technique associated with reduced-order modeling of high-dimensional dynamical systems. The Galerkin residual method is employed…
We present a subdivision method to solve systems of congruence equations. This method is inspired in a subdivision method, based on Bernstein forms, to solve systems of polynomial inequalities in several variables and arbitrary degrees. The…
We propose a characterization of a $p$-Laplace higher eigenvalue based on the inverse iteration method with balancing the Rayleigh quotients of the positive and negative parts of solutions to consecutive $p$-Poisson equations. The approach…
The article concerns the problem if a~given system of differential equations is identical with the Euler--Lagrange system of an~appropriate variational integral. Elementary approach is applied. The main results involve the determination of…
We introduce in this document a direct method allowing to solve numerically inverse type problems for linear hyperbolic equations. We first consider the reconstruction of the full solution of the wave equation posed in $\Omega\times (0,T)$…
Theoretical and computational properties of a vector equation $Ax-\|x\|_1x=b$ are investigated, where $A$ is an invertible $M$-matrix and $b$ is a nonnegative vector. Existence and uniqueness of a nonnegative solution is proved. Fixed-point…
We define the notion of infimum of a set of points with respect to the second order cone. This problem can be showed to be equivalent to the minimum ball containing a set of balls problem and to the maximum intersecting ball problem, as…
We consider an inverse extremal problem for variational functionals on arbitrary time scales. Using the Euler-Lagrange equation and the strengthened Legendre condition, we derive a general form for a variational functional that attains a…
Variational-hemivariational inequalities are an important mathematical framework for nonsmooth problems. The framework can be used to study application problems from physical sciences and engineering that involve non-smooth and even…
We provide a solution method for the polyhedral convex set optimization problem, that is, the problem to minimize a set-valued mapping with polyhedral convex graph with respect to a set ordering relation which is generated by a polyhedral…
By suitable examples we illustrate an algorithm for composition of inverse problems.
Using the circle method, we obtain asymptotic formulae for the number of integer solutions to certain quadratic polynomials that are uniform in the coefficients of the polynomial.
The least square solution of minimum norm of a rectangular linear system of equations can be found out iteratively by using matrix splittings. However, the convergence of such an iteration scheme arising out of a matrix splitting is…