scholarly journals A second-order globally convergent direct-search method and its worst-case complexity

Optimization ◽  
2015 ◽  
Vol 65 (6) ◽  
pp. 1105-1128 ◽  
Author(s):  
S. Gratton ◽  
C. W. Royer ◽  
L. N. Vicente
Keyword(s):  
Direct Search ◽  
Search Method ◽  
Second Order ◽  
Worst Case ◽  
Direct Search Method ◽  
Case Complexity ◽  
Globally Convergent ◽  
Worst Case Complexity

scholarly journals On the optimal order of worst case complexity of direct search

2015 ◽  
Vol 10 (4) ◽  
pp. 699-708 ◽  
Author(s):  
M. Dodangeh ◽  
L. N. Vicente ◽  
Z. Zhang
Keyword(s):  
Direct Search ◽  
Optimal Order ◽  
Worst Case ◽  
Case Complexity ◽  
Worst Case Complexity

scholarly journals Worst case complexity of direct search under convexity

2014 ◽  
Vol 155 (1-2) ◽  
pp. 307-332 ◽  
Author(s):  
M. Dodangeh ◽  
L. N. Vicente
Keyword(s):  
Direct Search ◽  
Worst Case ◽  
Case Complexity ◽  
Worst Case Complexity

scholarly journals A DIRECT SEARCH METHOD FOR WORST CASE ANALYSIS AND YIELD OPTIMIZATION OF INTEGRATED CIRCUITS

2009 ◽  
Vol 18 (07) ◽  
pp. 1185-1204 ◽  
Author(s):  
GREGOR CIJAN ◽  
TADEJ TUMA ◽  
ÁRPÁD BŰRMEN
Keyword(s):  
Integrated Circuits ◽  
Integrated Circuit ◽  
Inequality Constraint ◽  
Direct Search ◽  
Search Method ◽  
Worst Case Analysis ◽  
Efficient Manner ◽  
Worst Case ◽  
Direct Search Method ◽  
Yield Maximization

Yield maximization is an important aspect in the design of integrated circuits. A prerequisite for its automation is a reliable and fast worst performance analysis which results in corners that can be used in the process of circuit optimization. We formulate the constrained optimization problem for finding the worst performance of an integrated circuit and develop a direct search method for solving it. The algorithm uses radial steps and rotations for enforcing the inequality constraint. We demonstrate the performance of the proposed algorithm on real world design examples of integrated circuits. The results indicate that the algorithm solves the worst performance problem in an efficient manner. The proposed algorithm was also successfully used in the process of yield maximization, resulting in a 99.65% yield.

scholarly journals A Frame-Based Conjugate Gradients Direct Search Method with Radial Basis Function Interpolation Model

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Xiaowei Fang ◽  
Qin Ni
Keyword(s):  
Radial Basis Function ◽  
Basis Function ◽  
Direct Search ◽  
Search Method ◽  
Conjugate Gradients ◽  
Test Problems ◽  
Interpolation Model ◽  
Direct Search Method ◽  
Radial Basis Function Interpolation ◽  
Radial Basis

In this paper, we propose a new hybrid direct search method where a frame-based PRP conjugate gradients direct search algorithm is combined with radial basis function interpolation model. In addition, the rotational minimal positive basis is used to reduce the computation work at each iteration. Numerical results for solving the CUTEr test problems show that the proposed method is promising.

Sign in / Sign up

Export Citation Format

Share Document