View in EDS PDF Full Text

Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal.

Saved in:
Bibliographic Details
Title: Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal.
Authors: Blanchard, Moïse1, moiseb@mit.edu, Zhang, Junhui1, junhuiz@mit.edu, Jaillet, Patrick1, jaillet@mit.edu
Source: Mathematics of Operations Research (INFORMS); Nov2025, Vol. 50 Issue 4, p2941-2971, 31p
Database: Applied Science & Technology Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: aci
DbLabel: Applied Science & Technology Source
An: 189423738
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AU" term="%22Blanchard%2C+Moïse%22">Blanchard, Moïse</searchLink><relatesTo>1</relatesTo>, <i>moiseb@mit.edu</i><br /><searchLink fieldCode="AU" term="%22Zhang%2C+Junhui%22">Zhang, Junhui</searchLink><relatesTo>1</relatesTo>, <i>junhuiz@mit.edu</i><br /><searchLink fieldCode="AU" term="%22Jaillet%2C+Patrick%22">Jaillet, Patrick</searchLink><relatesTo>1</relatesTo>, <i>jaillet@mit.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Mathematics+of+Operations+Research+%28INFORMS%29%22">Mathematics of Operations Research (INFORMS)</searchLink>; Nov2025, Vol. 50 Issue 4, p2941-2971, 31p
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=189423738
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1287/moor.2023.0208
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 31
        StartPage: 2941
    Titles:
      – TitleFull: Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Blanchard, Moïse
      – PersonEntity:
          Name:
            NameFull: Zhang, Junhui
      – PersonEntity:
          Name:
            NameFull: Jaillet, Patrick
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 11
              Text: Nov2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 0364765X
          Numbering:
            – Type: volume
              Value: 50
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Mathematics of Operations Research (INFORMS)
              Type: main
ResultId 1