There are several range-based localization algorithms that identify sensor’s positions for different wireless sensor networks. In this paper we propose the approach that highlights a new method of localization scheme to achieve high localization accuracy in the presence of radio irregularity and obstacles effects for wireless sensor networks. We present the evaluation of complex localization sc...

We propose an infeasible interior point method for pointwise state constrained optimal control problems with linear elliptic PDEs. A smoothed constraint violation functional is used to develop a self-concordant barrier approach in an infinite-dimensional setting. We provide a detailed convergence analysis in function space for this approach. The quality of the smoothing is described by a parame...

A linear program is typically specified by a matrix A together with two vectors b and c, where A is an n-by-d matrix, b is an n-vector and c is a d-vector. There are several canonical forms for defining a linear program using (A, b, c). One commonly used canonical form is: max cx s.t. Ax ≤ b and its dual min by s.t A y = c, y ≥ 0. In [Ren95b, Ren95a, Ren94], Renegar defined the condition number...

We consider Constrained Semi-Assignment Problems, where one has to optimally assign discrete values to decision variables, and where furthermore logical constraints restrict the set of feasible assignments. We present a heuristic approach based on a continuous relaxation. More precisely, we consider a discrete dynamical system evolving in the interior of a polytope whose extremal points corresp...

A classical problem in the study of an infeasible system linear inequalities is to determine irreducible subsystems (IISs), i.e., subsets whose proper are feasible. In this article, we examine a particular situation where only given subsystem interest for analysis infeasibility. For this, define relatively (RIISs) as that with respect subsystem. It generalization definition IIS, since IIS full ...

This brief introduces a novel differential dynamic programming (DDP) algorithm for solving discrete-time finite-horizon optimal control problems with inequality constraints. Two variants, namely feasible- and infeasible-IPDDP algorithms, are developed using primal–dual interior-point methodology, their local quadratic convergence properties characterized. We show that the stationary points of a...

The use of optimization in a simulation based design environment has become a common trend in industry today. Computer simulation tools are common place in many engineering disciplines, providing the designers with tools to evaluate a design’s performance without building a physical prototype. This has triggered the development of optimization techniques suitable for dealing with such simulatio...