Algorithms that find connections between concepts in semantic networks are inherently inefficient due to their dependence on piecemeal representation of potential paths. A method of reorganizing a link-based network into a path-based representation is argued to allow more efficient search techniques. A path-based representation is presented in terms of the knowledge representation language Conc...

We study the existence of homoclinic solutions for the second order Hamiltonian system ü+Vu(t, u) = f(t). Let V (t, u) = −K(t, u)+W (t, u) ∈ C1(R×Rn,R) be T -periodic in t, where K is a quadratic growth function and W may be asymptotically quadratic or super-quadratic at infinity. One homoclinic solution is obtained as a limit of solutions of a sequence of periodic second order differential equ...

This paper extends the SQP-approach of the well-known bundle-Newton method for nonsmooth unconstrained minimization to the nonlinearly constrained case. Instead of using a penalty function or a filter or an improvement function to deal with the presence of constraints, the search direction is determined by solving a convex quadratically constrained quadratic program to obtain good iteration poi...

Linear quadratic regulator (LQR) with trajectory sensitivity minimization and structurally constrained controller was formulated in [2] and [4]. In these works, a gradient search method, which is a particular type of nonlinear programming, was used to solve the problem. In this paper, we propose a linear matrix inequality (LMI)-based method for the problem. This LMI is formulated with block-dia...

This note considers offline optimization of a switching sequence for a given finite set of linear control systems, together with joint optimization of control laws. A linear quadratic full information criterion is optimized and dynamic programming is used to find an optimal switching sequence and control law. The main result is a method for efficient pruning of the search tree to avoid combinat...

{(f1(x), . . . , fm(x)) : x ∈ T } for quadratic polynomials f0, . . . , fm and a subset T of R . This paper studies semidefinite representation of the convex hull conv(V ) or its closure, i.e., describing conv(V ) by projections of spectrahedra (defined by linear matrix inequalities). When T is defined by a single quadratic constraint, we prove that conv(V ) is equal to the first order moment t...

Iterated local search is a stochastic local search (SLS) method that combines a perturbation step with an embedded local search algorithm. In this article, we propose a new way of hybridizing iterated local search. It consists in using an iterated local search as the embedded local search algorithm inside another iterated local search. This nesting of local searches and iterated local searches ...

A method is proposed for reducing the cost of computing search directions in an interior point method for a quadratic program. The KKT system is partitioned and modified, based on the ratios of the slack variables and dual variables associated with the inequality constraints, to produce a smaller, approximate linear system. Analytical and numerical results are included that suggest the distribu...

Artificial intelligence (AI) is an area of computer science that highlights the creation of machines that are intelligent, also they work and react like humans. Since AI problems are complex and cannot be solved with direct techniques we resort to heuristic search techniques. Heuristic search technique is any approach to problem solving, learning, or discovery which uses a practical methodology...

A method is proposed for reducing the cost of computing search directions in an interior point method for a quadratic program. The KKT system is partitioned and modified, based on the ratios of the slack variables and dual variables associated with the inequality constraints, to produce a smaller, approximate linear system. Analytical and numerical results are included that suggest the distribu...