IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v73y2025i3p1345-1365.html
   My bibliography  Save this article

Data-Driven Minimax Optimization with Expectation Constraints

Author

Listed:
  • Shuoguang Yang

    (Department of Industrial Engineering & Decision Analytics, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong SAR, China)

  • Xudong Li

    (School of Data Science, Fudan University, Shanghai 200433, China)

  • Guanghui Lan

    (H. Milton Stewart School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

Abstract

Attention to data-driven optimization approaches, including the well-known stochastic gradient descent method, has grown significantly over recent decades, but data-driven constraints have rarely been studied because of the computational challenges of projections onto the feasible set defined by these hard constraints. In this paper, we focus on the nonsmooth convex-concave stochastic minimax regime and formulate the data-driven constraints as expectation constraints. The minimax expectation constrained problem subsumes a broad class of real-world applications, including data-driven robust optimization, optimization with misspecification, and area under the receiver operating characteristic curve (AUC) maximization with fairness constraints. We propose a class of efficient primal-dual algorithms to tackle the minimax expectation constrained problem and show that our algorithms converge at the optimal rate of O ( 1 / N ) , where N is the number of iterations. We demonstrate the practical efficiency of our algorithms by conducting numerical experiments on large-scale real-world applications.

Suggested Citation

  • Shuoguang Yang & Xudong Li & Guanghui Lan, 2025. "Data-Driven Minimax Optimization with Expectation Constraints," Operations Research, INFORMS, vol. 73(3), pages 1345-1365, May.
  • Handle: RePEc:inm:oropre:v:73:y:2025:i:3:p:1345-1365
    DOI: 10.1287/opre.2022.0110
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.0110
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2022.0110?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:73:y:2025:i:3:p:1345-1365. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.