About

Dr. Albert S. Berahas is an Assistant Professor in the Department of Industrial and Operations Engineering at the University of Michigan. His research broadly focuses on designing, developing, analyzing, and implementing algorithms to solve large-scale nonlinear optimization problems. His work spans a range of topics within nonlinear optimization, with particular interest in general nonlinear optimization algorithms, optimization algorithms for machine learning, constrained optimization, stochastic optimization, derivative-free optimization, and distributed optimization. Through this diverse portfolio, Dr. Berahas aims to advance both the theoretical foundations and practical performance of optimization methods across a wide range of applications. He has a strong academic background, having earned his PhD in Engineering Sciences and Applied Mathematics from Northwestern University in 2018, after completing his MSc at Northwestern in 2012 and his BSc at Cornell University in 2009. Prior to his current position, he was a Postdoctoral Research Fellow at Lehigh University and Northwestern University.

Research topics

• Computer Science
• Economics
• Mathematical optimization
• Algorithm
• Mathematics

Selected publications

• Negative Curvature Methods with High-Probability Complexity Guarantees for Stochastic Nonconvex Optimization

  Open MIND · 2026-03-04

  preprint1st authorCorresponding

  This paper develops negative curvature methods for continuous nonlinear unconstrained optimization in stochastic settings, in which function, gradient, and Hessian information is available only through probabilistic oracles, i.e., oracles that return approximations of a certain accuracy and reliability. We introduce conditions on these oracles and design a two-step framework that systematically combines gradient and negative curvature steps. The framework employs an early-stopping mechanism to guarantee sufficient progress and uses an adaptive mechanism based on an Armijo-type criterion to select the step sizes for both steps. We establish high-probability iteration-complexity guarantees for attaining second-order stationary points, deriving explicit tail bounds that quantify the convergence neighborhood and its dependence on oracle noise. Importantly, these bounds match deterministic rates up to noise-dependent terms, and the framework recovers the deterministic results as a special case. Finally, numerical experiments demonstrate the practical benefits of exploiting negative curvature directions even in the presence of noise.

  DOI

• Negative Curvature Methods with High-Probability Complexity Guarantees for Stochastic Nonconvex Optimization

  ArXiv.org · 2026-03-04

  articleOpen access1st authorCorresponding

  This paper develops negative curvature methods for continuous nonlinear unconstrained optimization in stochastic settings, in which function, gradient, and Hessian information is available only through probabilistic oracles, i.e., oracles that return approximations of a certain accuracy and reliability. We introduce conditions on these oracles and design a two-step framework that systematically combines gradient and negative curvature steps. The framework employs an early-stopping mechanism to guarantee sufficient progress and uses an adaptive mechanism based on an Armijo-type criterion to select the step sizes for both steps. We establish high-probability iteration-complexity guarantees for attaining second-order stationary points, deriving explicit tail bounds that quantify the convergence neighborhood and its dependence on oracle noise. Importantly, these bounds match deterministic rates up to noise-dependent terms, and the framework recovers the deterministic results as a special case. Finally, numerical experiments demonstrate the practical benefits of exploiting negative curvature directions even in the presence of noise.

  PublisherOA PDF

• A Gradient Sampling Algorithm for Noisy Nonsmooth Optimization

  arXiv (Cornell University) · 2026-03-31

  preprintOpen access1st authorCorresponding

  An algorithm is proposed, analyzed, and tested for minimizing locally Lipschitz objective functions that may be nonconvex and/or nonsmooth. The algorithm, which is built upon the gradient-sampling methodology, is designed specifically for cases when objective function and generalized gradient values might be subject to bounded uncontrollable errors. Similarly to state-of-the-art guarantees for noisy smooth optimization of this kind, it is proved for the algorithm that, with probability one, either the sequence of objective function values will decrease without bound or the algorithm will generate an iterate at which a measure of stationarity is below a threshold that depends proportionally on the error bounds for the objective function and generalized gradient values. The results of numerical experiments are presented, which show that the algorithm can indeed perform approximate optimization robustly despite errors in objective and generalized gradient values.

  PublisherDOI

