Displaying similar documents to “On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications”

Rescaled proximal methods for linearly constrained convex problems

Paulo J.S. Silva, Carlos Humes (2007)

RAIRO - Operations Research

Similarity:

We present an inexact interior point proximal method to solve linearly constrained convex problems. In fact, we derive a primal-dual algorithm to solve the KKT conditions of the optimization problem using a modified version of the rescaled proximal method. We also present a pure primal method. The proposed proximal method has as distinctive feature the possibility of allowing inexact inner steps even for Linear Programming. This is achieved by using an error criterion that ...

Conjugacy criteria for second order linear difference equations

Ondřej Došlý, Pavel Řehák (1998)

Archivum Mathematicum

Similarity:

We establish conditions which guarantee that the second order difference equation Δ 2 x k + p k x k + 1 = 0 possesses a nontrivial solution with at least two generalized zero points in a given discrete interval