Optimization and Algorithms Research

Optimization is in the center of every engineering discipline and every sector of the economy. Airlines and logistics companies run optimization algorithms to schedule their daily operations; power utilities rely on optimization to efficiently operate generators and renewable resources and distribute electricity; biotechnology firms search through massive genetic data using optimization to find new discoveries. UC Berkeley IEOR Department is at the forefront of optimization research. Our faculty and their students create new fields of optimization and push the boundaries in convex and nonconvex optimization, integer and combinatorial optimization to solve problems with massive data sets. Research activities are funded by NSF, DOE, DOD, ONR, and IBM Corporation.

Faculty

Ilan Adler

Professor
Head MEng Advisor

Anil Aswani

Associate Professor
Head Undergraduate Advisor

Alper Atamturk

Professor
MAnalytics Program Director

Ying Cui

Assistant Professor

Paul Grigas

Associate Professor

Dorit Hochbaum

Distinguished Professor
ORMS Advisor

Javad Lavaei

Associate Professor

Rajan Udwani

Assistant Professor

Laurent El Ghaoui

Joint Faculty, EECS

Selected Publications

Agency problem and mean field system of agents with moral hazard, synergistic effects and accidents

Subgradient Method for System Identificationwith Non-Smooth Objectives

Understanding SAM through Minimax Perspective

ON THE SHARP INPUT-OUTPUT ANALYSIS OFNONLINEAR SYSTEMS UNDER ADVERSARIAL ATTACKS

Tight Lower Bounds for the Bit and Inner Product Oracle for Constrained Convex Optimization

Automatic algorithm selection for Pseudo-Boolean optimization with givencomputational time limits

The Strong Maximum Circulation Algorithm: A NewMethod for Aggregating Preference Rankings

A Fast and Effective Heuristic Breakpoints Algorithm for the Quadratic Knapsack ProblemA Fast and Effective Heuristic Breakpoints Algorithm for the Quadratic Knapsack Problem

Confidence HNC: A network flow technique for binaryclassification with noisy labels

Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study