Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Potential Function Methods for Approximately Solving Linear Programming Problems	2002
+	Barrier function algorithms for linear and convex quadratic programming	1988	Mohamed Ben‐Daya
+ PDF Chat	Potential-reduction methods in mathematical programming	1997	Michael J. Todd
+	A multiplicative barrier function method for linear programming	1986	Masao Iri Hiroshi Imai
+	Linear programming methods and applications	1990	H. Arsham
+	Computational Methods for Linear-Quadratic Optimization	1999	Peter Benner
+	Computational Methods For Linear Programming	1994	David F. Shanno
+	Linear programming methods and application	1961	Bob R. Holdren Saul I. Gass
+	Potential Reduction Methods for Linear Programming	2012	Yinyu Ye
+	Potential Reduction Methods for Linear Programming	2001	Yinyu Ye
+	Potential Reduction Methods for Linear Programming	2008	Yinyu Ye
+	Line Search Techniques for the Logarithmic Barrier Function in Quadratic Programming	1995	M. Ben-Daya
+	Nonlinear programming: theory and algorithms	1993
+	Nonlinear programming: Theory and algorithms	1980	Rainer E. Burkard
+	Nonlinear programming: Theory and algorithms	1994	Frank Plastria
+	Quadratic approximation of penalty functions for solving large-scale linear programs	2007	Л. Д. Попов
+	Linear Programming: Methods and Applications.	1964	D. J. Bartholomew Saul I. Gass
+	Linear Programming: Methods and Applications.	1977	Larry Nazareth Saul I. Gass
+	Linear Programming: Methods and Applications.	1960	L. E. Ward Saul I. Gass
+	Linear Programming: Methods and Applications.	1959	Sándor Vajda Saul I. Gass

Works That Cite This (68)

Action	Title	Year	Authors
+ PDF Chat	Solving MIPs via scaling-based augmentation	2017	Pierre Le Bodic Jeffrey W. Pavelka Marc E. Pfetsch Sebastian Pokutta
+ PDF Chat	Interior-point solver for convex separable block-angular problems	2015	Jordi Castro
+	Lifting group inequalities and an application to mixing inequalities	2009	Santanu S. Dey Laurence A. Wolsey
+	A Fast Parallel Implementation of a PTAS for Fractional Packing and Covering Linear Programs	2015	Slobodan Jelić Sören Laue Domagoj Matijević Patrick Wijerama
+	Random Gradient-Free Minimization of Convex Functions	2015	Yurii Nesterov Vladimir Spokoiny
+ PDF Chat	Marginal likelihood for Markov-switching and change-point GARCH models	2013	Luc Bauwens Arnaud Dufays Jeroen V.K. Rombouts
+	Solving Infinite-dimensional Optimization Problems by Polynomial Approximation	2010	Olivier Devolder François Glineur Yurii Nesterov
+ PDF Chat	Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries	2004	Naveen Garg Rohit Khandekar
+ PDF Chat	Approximation Algorithms for Mixed Fractional Packing and Covering Problems	2006	Klaus Jansen
+	First-order methods of smooth convex optimization with inexact oracle	2013	Olivier Devolder François Glineur Yurii Nesterov

Works Cited by This (14)

Action	Title	Year	Authors
+	Asymptotic analysis of the exponential penalty trajectory in linear programming	1994	Roberto Cominetti Jaime San Martı́n
+	The Decomposition Algorithm for Linear Programs	1961	George B. Dantzig Philip Wolfe
+	An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations	1990	Pravin M. Vaidya
+ PDF Chat	New variants of bundle methods	1995	Claude Lemaréchal Arkadi Nemirovski Yurii Nesterov
+ PDF Chat	Solving nonlinear multicommodity flow problems by the analytic center cutting plane method	1997	Jean‐Louis Goffin Jacek Gondzio Robert Sarkissian J.‐P. Vial
+	The volume algorithm: producing primal solutions with a subgradient method	2000	Francisco Barahona Ranga Anbil
+	A parallel approximation algorithm for positive linear programming	1993	Michael Luby Noam Nisan
+	Coordination Complexity of Parallel Price-Directive Decomposition	1996	Michael D. Grigoriadis Leonid G. Khachiyan
+	Stable exponential-penalty algorithm with superlinear convergence	1994	Roberto Cominetti Jean‐Pierre Dussault
+	An exponential‐function reduction method for block‐angular convex programs	1995	Michael D. Grigoriadis Leonid G. Khachiyan