Displaying similar documents to “Further Notes on Convergence of the Weiszfeld Algorithm”

A PVT-Type Algorithm for Minimizing a Nonsmooth Convex Function

Pang, Li-Ping, Xia, Zun-Quan (2003)

Serdica Mathematical Journal

Similarity:

2000 Mathematics Subject Classification: 90C25, 68W10, 49M37. A general framework of the (parallel variable transformation) PVT-type algorithm, called the PVT-MYR algorithm, for minimizing a non-smooth convex function is proposed, via the Moreau-Yosida regularization. As a particular scheme of this framework an ε-scheme is also presented. The global convergence of this algorithm is given under the assumptions of strong convexity of the objective function and an ε-descent...

A new nonmonotone adaptive trust region algorithm

Ahmad Kamandi, Keyvan Amini (2022)

Applications of Mathematics

Similarity:

We propose a new and efficient nonmonotone adaptive trust region algorithm to solve unconstrained optimization problems. This algorithm incorporates two novelties: it benefits from a radius dependent shrinkage parameter for adjusting the trust region radius that avoids undesirable directions and exploits a new strategy to prevent sudden increments of objective function values in nonmonotone trust region techniques. Global convergence of this algorithm is investigated under some mild...

The classic differential evolution algorithm and its convergence properties

Roman Knobloch, Jaroslav Mlýnek, Radek Srb (2017)

Applications of Mathematics

Similarity:

Differential evolution algorithms represent an up to date and efficient way of solving complicated optimization tasks. In this article we concentrate on the ability of the differential evolution algorithms to attain the global minimum of the cost function. We demonstrate that although often declared as a global optimizer the classic differential evolution algorithm does not in general guarantee the convergence to the global minimum. To improve this weakness we design a simple modification...

A sparse dynamic programming algorithm for alignment with non-overlapping inversions

Alair Pereira Do Lago, Ilya Muchnik, Casimir Kulikowski (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Alignment of sequences is widely used for biological sequence comparisons, and only biological events like mutations, insertions and deletions are considered. Other biological events like inversions are not automatically detected by the usual alignment algorithms, thus some alternative approaches have been tried in order to include inversions or other kinds of rearrangements. Despite many important results in the last decade, the complexity of the problem of alignment with inversions...