Abstract. We present a line search multigrid method for solving discretized versions of general unconstrained infinite dimensional optimization problems. At each iteration on each level, the algorithm computes either a “direct search” direction on the current level or a “recursive search” direction from coarser level models. Introducing a new condition that must be satisfied by a backtracking l...

A tolerant derivative–free nonmonotone line search technique is proposed and analyzed. Several consecutive increases in the objective function and also non descent directions are admitted for unconstrained minimization. To exemplify the power of this new line search we describe a direct search algorithm in which the directions are chosen randomly. The convergence properties of this random metho...

When we search from a huge amount of documents, we often specify several keywords to narrow the result of the search. Though the searched documents contain all keywords, positions of the keywords are usually not considered. As the result, the search result contains some meaningless documents. In this paper, we propose two algorithms for nding documents in which all given keywords appear in neig...

Economic dispatch with valve point effect and Prohibited Operating Zones (POZs) is a non-convex and discontinuous optimization problem. Harmony Search (HS) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. The performances of these variants are severely affected by selection of different parameters of the algorithm. Intel...

We consider the line search problem in a submodular polytope P (f) ⊆ R: Given an arbitrary a ∈ R and x0 ∈ P (f), compute max{δ : x0 + δa ∈ P (f)}. The use of the discrete Newton’s algorithm for this line search problem is very natural, but no strongly polynomial bound on its number of iterations was known [Iwata, 2008]. We solve this open problem by providing a quadratic bound of n + O(n log n)...

This paper presents a pipelined match-line and a hierarchical search-line architecture to reduce power in contentaddressable memories (CAM). The overall power reduction is 60%, with 29% contributed by the pipelined match-lines and 31% contributed by the hierarchical search-lines. This proposed architecture is employed in the design of a 1024×144 bit ternary CAM, achieving 7 ns search cycle time...

Assembly Line production is one of the widely used basic principles in production system. The problem of Assembly Line Balancing deals with the distribution of activities among the workstations so that there will be maximum utilization of human resources and facilities without disturbing the work sequence. Research works reported in the literature mainly deals with minimization of idle time i.e...

We analyze symmetric pure strategy equilibria in dynamic sponsored search auction games using simulations, restricting the strategies to several in a class of greedy bidding strategies introduced by Cary et al. We show that a particular convergent strategy, “balanced bidding”, also exhibits high stability to deviations in the dynamic setting. On the other hand, a cooperative strategy which yiel...

assembly line production is one of the widely used basic principles in production system. the problem of assembly line balancing deals with the distribution of activities among the workstations so that there will be maximum utilization of human resources and facilities without disturbing the work sequence. research works reported in the literature mainly deals with minimization of idle time i.e...