• Exploiting negative curvature in conjunction with adaptive sampling: theoretical results and a practical algorithm

  Computational Optimization and Applications · 2026-02-12

  articleOpen access1st authorCorresponding

  Abstract In this paper, we propose algorithms that exploit negative curvature for solving noisy nonlinear nonconvex unconstrained optimization problems. We consider both deterministic inexact and stochastic settings, and develop two-step algorithms that combine directions of negative curvature and descent directions to update the iterates. Under reasonable assumptions, we prove second-order convergence results and derive complexity guarantees for both settings. To tackle large-scale problems, we develop a practical variant that utilizes the conjugate gradient method with negative curvature detection and early stopping to compute a step, a simple adaptive step size scheme, and a strategy for selecting the sample sizes of the gradient and Hessian approximations as the optimization progresses. Numerical results on two machine learning problems showcase the efficacy and efficiency of the practical method.

  PublisherOA PDFDOI

• A Gradient Sampling Algorithm for Noisy Nonsmooth Optimization

  ArXiv.org · 2026-03-31

  articleOpen access1st authorCorresponding

  An algorithm is proposed, analyzed, and tested for minimizing locally Lipschitz objective functions that may be nonconvex and/or nonsmooth. The algorithm, which is built upon the gradient-sampling methodology, is designed specifically for cases when objective function and generalized gradient values might be subject to bounded uncontrollable errors. Similarly to state-of-the-art guarantees for noisy smooth optimization of this kind, it is proved for the algorithm that, with probability one, either the sequence of objective function values will decrease without bound or the algorithm will generate an iterate at which a measure of stationarity is below a threshold that depends proportionally on the error bounds for the objective function and generalized gradient values. The results of numerical experiments are presented, which show that the algorithm can indeed perform approximate optimization robustly despite errors in objective and generalized gradient values.

  PublisherOA PDF

• A line search framework with restarting for noisy optimization problems

  ArXiv.org · 2025-06-03

  preprintOpen access1st authorCorresponding

  Nonlinear optimization methods are typically iterative and make use of gradient information to determine a direction of improvement and function information to effectively check for progress. When this information is corrupted by noise, designing a convergent and practical algorithmic process becomes challenging, as care must be taken to avoid taking bad steps due to erroneous information. For this reason, simple gradient-based schemes have been quite popular, despite being outperformed by more advanced techniques in the noiseless setting. In this paper, we propose a general algorithmic framework based on line search that is endowed with iteration and evaluation complexity guarantees even in a noisy setting. These guarantees are obtained as a result of a restarting condition, that monitors desirable properties for the steps taken at each iteration and can be checked even in the presence of noise. Experiments using a nonlinear conjugate gradient variant and a quasi-Newton variant illustrate that restarting can be performed without compromising practical efficiency and robustness.

  PublisherOA PDFDOI

• Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints

  ArXiv.org · 2025-05-26

  preprintOpen access1st authorCorresponding

  In this paper, we propose a framework based on the Retrospective Approximation (RA) paradigm to solve optimization problems with a stochastic objective function and general nonlinear deterministic constraints. This framework sequentially constructs increasingly accurate approximations of the true problems which are solved to a specified accuracy via a deterministic solver, thereby decoupling the uncertainty from the optimization. Such frameworks retain the advantages of deterministic optimization methods, such as fast convergence, while achieving the optimal performance of stochastic methods without the need to redesign algorithmic components. For problems with general nonlinear equality constraints, we present a framework that can employ any deterministic solver and analyze its theoretical work complexity. We then present an instance of the framework that employs a deterministic Sequential Quadratic Programming (SQP) method and that achieves optimal complexity in terms of gradient evaluations and linear system solves for this class of problems. For problems with general nonlinear constraints, we present an RA-based algorithm that employs an SQP method with robust subproblems. Finally, we demonstrate the empirical performance of the proposed framework on multi-class logistic regression problems and benchmark instances from the CUTEst test set, comparing its results to established methods from the literature.

  PublisherOA PDFDOI

