Displaying similar documents to “On a modified Kovarik algorithm for symmetric matrices.”

A modified algorithm for the strict feasibility problem

D. Benterki, B. Merikhi (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.

A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem

Yazheng Dang, Yan Gao (2014)

Applications of Mathematics

Similarity:

In this paper, we present a simultaneous subgradient algorithm for solving the multiple-sets split feasibility problem. The algorithm employs two extrapolated factors in each iteration, which not only improves feasibility by eliminating the need to compute the Lipschitz constant, but also enhances flexibility due to applying variable step size. The convergence of the algorithm is proved under suitable conditions. Numerical results illustrate that the new algorithm has better convergence...

A numerical feasible interior point method for linear semidefinite programs

Djamel Benterki, Jean-Pierre Crouzeix, Bachir Merikhi (2007)

RAIRO - Operations Research

Similarity:

This paper presents a feasible primal algorithm for linear semidefinite programming. The algorithm starts with a strictly feasible solution, but in case where no such a solution is known, an application of the algorithm to an associate problem allows to obtain one. Finally, we present some numerical experiments which show that the algorithm works properly.