Amith Singhee
ABSTRACT
The convex weighted-sum method for multi-objective optimization has the desirable property of not worsening the difficulty of the optimization problem, but can lead to very nonuniform sampling. This paper explains the relationship between the weights and the partial derivatives of the tradeoff surface, and shows how to use it to choose the right weights and uniformly sample largely convex tradeoff surfaces. It proposes a novel method, Derivative Pursuit (DP), that iteratively refines a simplicial approximation of the tradeoff surface by using partial derivative information to guide the weights generation. We demonstrate the improvements offered by DP on both synthetic and circuit test cases, including a 22 nm SRAM bitcell design problem with strict read and write yield constraints, and power and performance objectives.
- I. Das et al, "Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems," SIAM J. Optim., 8(3), 1998. Google Scholar
Digital Library
- G. Stehr et al, "Performance trade-off analysis of analog circuits by normal-boundary intersection," IEEE/ACM DAC, 2003. Google ScholarDigital Library
- A. Messac et al, "The normalized normal constraint method for generating the Pareto frontier," Struct. Multidisc. Optim., 25, 2003.Google Scholar
- I. Y. Kim et al, "Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation," Struct. Multidisc. Optim., 31, 2006.Google Scholar
- N. Srinivas, "Multiobjective optimization using nondominated sorting in genetic algorithms," Evol. Comput., 2(3), 1994. Google ScholarDigital Library
- T. McConaghy et al, "Variation-aware structural syntehsis of analog circuits via hierarchical building blocks and structural homotopy," IEEE Trans. CAD 28(9), 2009. Google ScholarDigital Library
- E. Zitzler et al, "Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach," IEEE Trans. Evol. Comput., 3(4), 1999. Google ScholarDigital Library
- I. Das et al, "A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems," Struct. Optim., 14, 1997.Google Scholar
- B. Fruhwirth et al, "Approximation of convex curves with application to bicriterial minimum cost flow problem," Euro. J. Oper. Res., 42, 1989.Google Scholar
- R. V. Efremov et al, "Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems," Ann. Oper. Res., 166, 2009.Google Scholar
- G. H. Golub and C. F. Van Loan, "Matrix Computations," JHU Press, 3 ed., 1996.Google Scholar
- C. Wann et al, "SRAM cell design for stability methodology," Int. Symp. VLSI Tech., 2005.Google Scholar
- A. Singhee et al, "Statistical blockade: very fast statistical simulation and modeling of rare circuit events and its application to SRAM circuit design," IEEE Trans. CAD, 28(8), 2009. Google ScholarDigital Library
- A. Conn et al, "A derivative-free optimization algorithm in practice," Symp. Multidisc. Anal. Optim., 1998.Google Scholar
Index Terms
- Pareto sampling: choosing the right weights by derivative pursuit
Recommendations
Reliability-based robust Pareto design of linear state feedback controllers using a multi-objective uniform-diversity genetic algorithm (MUGA)
In this paper, fuzzy threshold values, instead of crisp threshold values, have been used for optimal reliability-based multi-objective Pareto design of robust state feedback controllers for a single inverted pendulum having parameters with probabilistic ...
A numerical method for constructing the Pareto front of multi-objective optimization problems
In this paper, a new numerical method is presented for constructing an approximation of the Pareto front of multi-objective optimization problems. This method is based on the well-known scalarization approach by Pascoletti and Serafini. The proposed ...
Pareto Front Estimation Using Unit Hyperplane
Evolutionary Multi-Criterion OptimizationAbstractThis work proposes a method to estimate the Pareto front even in areas without objective vectors in the objective space. For the Pareto front approximation, we use a set of non-dominated points, objective vectors, in the objective space. To finely ...
Comments