ABSTRACT: The alternating direction method of multipliers (ADMM) and its symmetric version are efficient for minimizing two-block separable problems with linear constraints. However, both ADMM and ...

Many important practical computations, such as scheduling, combinatorial, and optimization problems, use techniques known as integer programming to find the best combination of many variables. In ...

Abstract: This paper proposes an almost feasible Sequential Linear Programming (afSLP) algorithm. In the first part, the practical limitations of previously proposed Feasible Sequential Linear ...

Many experts believe that once quantum computers are big enough and reliable enough to solve useful problems, the most common deployment architecture will be to have them serve as accelerators for ...

ABSTRACT: The solutions of Linear Programming Problems by the segmentation of the cuboidal response surface through the Super Convergent Line Series methodologies were obtained. The cuboidal response ...

There has recently been impressive progress—after nearly 50 years of stagnation—in algorithms that find solutions for certain hard computational problems, including the famous Hamiltonian problem.