This paper presents an active-set algorithm for large-scale optimization that occupies the middle ground between sequential quadratic programming (SQP) and sequential linear-quadratic programming (SL-QP) methods. It consists of two phases. The algorithm first minimizes a piecewise linear approximation of the Lagrangian, subject to a linearization of the constraints, to determine a working set. ...

We present a new evolutionary algorithm to solve the 0-1 multidimensional knapsack problem.We tackle the problem using duality concept, differently from traditional approaches. Ourmethod is based on Lagrangian relaxation. Lagrangemultipliers transform the problem, keeping the optimality as well as decreasing the complexity. However, it is not easy to find Lagrange multipliers nearest to the cap...

Based on the classic augmented Lagrangian multiplier method, we propose, analyze and test an algorithm for solving a class of equality-constrained nonsmooth optimization problems (chiefly but not necessarily convex programs) with a particular structure. The algorithm effectively combines an alternating direction technique with a nonmonotone line search to minimize the augmented Lagrangian funct...

The solution algorithm, based on Lagrangian relaxation, a sub-gradient method and a heuristic to find the upper bound of the solution, is proposed to solve the coordinated fleet routing and flight scheduling problems. Numerical tests are performed to evaluate the proposed algorithm using real operating data from two Taiwan airlines. The test results indicate that the solution algorithm is a sig...

In this paper we present a new local remeshing algorithm that is dedicated to the problem of erosion in finite elementmodels whose grid follows themovement of the free surface. Themethod, which we name Surface Lagrangian Remeshing (SLR), is adapted to 2D Lagrangian models which couple surface erosion with deformation of Earth materials. The remeshing procedure preserves nodes defining the surfa...

We prove cocompleteness of the category of CASL signatures , of monotone signatures, of strongly regular signatures and of strongly locally ltered signatures. This shows that using these signature categories is compatible with a pushout or colimit based module system.

We design a fast ascent direction algorithm for the Lagrangian dual problem of the single-machine scheduling problem of minimizing total weighted completion time subject to precedence constraints. We show that designing such an algorithm is relatively simple if a scheduling problem is formulated in terms of the job completion times rather than as an 0-1 linear program. Also, we show that upon t...

Nowadays, a rapid growth in the rate of life expectancy can be seen especially in the developed countries. Accordingly, the population of elderlies has been increased. By another point of view, the number of hospitals, retirement homes along with medical staffs has not been grown with a same rate. Hence, Home Health Care (HHC) operations including a set of nurses and patients have been develope...

This paper presents the Crossmodal Attentive Skill Learner (CASL), integrated with the recently-introduced Asynchronous Advantage Option-Critic (A2OC) architecture [Harb et al., 2017] to enable hierarchical reinforcement learning across multiple sensory inputs. We provide concrete examples where the approach not only improves performance in a single task, but accelerates transfer to new tasks. ...

Semantic Manufacturing has grown as an application area of the Semantic Web Framework. This approach enables reasoning on products in the form of ontologies and involves products requirements verification within its scope. However, there are cases where the expressivity of OWL, a defacto standard for the Semantic Web, is insufficient for expressing fundamental features of designs. As such featu...