Liu Gang
Liu Gang (Chinese: 刘刚; born 30 January 1961) is a Chinese-born American aerospace engineer, computer scientist, optical physicist, political activist, and writer.In 1988, Liu became an assistant and associate researcher at the Wear-Resistant Materials Development Company of the National Ministry of Higher Education & the Dalian Institute of Technology.[18] Liu gained employment as a member of technical staff (MTS) at the Mathematics of Networks and Systems Research Department at Bell Laboratories in Murray Hill, New Jersey.There he worked on Optical telecommunication network design and planning, routing algorithms, optimization techniques, and economic models and strategy analysis.[19] Liu's areas of research included: SPIDER, a design tool for fast-restoration in all-optical networks; VPNStar, a system for provisioning multi-service VPNs with Quality of service guarantees over Internet Protocol; in software design, a management system for Lambda Router in all-optical networks; and analysis of Internet pricing.Liu and his colleagues are developing techniques for efficient and reliable optical network design, covering decentralized dedicated protection to shared path-based mesh restoration.
Liu Gang (boxer)Liu Gang (sport shooter)Chinese namefamily nameLiu (刘)LiaoyuanUniversity of Science and Technology of ChinaPeking UniversityColumbia UniversityNew York University1989 Tiananmen Square protestsBeijing Students' Autonomous FederationTraditional ChineseSimplified ChineseStandard MandarinHanyu PinyinTiananmen Square protests of 1989computer scienceBell LabsNew JerseyMorgan StanleyWall StreetFang LizhiWang DanChinese Communist PartyQincheng Prisonhuman rights in Chinapro-democracy protestsAviation Industry Corporation of ChinaShenyangaerodynamicsLuo Yangaircraft designair resistanceopticsBeijingDalian Institute of TechnologyChinese Academy of SciencesNew York Academy of SciencesMurray HillOptical telecommunicationroutingalgorithmsoptimizationeconomic modelsstrategyQuality of serviceInternet ProtocolInternetalgorithmtheoretical sciencegraphsoptimalwavelength division multiplexingoptical networkThe New York TimesNew York PostmethodsheuristicsUnconstrained nonlinearFunctionsGolden-section searchPowell's methodLine searchNelder–Mead methodSuccessive parabolic interpolationGradientsConvergenceTrust regionWolfe conditionsQuasi–NewtonBerndt–Hall–Hall–HausmanBroyden–Fletcher–Goldfarb–ShannoL-BFGSDavidon–Fletcher–PowellSymmetric rank-one (SR1)Other methodsConjugate gradientGauss–NewtonGradientMirrorLevenberg–MarquardtPowell's dog leg methodTruncated NewtonHessiansNewton's methodConstrained nonlinearBarrier methodsPenalty methodsAugmented Lagrangian methodsSequential quadratic programmingSuccessive linear programmingConvex optimizationConvex minimizationCutting-plane methodReduced gradient (Frank–Wolfe)Subgradient methodLinearquadraticAffine scalingEllipsoid algorithm of KhachiyanProjective algorithm of KarmarkarBasis-exchangeSimplex algorithm of DantzigRevised simplex algorithmCriss-cross algorithmPrincipal pivoting algorithm of LemkeActive-set methodCombinatorialApproximation algorithmDynamic programmingGreedy algorithmInteger programmingBranch and boundGraph algorithmsMinimum spanning treeBorůvkaKruskalShortest pathBellman–FordDijkstraFloyd–WarshallNetwork flowsEdmonds–KarpFord–Fulkerson