Aubrey Poore - Profile on Academia.edu (original) (raw)
Papers by Aubrey Poore
Bifurcation Problems for Some Parametric Nonlinear Programs in Banach Spaces
SIAM Journal on Control and Optimization, 1996
Data Association Using Multiple Frame Assignments
Electrical Engineering & Applied Signal Processing Series, 2001
A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
Siam J Optimization, 1993
Combinatorial Optimization, 2000
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 once yields high track identification. However, to achieve this accurate state estimation and track identification, one must solve an NP-hard data association problem of partitioning observations into tracks and false alarms in real-time. Over the last ten years a new approach to the problem formulation based on multidimensional assignment problems and near optimal solution in real-time by Lagrangian relaxation has evolved and is proving to be superior to all other approaches. This work reviews the problem formulation and algorithms with some suggested future directions.
Coppice Management in East Anglian Woodlands and Its Application in Urban Fringe Nature Conservation
Data association problems posed as multidimensional assignment problems: problem for-mulation
Storage and Retrieval For Image and Video Databases, 1993
Optimization problems in multitarget/multisensor tracking
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.
Continuation and Bifurcation Investigations in Constrained Optimization
Multidimensional Assignment Formulation of Data Association Problems ising from Multitarget and Multisensor Tracking*
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
Public reporting burden for this collection of infonation is eastinated to average 1 hour per res... more Public reporting burden for this collection of infonation is eastinated to average 1 hour per response. induding ft time for reiewrig it data needed and corrpleting and remiewing this collection of infoinatjion. Send cominents regarding this burden eatirate or any other this burden to Depalnient of Defense, Washilgtoni HedquatersSAces, Directoratefor Infformation Operations md R"oits (07044 4302. Respondent should be avar that notwithstanditg any other prousion of law, no peron shall be subject to any penalty for faili ., mu i a uc leaton of infornation if it does not display a currently valid OMB control nunber. PLEASE DO NOT RETURN YOUR FORM 70 THE ABOVE ADDRESS.
Some Issues in Multiple Target Tracking and Resource Management
Proceedings of SPIE - The International Society for Optical Engineering
ABSTRACT
Network-Centric MFA Tracking Architectures
Cooperative Systems, 2003
Numerical continuation and bifurcation techniques for parametric nonlinear programming
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
Variable Order Adams-Bashforth Predictors with an Error-Stepsize Control for Continuation Methods
SIAM Journal on Scientific and Statistical Computing, 1991
The Expanded Lagrangian System for Constrained Optimization Problems
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.
Bifurcations in parametric 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
Large classes of data association problems in multiple target tracking applications involving bot... more Large classes of data association problems in multiple target tracking applications involving both multiple and single sensor systems can be formulated as multidimensional assignment problems. These NP-hard problems are large scale and sparse with noisy objective function values, but must be solved in "real-time". Lagrangian relaxation methods have proven to be particularly effective in solving these problems to the noise level in real-time, especially for dense scenarios and for multiple scans of data from multiple sensors. This work presents a new class of constructive Lagrangian relaxation algorithms that circumvent some of the deficiencies of previous methods. The results of several numerical studies demonstrate the efficiency and effectiveness of the new algorithm class.
Numerical Hopf Bifurcation Techniques and the Dynamics of the Tubular Reactor Model
Bifurcation Problems for Some Parametric Nonlinear Programs in Banach Spaces
SIAM Journal on Control and Optimization, 1996
Data Association Using Multiple Frame Assignments
Electrical Engineering & Applied Signal Processing Series, 2001
A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
Siam J Optimization, 1993
Combinatorial Optimization, 2000
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 once yields high track identification. However, to achieve this accurate state estimation and track identification, one must solve an NP-hard data association problem of partitioning observations into tracks and false alarms in real-time. Over the last ten years a new approach to the problem formulation based on multidimensional assignment problems and near optimal solution in real-time by Lagrangian relaxation has evolved and is proving to be superior to all other approaches. This work reviews the problem formulation and algorithms with some suggested future directions.
Coppice Management in East Anglian Woodlands and Its Application in Urban Fringe Nature Conservation
Data association problems posed as multidimensional assignment problems: problem for-mulation
Storage and Retrieval For Image and Video Databases, 1993
Optimization problems in multitarget/multisensor tracking
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.
Continuation and Bifurcation Investigations in Constrained Optimization
Multidimensional Assignment Formulation of Data Association Problems ising from Multitarget and Multisensor Tracking*
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
Public reporting burden for this collection of infonation is eastinated to average 1 hour per res... more Public reporting burden for this collection of infonation is eastinated to average 1 hour per response. induding ft time for reiewrig it data needed and corrpleting and remiewing this collection of infoinatjion. Send cominents regarding this burden eatirate or any other this burden to Depalnient of Defense, Washilgtoni HedquatersSAces, Directoratefor Infformation Operations md R"oits (07044 4302. Respondent should be avar that notwithstanditg any other prousion of law, no peron shall be subject to any penalty for faili ., mu i a uc leaton of infornation if it does not display a currently valid OMB control nunber. PLEASE DO NOT RETURN YOUR FORM 70 THE ABOVE ADDRESS.
Some Issues in Multiple Target Tracking and Resource Management
Proceedings of SPIE - The International Society for Optical Engineering
ABSTRACT
Network-Centric MFA Tracking Architectures
Cooperative Systems, 2003
Numerical continuation and bifurcation techniques for parametric nonlinear programming
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
Variable Order Adams-Bashforth Predictors with an Error-Stepsize Control for Continuation Methods
SIAM Journal on Scientific and Statistical Computing, 1991
The Expanded Lagrangian System for Constrained Optimization Problems
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.
Bifurcations in parametric 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
Large classes of data association problems in multiple target tracking applications involving bot... more Large classes of data association problems in multiple target tracking applications involving both multiple and single sensor systems can be formulated as multidimensional assignment problems. These NP-hard problems are large scale and sparse with noisy objective function values, but must be solved in "real-time". Lagrangian relaxation methods have proven to be particularly effective in solving these problems to the noise level in real-time, especially for dense scenarios and for multiple scans of data from multiple sensors. This work presents a new class of constructive Lagrangian relaxation algorithms that circumvent some of the deficiencies of previous methods. The results of several numerical studies demonstrate the efficiency and effectiveness of the new algorithm class.
Numerical Hopf Bifurcation Techniques and the Dynamics of the Tubular Reactor Model