Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
February 1, 1994SIAM Journal on Optimization

Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints

View Full Paper
Ask AI
Bookmark
Share

Authors

MGMichael D. GrigoriadisRutgers, The State University of New JerseyLKLeonid G. KhachiyanRutgers, The State University of New Jersey

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Grigoriadis et al. (1994) studied this question.

synapsesocial.com/papers/6a7dfb8e6ef7ec97ba7d9489https://doi.org/10.1137/0804004
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1An Interior Point Method for Block Angular Optimization1991 · 64 citations
  2. 2The flow deviation method: An approach to store‐and‐forward communication network design1973 · 561 citations
  3. 3Optimization Theory of Large Systems1971 · 1,686 citations
  4. 4The Decomposition Algorithm for Linear Programs1961 · 751 citations
  5. 5The maximum concurrent flow problem1990 · 440 citations