• Collaborative and Distributed Bayesian Optimization via Consensus

  IEEE Transactions on Automation Science and Engineering · 2025-01-01 · 5 citations

  article

  Optimal design is a critical yet challenging task within many applications. This challenge arises from the need for extensive trial and error, often done through simulations or running field experiments. Fortunately, sequential optimal design, also referred to as Bayesian optimization when using surrogates with a Bayesian flavor, has played a key role in accelerating the design process through efficient sequential sampling strategies. However, a key opportunity exists nowadays. The increased connectivity of edge devices sets forth a new collaborative paradigm for Bayesian optimization. A paradigm whereby different clients collaboratively borrow strength from each other by effectively distributing their experimentation efforts to improve and fast-track their optimal design process. To this end, we bring the notion of consensus to Bayesian optimization, where clients agree (i.e., reach a consensus) on their next-to-sample designs. Our approach provides a generic and flexible framework that can incorporate different collaboration mechanisms. In lieu of this, we propose transitional collaborative mechanisms where clients initially rely more on each other to maneuver through the early stages with scant data, then, at the late stages, focus on their own objectives to get client-specific solutions. Theoretically, we show the sub-linear growth in regret for our proposed framework. Empirically, through simulated datasets and a real-world collaborative sensor design experiment, we show that our framework can effectively accelerate and improve the optimal design process and benefit all participants. Note to Practitioners—The proposed algorithm allows multiple clients to collaboratively distribute their trial-and-error efforts to fast-track and improve the optimal design process. In the algorithm, each client performs a test locally and then shares the results with an orchestrator. Using the information from all clients, the orchestrator then finds the best new experiment that each client should undertake and sends those back for the next round of experiments. Through this process, all clients can leverage each other’s strengths and optimize their designs with far fewer experiments than each client operating in isolation. This is confirmed through many simulation examples, along with a real-life sensor design experiment where multiple collaborating agents seqeuntially coordinate their experimentation efforts. The goal is to rapidly discover the biosensor design and measurement format parameters that find the maximum amount of captured target analyte.

  PublisherDOI

• A line search framework with restarting for noisy optimization problems

  Computational Optimization and Applications · 2025-12-21

  article1st authorCorresponding
  PublisherDOI

• A Sequential Quadratic Programming Method With High-Probability Complexity Bounds for Nonlinear Equality-Constrained Stochastic Optimization

  SIAM Journal on Optimization · 2025-01-13 · 4 citations

  article1st authorCorresponding
  PublisherDOI

Frequent coauthors

• Martin Takáč

  18 shared

• Raghu Bollapragada

  15 shared

• Majid Jahani

  Lehigh University

  10 shared

• Liyuan Cao

  Peking University

  10 shared

• Katya Scheinberg

  Cornell University

  9 shared

• Jorge Nocedal

  9 shared

• Frank E. Curtis

  Lehigh University

  6 shared

• Ermin Wei

  Northwestern University

  6 shared

Education

• PhD, Engineering Sciences and Applied Mathematics

  Northwestern University

  2018

• MSc, Engineering Sciences and Applied Mathematics

  Northwestern University

  2012

• BSc, Operations Research and Industrial Engineering

  Cornell University

  2009

Awards & honors

• 2025 Alpha Pi Mu IOE Outstanding Instructor Award, Departmen…
• 2022 Charles Broyden Prize, Best Paper 2022 Optimization Met…
• 2025 IOE Department Faculty Award, College of Engineering, U…
• 2024 MLK Spirit Award for Community Building & Impact, Colle…
• 2024 INFORMS Moving Spirit Award for Forums, Institute for O…