R. Freund, H. Men, C. Nguyen, P. Parrilo and J. Peraire

Slides:



Advertisements
Similar presentations
Consistent Bipartite Graph Co-Partitioning for High-Order Heterogeneous Co-Clustering Tie-Yan Liu WSM Group, Microsoft Research Asia Joint work.
Advertisements

Efficiency and Productivity Measurement: Data Envelopment Analysis
Component Analysis (Review)
Various Regularization Methods in Computer Vision Min-Gyu Park Computer Vision Lab. School of Information and Communications GIST.
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Engineering Optimization
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2013 – 12269: Continuous Solution for Boundary Value Problems.

Dragan Jovicic Harvinder Singh
Zuse Institute Berlin DFG Research Center MATHEON Finite Element Methods for Maxwell‘s Equations Jan Pomplun, Frank Schmidt Computational Nano-Optics Group.
Manifold Sparse Beamforming
Lecture 8 – Nonlinear Programming Models Topics General formulations Local vs. global solutions Solution characteristics Convexity and convex programming.
Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.
Optimization in Financial Engineering Yuriy Zinchenko Department of Mathematics and Statistics University of Calgary December 02, 2009.
Shape From Light Field meets Robust PCA
Limitation of Pulse Basis/Delta Testing Discretization: TE-Wave EFIE difficulties lie in the behavior of fields produced by the pulse expansion functions.
Multi-objective Approach to Portfolio Optimization 童培俊 张帆.
Photonic Crystals and Negative Refraction Dane Wheeler Jing Zhang.
QEC’07-1 ASF 6/13/2015 MIT Lincoln Laboratory Channel-Adapted Quantum Error Correction Andrew Fletcher QEC ‘07 21 December 2007.
Efficient Convex Relaxation for Transductive Support Vector Machine Zenglin Xu 1, Rong Jin 2, Jianke Zhu 1, Irwin King 1, and Michael R. Lyu 1 4. Experimental.
EMGT 501 HW # (b) (c) 6.1-4, Due Day: Sep. 21.
Reformulated - SVR as a Constrained Minimization Problem subject to n+1+2m variables and 2m constrains minimization problem Enlarge the problem size and.
Agilent Technologies Optical Interconnects & Networks Department Photonic Crystals in Optical Communications Mihail M. Sigalas Agilent Laboratories, Palo.
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Santiago, July, 2010 One paper in Journal of Computational Physics, another paper submitted to Physics Review Band.
Data Envelopment Analysis. Weights Optimization Primal – Dual Relations.
Jinhui Tang †, Shuicheng Yan †, Richang Hong †, Guo-Jun Qi ‡, Tat-Seng Chua † † National University of Singapore ‡ University of Illinois at Urbana-Champaign.
Optimization for Operation of Power Systems with Performance Guarantee
The method of moments in dynamic optimization
Some of the applications of Photonic Crystals (by no means a complete overview) Prof. Maksim Skorobogatiy École Polytechnique de Montréal.
Grating reconstruction forward modeling part Mark van Kraaij CASA PhD-day Tuesday 13 November 2007.
Stochastic Linear Programming by Series of Monte-Carlo Estimators Leonidas SAKALAUSKAS Institute of Mathematics&Informatics Vilnius, Lithuania
MW 3:10 - 4:25 PMFeatheringill 300 Professor Sharon Weiss Timeline of Important Events Related to the Development of the Photonic Crystal Research Area.
1 Kernel based data fusion Discussion of a Paper by G. Lanckriet.
Chapter 24 – Multicriteria Capital Budgeting and Linear Programming u Linear programming is a mathematical procedure, usually carried out by computer software,
Large-Scale Matrix Factorization with Missing Data under Additional Constraints Kaushik Mitra University of Maryland, College Park, MD Sameer Sheoreyy.
Finite Element Modelling of Photonic Crystals Ben Hiett J Generowicz, M Molinari, D Beckett, KS Thomas, GJ Parker and SJ Cox High Performance Computing.
Application of Finite Element Methods to Photonic Crystal Modelling B.P. Hiett D. Beckett, S.J. Cox, J. Generowicz, M. Molinari, K.S. Thomas High Performance.
Nonlinear Dimension Reduction: Semi-Definite Embedding vs. Local Linear Embedding Li Zhang and Lin Liao.
3.6 Solving Systems of Linear Equations in Three Variables ©2001 by R. Villar All Rights Reserved.
Progress Report #2 Alvaro Velasquez. Project Selection I chose to work with Nasim Souly on the project titled “Subspace Clustering via Graph Regularized.
Pareto-Optimality of Cognitively Preferred Polygonal Hulls for Dot Patterns Antony Galton University of Exeter UK.
Principal Component Analysis (PCA)
Support vector machines
Photonic Crystals: Periodic Surprises in Electromagnetism
Four wave mixing in submicron waveguides
Photonic Bandgap (PBG) Concept
Ch 12. Continuous Latent Variables ~ 12
Multiplicative updates for L1-regularized regression
Amir Ali Ahmadi (Princeton University)
R. Freund, H. Men, C. Nguyen, P. Parrilo and J. Peraire
ME 521 Computer Aided Design 15-Optimization
Maksim Skorobogatiy John Joannopoulos MIT, Department of Physics
Lecture 8 – Nonlinear Programming Models
Mathematical Programming (towards programming with math)
Support vector machines
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John.
Support Vector Machines
Structural Optimization Design ( Structural Analysis & Optimization )
Support vector machines
A particular discrete dynamical program used as a model for one specific situation in chess involving knights and rooks 22nd EUROPEAN CONFERENCE ON OPERATIONS.
Support vector machines
Principal Component Analysis
Nonlinear Dimension Reduction:
Dr. Arslan Ornek DETERMINISTIC OPTIMIZATION MODELS
One-shot learning and generation of dexterous grasps
Non-Negative Matrix Factorization
Fig. 2 Optomechanical scheme to measure photon angular momentum and optical torque in a waveguide. Optomechanical scheme to measure photon angular momentum.
Sebastian Semper1 and Florian Roemer1,2
Presentation transcript:

