This paper presents Chemo-tactic PSO-DE (CPSO-DE) optimization algorithm combined with Lagrange Relaxation method (LR) for solving Unit Commitment (UC) problem. The proposed approach employs Chemo-tactic PSO-DE algorithm for optimal settings of Lagrange multipliers. It provides high-quality performance and reaches global solution and is a hybrid heuristic algorithm based on Bacterial Foraging O...

Arterial spin labeled (ASL) perfusion MRI provides a noninvasive approach for longitudinal imaging of regional brain function in infants. In the present study, continuous ASL (CASL) perfusion MRI was carried out in normally developing 7- and 13-month-old infants while asleep without sedation. The 13-month infant group showed an increase (P<0.05) of relative CBF in frontal regions as compared to...

W describe a new algorithm for computing the efficient frontier of the “bi-objective maximum-flow network-interdiction problem.” In this problem, an “interdictor” seeks to interdict (destroy) a set of arcs in a capacitated network that are Pareto-optimal with respect to two objectives, minimizing total interdiction cost and minimizing maximum flow. The algorithm identifies these solutions throu...

the development of the dynamical core of a potential-vorticity-based atmospheric general circulation model is explored. there are some advantages of using potential vorticity (pv) as a prognostic variable in that the resulting model can give more accurate simulation of the evolution of pv, as arguably the most fundamental dynamical quantity. further, there is possibility of explicit representat...

Dual decomposition has been recently proposed as a way of combining complementary models, with a boost in predictive power. However, in cases where lightweight decompositions are not readily available (e.g., due to the presence of rich features or logical constraints), the original subgradient algorithm is inefficient. We sidestep that difficulty by adopting an augmented Lagrangian method that ...

The Cognitive Agent Specification Language (CASL) is a framework for specifying and verifying complex communicating multiagent systems. In this paper, we extend CASL to incorporate a formal model of means-end reasoning suitable for a multiagent context. In particular, we define a simple model of cooperative ability, give a definition of rational plans, and show how an agent’s intentions play a ...

Lagrangian relaxation has been used extensively in the design of approximation algorithms. This paper studies its strengths and limitations when applied to Partial Cover. We show that for Partial Cover in general no algorithm that uses Lagrangian relaxation and a Lagrangian Multiplier Preserving (LMP) α-approximation as a black box can yield an approximation factor better than 4 3 α. This match...

In this paper we present an accelerated Augmented Lagrangian Method for the solution of constrained convex optimization problems in the Basis Pursuit De-Noising (BPDN) form. The technique relies on on Augmented Lagrangian Methods (ALMs), particularly the Alternating Direction Method of Multipliers (ADMM). Here, we present an application of the Constrained Split Augmented Lagrangian Shrinkage Al...

This paper extends the derivative-free descent method [18] for the nonlinear complementarity problem to the symmetric cone complementarity problem (SCCP). The algorithm is based on the unconstrained implicit Lagrangian reformulation of the SCCP, but uses a convex combination of the negative partial gradients of the implicit Lagrangian function ψα, i.e. the vector of the form −θ∇xψα −(1 −θ)∇yψα ...