TY - GEN
T1 - Pareto front identification via objective vector Jacobian matrix singularity
AU - Brown, Brandon
AU - Singh, Tarunraj
AU - Rai, Rahul
PY - 2013
Y1 - 2013
N2 - This paper presents a method to identify the exact Pareto front for a multi-objective optimization problem. The developed technique addresses the identification of the Pareto frontier in the cost space and the Pareto set in the design space for both constrained and unconstrained optimization problems. The proposed approach identifies a n - 1 dimensional hypersurface for a multi-objective problem with n cost functions, a subset of which constitute the Pareto front. The n - 1 dimensional hypersurface is identified by enforcing a singularity constraint on the Jacobian of the cost vector with respect to the optimization parameters. Since the boundary is identified in the design space, the relation of design points to the exact Pareto front in the cost space is known. The proposed method is proven effective in the Pareto identification for a set of previously released challenge problems. Six of these examples are included in this paper; 3 unconstrained and 3 constrained.
AB - This paper presents a method to identify the exact Pareto front for a multi-objective optimization problem. The developed technique addresses the identification of the Pareto frontier in the cost space and the Pareto set in the design space for both constrained and unconstrained optimization problems. The proposed approach identifies a n - 1 dimensional hypersurface for a multi-objective problem with n cost functions, a subset of which constitute the Pareto front. The n - 1 dimensional hypersurface is identified by enforcing a singularity constraint on the Jacobian of the cost vector with respect to the optimization parameters. Since the boundary is identified in the design space, the relation of design points to the exact Pareto front in the cost space is known. The proposed method is proven effective in the Pareto identification for a set of previously released challenge problems. Six of these examples are included in this paper; 3 unconstrained and 3 constrained.
UR - https://www.scopus.com/pages/publications/84896953665
U2 - 10.1115/DETC2013-12271
DO - 10.1115/DETC2013-12271
M3 - Conference contribution
AN - SCOPUS:84896953665
SN - 9780791855898
T3 - Proceedings of the ASME Design Engineering Technical Conference
BT - 39th Design Automation Conference
PB - American Society of Mechanical Engineers
T2 - ASME 2013 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, IDETC/CIE 2013
Y2 - 4 August 2013 through 7 August 2013
ER -