Related papers: On solving nonlinear simultaneous equations arisin…
We consider simple bilevel optimization problems where the goal is to compute among the optimal solutions of a composite convex optimization problem, one that minimizes a secondary objective function. Our main contribution is threefold. (i)…
The secant method is a very effective numerical procedure used for solving nonlinear equations of the form $f(x)=0$. In a recent work [A. Sidi, Generalization of the secant method for nonlinear equations. {\em Appl. Math. E-Notes},…
We extend results known for the randomized Gauss-Seidel and the Gauss-Southwell methods for the case of a Hermitian and positive definite matrix to certain classes of non-Hermitian matrices. We obtain convergence results for a whole range…
The Bayesian approach has proved to be a coherent approach to handle ill posed Inverse problems. However, the Bayesian calculations need either an optimization or an integral calculation. The maximum a posteriori (MAP) estimation requires…
We propose an alternating subgradient method with non-constant step sizes for solving convex-concave saddle-point problems associated with general convex-concave functions. We assume that the sequence of our step sizes is not summable but…
We propose and analyze a second-order partitioned time-stepping method for a two-phase flow problem in porous media. The algorithm is based on a refactorization of Cauchy's one-leg $\theta$-method. The main part consists of the implicit…
We introduce vertex block descent, a block coordinate descent solution for the variational form of implicit Euler through vertex-level Gauss-Seidel iterations. It operates with local vertex position updates that achieve reductions in global…
In this paper, we study the gradient descent-ascent method for convex-concave saddle-point problems. We derive a new non-asymptotic global convergence rate in terms of distance to the solution set by using the semidefinite programming…
Multilevel methods are among the most efficient numerical methods for solving large-scale linear systems that arise from discretized partial differential equations. The fundamental module of such methods is a two-level procedure, which…
Fitting concentric geometric objects to digitized data is an important problem in many areas such as iris detection, autonomous navigation, and industrial robotics operations. There are two common approaches to fitting geometric shapes to…
In this paper we consider a class of optimization problems with a strongly convex objective function and the feasible set given by an intersection of a simple convex set with a set given by a number of linear equality and inequality…
This paper presents a canonical dual method for solving a quadratic discrete value selection problem subjected to inequality constraints. The problem is first transformed into a problem with quadratic objective and 0-1 integer variables.…
Problems with localized nonhomogeneous material properties present well-known challenges for numerical simulations. In particular, such problems may feature large differences in length scales, causing difficulties with meshing and…
A new finite element method with discontinuous approximation is introduced for solving second order elliptic problem. Since this method combines the features of both conforming finite element method and discontinuous Galerkin (DG) method,…
This paper is concerned with superconvergence properties of the direct discontinuous Galerkin (DDG) method for two-dimensional nonlinear convection-diffusion equations. By using the idea of correction function, we prove that, for any…
We study an approximation method for the one-dimensional nonlinear filtering problem, with discrete time and continuous time observation. We first present the method applied to the Fokker-Planck equation. The convergence of the…
We propose a hydridizable discontinuous Galerkin (HDG) method for solving the Cahn-Hilliard equation. The temporal discretization can be based on either the backward Euler method or the convex-splitting method. We show that the fully…
In this paper we consider the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed inverse problems. Under merely Lipschitz condition, we prove that this method together with an a posteriori stopping rule defines an…
We consider a nonlinear Klein--Gordon equation in the nonrelativistic limit regime with highly oscillatory initial data in the form of a modulated plane wave. In this regime, the solution exhibits rapid oscillations in both time and space,…
In this paper, we present a unified analysis of methods for such a wide class of problems as variational inequalities, which includes minimization problems and saddle point problems. We develop our analysis on the modified Extra-Gradient…