R. Freund, H. Men, C. Nguyen, P. Parrilo and J. Peraire Band Gap Optimization of 2-Dimensional Photonic Crystals using Semidefinite Programming and Subspace Methods R. Freund, H. Men, C. Nguyen, P. Parrilo and J. Peraire MIT Santiago, July, 2010 One paper in Journal of Computational Physics, another paper submitted to Physics Review MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Wave Propagation in Periodic Media For most l, beam(s) propagate through crystal without scattering (scattering cancels coherently). But for some l (~ 2a), no light can propagate: a band gap scattering ( from S.G. Johnson ) 1887 - Rayleigh 1987 – Yablonovitch & John MASSACHUSETTS INSTITUTE OF TECHNOLOGY

S. G. Johnson et al., Appl. Phys. Lett. 77, 3490 (2000) Photonic Crystals 3D Crystals Band Gap: Objective S. G. Johnson et al., Appl. Phys. Lett. 77, 3490 (2000) Applications By introducing “imperfections” one can develop: Waveguides Hyperlens Resonant cavities Switches Splitters … Mangan, et al., OFC 2004 PDP24 MASSACHUSETTS INSTITUTE OF TECHNOLOGY

The Optimal Design Problem for Photonic Crystals A photonic crystal with optimized 7th band gap. MASSACHUSETTS INSTITUTE OF TECHNOLOGY

The Optimal Design Problem for Photonic Crystals MASSACHUSETTS INSTITUTE OF TECHNOLOGY

The Optimal Design Problem for Photonic Crystals MASSACHUSETTS INSTITUTE OF TECHNOLOGY

The Optimal Design Problem for Photonic Crystals ? MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Previous Work There are some approaches proposed for solving the band gap optimization problem: Cox and Dobson (2000) first considered the mathematical optimization of the band gap problem and proposed a projected generalized gradient ascent method. Sigmund and Jensen (2003) combined topology optimization with the method of moving asymptotes (Svanberg (1987)). Kao, Osher, and Yablonovith (2005) used “the level set” method with a generalized gradient ascent method. However, these earlier proposals are gradient-based methods and use eigenvalues as explicit functions. They suffer from the low regularity of the problem due to eigenvalue multiplicity. MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Our Approach Replace original eigenvalue formulation by a subspace method, and Convert the subspace problem to a convex semidefinite program (SDP) via semi-definite inclusion and linearization. MASSACHUSETTS INSTITUTE OF TECHNOLOGY

First Step: Standard Discretizaton MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Optimization Formulation: P0 Typically, MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Parameter Dependence MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Change of Decision Variables MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Reformulating the problem: P1 We demonstrate the reformulation in the TE case, This reformulation is exact, but non-convex and large-scale. We use a subspace method to reduce the problem size. MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Subspace Method MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Subspace Method, continued MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Subspace Method, continued MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Linear Fractional SDP : MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Solution Procedure The SDP optimization problems can be solved efficiently using modern interior-point methods [Toh et al. (1999)]. MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Results: Optimal Structures MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Results: Computation Time All computation performed on a Linux PC with Dual Core AMD Opteron 270, 2.0 GHz. The eigenvalue problem is solved by using the ARPACK software. MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Mesh Adaptivity : Refinement Criteria Interface elements 2:1 rule MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Mesh Adaptivity : Solution Procedure MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Results: Optimization Process MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Results: Computation Time MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Multiple Band Gap Optimization Multiple band gap optimization is a natural extension of the previous single band gap optimization that seeks to maximize the minimum of weighted gap-midgap ratios: MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Multiple Band Gap Optimization Even with other things being the same (e.g., discretization, change of variables, subspace construction), the multiple band gap optimization problem cannot be reformulated as a linear fractional SDP. We start with: where MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Multiple Band Gap Optimization This linearizes to: where MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Solution Procedure MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Sample Computational Results: 2nd and 5th TM Band Gaps MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Sample Computational Results: 2nd and 5th TM Band Gaps MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Optimized Structures TE polarization, Triangular lattice, 1st and 3rd band gaps TEM polarizations, Square lattice, Complete band gaps, 9th and 12th band gaps MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Results: Pareto Frontiers of 1st and 3rd TE Band Gaps TE polarization MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Results: Computational Time Square lattice Execution Time (minutes) MASSACHUSETTS INSTITUTE OF TECHNOLOGY

Future work Design of 3-dimensional photonic crystals, Incorporate robust fabrication constraints, Band-gap design optimization for other wave propagation problems, e.g., acoustic, elastic … Non-periodic structures, e.g., photonic crystal fibers. MASSACHUSETTS INSTITUTE OF TECHNOLOGY