Aubrey Poore - Academia.edu (original) (raw)
Uploads
Papers by Aubrey Poore
SIAM Journal on Control and Optimization, 1996
Electrical Engineering & Applied Signal Processing Series, 2001
Siam J Optimization, 1993
Combinatorial Optimization, 2000
Storage and Retrieval For Image and Video Databases, 1993
A multi-sensor multi-target tracker based on the use of near optimal and real-time algorithms for... more A multi-sensor multi-target tracker based on the use of near optimal and real-time algorithms for data association has been developed.
Comput Optim Appl, 1994
The ever-increasing demand in surveillance is to produce highly accurate target and track identif... more The ever-increasing demand in surveillance is to produce highly accurate target and track identification and estimation in real-time, even for dense target scenarios and in regions of high track contention. The use of multiple sensors, through more varied information, has the potential to greatly enhance target identification and state estimation. For multitarget tracking, the processing of multiple scans all at
Proceedings of SPIE - The International Society for Optical Engineering
ABSTRACT
Cooperative Systems, 2003
4th Symposium on Multidisciplinary Analysis and Optimization, 1992
Signal and Data Processing of Small Targets 2001, 2001
This work presents some initial steps in the development of a decentralized network centric multi... more This work presents some initial steps in the development of a decentralized network centric multiple frame assignment (MFA) class of architecture algorithms that affordably preserves the quality of a centralized architecture across a network of platforms while managing communication loading and achieving a consistent air picture on entities of interest for each platform. In particular, this work discussed four architectures, namely, Centralized, Network MFA Centralized, Network MFA on Local Data and Network Tracks, and Network MFA on All Data and Network Tracks and the results of extensive computations with the architectures.
Signal and Data Processing of Small Targets 2005, 2005
ABSTRACT
SIAM Journal on Scientific and Statistical Computing, 1991
SIAM Journal on Control and Optimization, 1988
ABSTRACT Smooth penalty functions can be combined with numerical continuation/bifurcation techniq... more ABSTRACT Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrained optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.
Annals of Operations Research, 1990
Bifurcation and continuation techniques are introduced as a class of methods for investigating th... more Bifurcation and continuation techniques are introduced as a class of methods for investigating the parametric nonlinear programming problem. Motivated by the Fritz John first-order necessary conditions, the parametric programming problem is first reformulated as a closed system of nonlinear equations which contains all Karush-Kuhn-Tucker and Fritz John points, both feasible and infeasible solutions, and relative minima, maxima, and saddle points.
Computational Optimization and Applications, Sep 1, 1997
SIAM Journal on Control and Optimization, 1996
Electrical Engineering & Applied Signal Processing Series, 2001
Siam J Optimization, 1993
Combinatorial Optimization, 2000
Storage and Retrieval For Image and Video Databases, 1993
A multi-sensor multi-target tracker based on the use of near optimal and real-time algorithms for... more A multi-sensor multi-target tracker based on the use of near optimal and real-time algorithms for data association has been developed.
Comput Optim Appl, 1994
The ever-increasing demand in surveillance is to produce highly accurate target and track identif... more The ever-increasing demand in surveillance is to produce highly accurate target and track identification and estimation in real-time, even for dense target scenarios and in regions of high track contention. The use of multiple sensors, through more varied information, has the potential to greatly enhance target identification and state estimation. For multitarget tracking, the processing of multiple scans all at
Proceedings of SPIE - The International Society for Optical Engineering
ABSTRACT
Cooperative Systems, 2003
4th Symposium on Multidisciplinary Analysis and Optimization, 1992
Signal and Data Processing of Small Targets 2001, 2001
This work presents some initial steps in the development of a decentralized network centric multi... more This work presents some initial steps in the development of a decentralized network centric multiple frame assignment (MFA) class of architecture algorithms that affordably preserves the quality of a centralized architecture across a network of platforms while managing communication loading and achieving a consistent air picture on entities of interest for each platform. In particular, this work discussed four architectures, namely, Centralized, Network MFA Centralized, Network MFA on Local Data and Network Tracks, and Network MFA on All Data and Network Tracks and the results of extensive computations with the architectures.
Signal and Data Processing of Small Targets 2005, 2005
ABSTRACT
SIAM Journal on Scientific and Statistical Computing, 1991
SIAM Journal on Control and Optimization, 1988
ABSTRACT Smooth penalty functions can be combined with numerical continuation/bifurcation techniq... more ABSTRACT Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrained optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.
Annals of Operations Research, 1990
Bifurcation and continuation techniques are introduced as a class of methods for investigating th... more Bifurcation and continuation techniques are introduced as a class of methods for investigating the parametric nonlinear programming problem. Motivated by the Fritz John first-order necessary conditions, the parametric programming problem is first reformulated as a closed system of nonlinear equations which contains all Karush-Kuhn-Tucker and Fritz John points, both feasible and infeasible solutions, and relative minima, maxima, and saddle points.
Computational Optimization and Applications, Sep 1, 1997