SU\G(𝔾)/K·U

Michael D. Grigoriadis

Follow

Generating author description...

All published works
Action Title Year Authors
+ Approximate Max-Min Resource Sharing for Structured Concave Optimization 2001 Michael D. Grigoriadis
Leonid Khachiyan
Lorant Porkolab
Jorge Villavicencio
+ Approximate Lagrangian Decomposition with a Modified Karmarkar Logarithmic Potential 1997 Jorge Villavicencio
Michael D. Grigoriadis
+ An Interior Point Method for Bordered Block-Diagonal Linear Programs 1996 Michael D. Grigoriadis
Leonid G. Khachiyan
+ Coordination Complexity of Parallel Price-Directive Decomposition 1996 Michael D. Grigoriadis
Leonid G. Khachiyan
+ Approximate Structured Optimization by Cyclic Block-Coordinate Descent 1996 Jorge Villavicencio
Michael D. Grigoriadis
+ An exponential‐function reduction method for block‐angular convex programs 1995 Michael D. Grigoriadis
Leonid G. Khachiyan
+ A Fast Algorithm for Trummer’s Problem 1987 Apostolos Gerasoulis
Michael D. Grigoriadis
Liping Sun
+ An efficient implementation of the network simplex method 1986 Michael D. Grigoriadis
+ Numerical methods for basic solutions of generalized flow networks 1984 Michael D. Grigoriadis
Tau Hsu
+ APOSS 1974 Michael D. Grigoriadis
+ A projective method for structured nonlinear programs 1971 Michael D. Grigoriadis
+ A Dual Generalized Upper Bounding Technique 1971 Michael D. Grigoriadis
+ PDF Chat A Parametric Method for Semidefinite Quadratic Programs 1969 Michael D. Grigoriadis
Klaus Ritter
+ PDF Chat A decomposition method for structured linear and nonlinear programs 1969 Michael D. Grigoriadis
Klaus Ritter
+ A Treatment of Transportation Problems by Primal Partition Programming 1968 Michael D. Grigoriadis
William F. Walker
Common Coauthors
Coauthor Papers Together
Leonid G. Khachiyan 3
Klaus Ritter 2
Jorge Villavicencio 2
Tau Hsu 1
Jorge Villavicencio 1
Liping Sun 1
William F. Walker 1
Leonid Khachiyan 1
Apostolos Gerasoulis 1
Lorant Porkolab 1
Commonly Cited References
Action Title Year Authors # of times referenced
+ Primal partition programming for block diagonal matrices 1964 J. B. Rosen
 5
+ An Interior Point Method for Block Angular Optimization 1991 Gary L. Schultz
Robert R. Meyer
 4
+ Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming 1955 George B. Dantzig
 3
+ Using central prices in the decomposition of linear programs 1993 Jean‐Louis Goffin
Alain Haurie
Jean-Philippe Vial
Dinghuan Zhu
 3
+ The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints 1960 J. B. Rosen
 3
+ Generalized upper bounding techniques 1967 George B. Dantzig
Richard M. Van Slyke
 3
+ Linear Programming and Extensions 1963 George B. Dantzig
 3
+ The Decomposition Algorithm for Linear Programs 1961 George B. Dantzig
Philip Wolfe
 2
+ Coordination Complexity of Parallel Price-Directive Decomposition 1996 Michael D. Grigoriadis
Leonid G. Khachiyan
 2
+ Elements of large-scale mathematical programming 1969 Arthur M. Geoffrion
 2
+ Linear Programming and Extensions 1963 George B. Dantzig
 2
+ Decomposition and Nondifferentiable Optimization with the Projective Algorithm 1992 Jean‐Louis Goffin
Alain Haurie
J.‐P. Vial
 2
+ PDF Chat A decomposition method for structured linear and nonlinear programs 1969 Michael D. Grigoriadis
Klaus Ritter
 2
+ A new algorithm for minimizing convex functions over convex sets 1989 Pravin M. Vaidya
 2
