Loading...
Search for: trust-region-algorithms
0.008 seconds

    A non-monotone trust region algorithm for unconstrained optimization with dynamic reference iteration updates using filter

    , Article Optimization ; Volume 61, Issue 6 , 2012 , Pages 733-763 ; 02331934 (ISSN) Fatemi, M ; Mahdavi-Amiri, N ; Sharif University of Technology
    2012
    Abstract
    We present a non-monotone trust region algorithm for unconstrained optimization. Using the filter technique of Fletcher and Leyffer, we introduce a new filter acceptance criterion and use it to define reference iterations dynamically. In contrast with the early filter criteria, the new criterion ensures that the size of the filter is finite. We also show a correlation between problem dimension and the filter size. We prove the global convergence of the proposed algorithm to first- and second-order critical points under suitable assumptions. It is significant that the global convergence analysis does not require the common assumption of monotonicity of the sequence of objective function... 

    A filter trust-region algorithm for unconstrained optimization with strong global convergence properties

    , Article Computational Optimization and Applications ; Volume 52, Issue 1 , 2012 , Pages 239-266 ; 09266003 (ISSN) Fatemi, M ; Mahdavi Amiri, N ; Sharif University of Technology
    Abstract
    We present a new filter trust-region approach for solving unconstrained nonlinear optimization problems making use of the filter technique introduced by Fletcher and Leyffer to generate non-monotone iterations. We also use the concept of a multidimensional filter used by Gould et al. (SIAM J. Optim. 15(1):17-38, 2004) and introduce a new filter criterion showing good properties. Moreover, we introduce a new technique for reducing the size of the filter. For the algorithm, we present two different convergence analyses. First, we show that at least one of the limit points of the sequence of the iterates is first-order critical. Second, we prove the stronger property that all the limit points... 

    An efficient optimization problem for modal reflectivity at optical waveguide end-facet based on the formulation of characteristic green’s function technique

    , Article 4th International Conference on Photonics, Optics and Laser Technology, PHOTOPTICS 2015, 12 March 2015 through 14 March 2015 ; Volume 181 , 2016 , Pages 105-117 ; 09308989 (ISSN); 9783319301358 (ISBN) Torabi, A ; Shishegar, A. A ; IEEE Photonics Society and Photonics21 ; Sharif University of Technology
    Springer Science and Business Media, LLC  2016
    Abstract
    A novel method to compute guided mode reflectivity from optical waveguide end-facet is presented in this paper. First, rational function fitting method (RFFM) is applied in characteristic Green’s function (CGF) technique to find an approximate closed-form analytic expression for spatial Green’s function of abruptly truncated slab waveguide. Then, derived closed-form relation along with the exact results of spatial Green’s function, obtained by full wave solution, are incorporated in an efficient optimization problem. The fast Newton reflective method with trust region algorithm are utilized for optimized reflection coefficients of guided modes. The main advantage of the proposed CGF-RFFM...