Optimization

Efficient solutions to large-scale problems.

Much of MERL's research activity involves formulating scientific and engineering problems as optimizations, which can be solved in an efficient way. We have developed fundamental algorithms to better solve classic problems, such as quadratic programs and minimum-cost paths. Our work also involves developing theoretical bounds to understand performance limits.

  • News & Events

    •  TALK   Advances in Accelerated Computing
      Date & Time: Friday, February 2, 2018; 12:00
      Speaker: Dr. David Kaeli, Northeastern University
      MERL Host: Abraham Goldsmith
      Research Areas: Control, Optimization, Machine Learning, Speech & Audio
      Brief
      • GPU computing is alive and well! The GPU has allowed researchers to overcome a number of computational barriers in important problem domains. But still, there remain challenges to use a GPU to target more general purpose applications. GPUs achieve impressive speedups when compared to CPUs, since GPUs have a large number of compute cores and high memory bandwidth. Recent GPU performance is approaching 10 teraflops of single precision performance on a single device. In this talk we will discuss current trends with GPUs, including some advanced features that allow them exploit multi-context grains of parallelism. Further, we consider how GPUs can be treated as cloud-based resources, enabling a GPU-enabled server to deliver HPC cloud services by leveraging virtualization and collaborative filtering. Finally, we argue for for new heterogeneous workloads and discuss the role of the Heterogeneous Systems Architecture (HSA), a standard that further supports integration of the CPU and GPU into a common framework. We present a new class of benchmarks specifically tailored to evaluate the benefits of features supported in the new HSA programming model.
    •  
    •  NEWS   MERL invites applications for Visiting Faculty
      Date: February 15, 2018
      Brief
      • University faculty members are invited to spend part or all of their sabbaticals at MERL, pursuing projects of their own choosing in collaboration with MERL researchers.

        To apply, a candidate should identify and contact one or more MERL researchers with whom they would like to collaborate. The applicant and a MERL researcher will jointly prepare a proposal that the researcher will champion internally. Please visit the visiting faculty web page for further details: http://www.merl.com/employment/visiting-faculty.php.

        The application deadline for positions starting in Summer/Fall 2018 is February 15, 2018.
    •  

    See All News & Events for Optimization
  • Internships

    • CD1260: Model Predictive Control of Hybrid Systems

      The Control and Dynamical Systems (CD) group at MERL is seeking a highly motivated intern to work on hybrid model predictive control. The scope of work includes the development of model predictive control algorithms for hybrid dynamical systems, switched systems, and quantized systems, analysis and property proving, and applications in automotive, space systems, and energy systems. PhD students with expertise in some among control, optimization, model predictive control and hybrid systems, and with working knowledge of Matlab implementation are welcome to apply. The expected duration of the internship is 3-6 months with flexible start date.

    • SA1031: Distributed auctions for network welfare maximization

      We are looking for a talented individual to collaborate and facilitate research on new algorithms in mechanism design and distributed auctions. Responsibilities will include mathematical modeling, algorithm design, software prototyping, and running Monte Carlo simulations in a network traffic domain. Candidates should be strong scientific programmers and have some background in numerical optimization, simulation design, and auction theory.

    • CD1300: Compiler Optimizations for Linear Algebra Kernels

      MERL is looking for a highly motivated individual to work on automatic, compiler based techniques for optimizing linear algebra kernels. The ideal candidate is a Ph.D. student in computer science with extensive experience in compiler design and source code optimization techniques. In particular, the successful candidate will have a strong working knowledge of polyhedral optimization techniques, the LLVM compiler, and Polly. Strong C/C++ skills and knowledge of LLVM at the source level are required. Publication of results in conference proceedings and journals is expected. The expected duration of the internship is 3 months and the start date is flexible.


    See All Internships for Optimization
  • Openings


    See All Openings at MERL
  • Videos