+ An exponential‐function reduction method for block‐angular convex programs 1995 Michael D. Grigoriadis
Leonid G. Khachiyan
 2
+ The Pseudoinverse of a Rectangular or Singular Matrix and Its Application to the Solution of Systems of Linear Equations 1959 T. N. E. Greville
 1
+ Solving embedded generalized network problems 1985 Richard D. McBride
 1
+ Decomposed block Cholesky factorization in the Karmarkar algorithm 1990 Mohammad Torabi
 1
+ Approximation procedures based on the method of multipliers 1977 Dimitri P. Bertsekas
 1
+ Interior-Point Polynomial Algorithms in Convex Programming 1994 Yurii Nesterov
Arkadi Nemirovski
 1
+ AN EXTENSION OF GENERALIZED UPPER BOUNDED TECHNIQUES FOR LINEAR PROGRAMMING 1965 R. N. Kaul
 1
+ <i>Analysis of Numerical Methods</i> 1967 Eugene Isaacson
Herbert B. Keller
George H. Weiss
 1
+ A smoothing-out technique for min—max optimization 1980 IsraĂ«l Zang
 1
+ Linear time algorithms for some separable quadratic programming problems 1993 Nimrod Megiddo
Arie Tamir
 1
+ Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms 1977 Gordon H. Bradley
Gerald G. Brown
Glenn W. Graves
 1
+ A stabilization of the simplex method 1971 Richard H. Bartels
 1
+ Numerical conformal mapping via the Szegö kernel 1986 Norberto Kerzman
Manfred R. Trummer
 1
+ A practicable steepest-edge simplex algorithm 1977 Donald Goldfarb
John Reid
 1
+ Nonlinear Programming: Sequential Unconstrained Minimization Techniques 1968 Anthony V. Fiacco
Garth P. McCormick
 1
+ Experimental Methods in Quadratic Programming 1966 J. H. Moore
Andrew B. Whinston
 1
+ Advanced Linear-Programming Computing Techniques 1968 W. Orchard-Hays
 1
+ Note—A Note on the Cyclic Coordinate Ascent Method 1970 Norman Zadeh
 1
+ Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints 1969 Donald Goldfarb
 1
+ None 1997 Levent Tunçel
Michael J. Todd
 1
+ RELAXATION AND THE DUAL METHOD IN MATHEMATICAL PROGRAMMING 1968 Arthur M. Geoffrion
 1
+ A Dual Generalized Upper Bounding Technique 1971 Michael D. Grigoriadis
 1
+ An extension of Karmarkar's projective algorithm for convex quadratic programming 1989 Yinyu Ye
Edison Tse
 1
+ Elements of Large-Scale Mathematical Programming Part I: Concepts 1970 Arthur M. Geoffrion
 1
+ Partitioning procedures for solving mixed-variables programming problems 1962 J. F. Benders
 1
+ An Empirical Evaluation of the KORBXÂź Algorithms for Military Airlift Applications 1990 William J. Carolan
James E. Hill
Jeffery L. Kennington
Sandra Niemi
Stephen J. Wichmann
 1
+ Solving the Transportation Problem 1956 L. R. Ford
D. R. Fulkerson
 1
+ Equivalence in nonlinear programming 1963 O. L. Mangasarian
 1
+ A Treatment of Transportation Problems by Primal Partition Programming 1968 Michael D. Grigoriadis
William F. Walker
 1
+ An Approach to Some Structured Linear Programming Problems 1966 John M. Bennett
 1
+ An Efficient Implementation of a Conformal Mapping Method Based on the Szegö Kernel 1986 Manfred R. Trummer
 1
+ Newton-Type Minimization via the Lanczos Method 1984 Stephen G. Nash
 1
+ Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs 1994 Deepankar Medhi
 1
+ Relaxation methods for minimum cost network flow problems 1983 Paul Tseng
Decision Systems.
Dimitri P. Bertsekas
 1
+ Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code 1976 D. Karney
Darwin Klingman
 1
+ Nonlinear Programming: A Unified Approach 1972 David W. Peterson
Willard I. Zangwill
 1