Results 31 to 40 of about 1,344 (121)

Interior-point methods for P∗(κ)-linear complementarity problem based on generalized trigonometric barrier function

, 2017
Recently, M. Bouafoa, et al. [3] investigated a new kernel function which differs from the self-regular kernel functions. The kernel function has a trigonometric Barrier Term. In this paper we generalize the analysis presented in the above paper for P∗(κ)
M. E. Ghami, G. Q. Wang
semanticscholar   +1 more source

A new smoothing method for solving nonlinear complementarity problems

Open Mathematics, 2019
In this paper, a new improved smoothing Newton algorithm for the nonlinear complementarity problem was proposed. This method has two-fold advantages. First, compared with the classical smoothing Newton method, our proposed method needn’t nonsingular of ...
Zhu Jianguang, Hao Binbin
doaj   +1 more source

Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization [PDF]

, 2018
We extend the notion of Dubiner distance from algebraic to trigonometric polynomials on subintervals of the period, and we obtain its explicit form by the Szego variant of Videnskii inequality.
Vianello, Marco
core   +1 more source

Strong convergence to a solution of the inclusion problem for a finite family of monotone operators in Hadamard spaces

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021
In this paper, in the setting of Hadamard spaces, a iterative scheme is proposed for approximating a solution of the inclusion problem for a finite family of monotone operators which is a unique solution of a variational inequality.
Ranjbar Sajad
doaj   +1 more source

On the order of the operators in the Douglas-Rachford algorithm

, 2015
The Douglas-Rachford algorithm is a popular method for finding zeros of sums of monotone operators. By its definition, the Douglas-Rachford operator is not symmetric with respect to the order of the two operators.
Bauschke, Heinz H., Moursi, Walaa M.
core   +1 more source

Circular cone convexity and some inequalities associated with circular cones

, 2013
The study of this paper consists of two aspects. One is characterizing the so-called circular cone convexity of f by exploiting the second-order differentiability of fLθ; the other is introducing the concepts of determinant and trace associated with ...
Jinchuan Zhou, Jein-Shan Chen, Hao-Feng Hung   +2 more
semanticscholar   +1 more source

A Robust Interior Point Method for Computing the Analytic Center of an Ill-Conditioned Polytope with Errors

Journal of Computational Mathematics, 2019
In this paper we propose an efficient and robust method for computing the analytic center of the polyhedral set P = {x ∈ R | Ax = b, x ≥ 0}, where the matrix A ∈ Rm×n is ill-conditioned, and there are errors in A and b.
Zhouhong Wang sci
semanticscholar   +1 more source

On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems

EURO Journal on Computational Optimization, 2016
We analyze the proximal alternating linearized minimization algorithm (PALM) for solving non-smooth convex minimization problems where the objective function is a sum of a smooth convex function and block separable non-smooth extended real-valued convex ...
Ron Shefi, Marc Teboulle
doaj   +1 more source

Eighteenth Order Convergent Method for Solving Non-Linear Equations

, 2017
In this paper, the Eighteenth Order Convergent Method (EOCM) developed by Vatti et.al is considered and this method is further studied without the presence of second derivative.
V. B. Vatti, R. Sri, M. S. K. Mylapalli
semanticscholar   +1 more source

A center of a polytope: An expository review and a parallel implementation

, 1993
International Journal of Mathematics and Mathematical Sciences, Volume 16, Issue 2, Page 209-224, 1993.
S. K. Sen, Hongwei Du, D. W. Fausett
wiley   +1 more source