Benjamin Jansen

Generating author description...

All published works

Action	Title	Year	Authors
+	Basis- and partition identification for quadratic programming and linear complementarity problems	1999	Arjan Berkelaar Benjamin Jansen C. Roos Tamás Terlaky
+	Developments in global optimization: Nonconvex optimization and its applications, Vol. 18	1998	Benjamin Jansen
+	Potential reduction algorithms for structured combinatorial optimization problems	1997	Joost P. Warners Tamás Terlaky C. Roos Benjamin Jansen
+	Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems	1997	Benjamin Jansen C. Roos Tamás Terlaky Akiko Yoshise
+	Sensitivity analysis in linear programming: just be careful!	1997	Benjamin Jansen J.J. de Jong C. Roos Tamás Terlaky
+	A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems	1997	Benjamin Jansen C. Roos Tamás Terlaky
+	Interior Point Techniques in Optimization: Complementarity, Sensitivity and Algorithms	1997	Benjamin Jansen
+	The Theory of Linear Programming	1997	Benjamin Jansen
+	Primal-Dual Affine Scaling Methods for Linear Problems	1997	Benjamin Jansen
+	Target-Following for Nonlinear Programming	1997	Benjamin Jansen
+	Interior Point Methods in Decomposition	1997	Benjamin Jansen
+	Sensitivity Analysis in Quadratic Programming	1997	Benjamin Jansen
+	Improved complexity using higher-order correctors for primal-dual Dikin affine scaling	1997	Benjamin Jansen C. Roos Tamás Terlaky Y. Ye
+	Target-Following for Linear Programming	1997	Benjamin Jansen
+	Semidefinite Programming	1997	Benjamin Jansen
+	Interior Point Techniques in Optimization	1997	Benjamin Jansen
+	Primal-dual target-following algorithms for linear programming	1996	Benjamin Jansen C. Roos Tamás Terlaky Jean-Philippe Vial
+	Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid	1996	Olaf E. Flippo Benjamin Jansen
+	A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming	1996	Benjamin Jansen C. Roos Tamás Terlaky
+	Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem	1996	Benjamin Jansen C. Roos Tamás Terlaky
+	Long-step primal-dual target-following algorithms for linear programming	1996	Benjamin Jansen C. Roos Tamás Terlaky Jean-Philippe Vial
+	Basis- and tripartition identification for quadratic programming and lineair complementary problems; From an interior solution to an optimal basis and viceversa	1996	Arjan Berkelaar Benjamin Jansen C. Roos Tamás Terlaky
+	Basis- and tripartition identification for quadratic programming and lineair complementary problems; From an interior solution to an optimal basis and viceversa	1996	Arjan Berkelaar Benjamin Jansen C. Roos Tamás Terlaky
+	Interior point techniques in optimization : complementarity, sensitivity and algorithms = Inwendige punt technieken in optimalisatie : complementariteit, gevoeligheid en algoritmen	1996	Benjamin Jansen
+	Introduction to the Theory of Interior Point Methods	1996	Benjamin Jansen C. Roos Tamás Terlaky
+	Target-Following Methods for Linear Programming	1996	Benjamin Jansen C. Roos Tamás Terlaky
+	Primal-dual affine-scaling algorithms for nonlinear monotone complementarity problems	1994	Benjamin Jansen C. Roos Tamás Terlaky Akiko Yoshise
+	Primal-dual algorithms for linear programming based on the logarithmic barrier method	1994	Benjamin Jansen C. Roos Tamás Terlaky J.‐P. Vial
+	The theory of linear programming:skew symmetric self-dual problems and the central path<sup>*</sup>	1994	Benjamin Jansen C. Roos Tamás Terlaky
+	Interior-Point Methodology for Linear Programming: Duality, Sensitivity Analysis and Computational Aspects	1993	Benjamin Jansen C. Roos Tamás Terlaky Jean-Philippe Vial

Common Coauthors

Coauthor	Papers Together
C. Roos	18
Tamás Terlaky	18
Arjan Berkelaar	3
Jean-Philippe Vial	3
Akiko Yoshise	2
J.‐P. Vial	1
Olaf E. Flippo	1
Y. Ye	1
Joost P. Warners	1
J.J. de Jong	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Interior path following primal-dual algorithms. part I: Linear programming	1989	Renato D. C. Monteiro Ilan Adler	9
+ PDF Chat	An analogue of Moreau’s proximation theorem, with application to the nonlinear complementarity problem	1980	L. McLinden	8
+	Pathways to the Optimal Set in Linear Programming	1989	Nimrod Megiddo	8
+	Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity	1994	Dick den Hertog	7
+	A Primal-Dual Interior Point Algorithm for Linear Programming	1989	Masakazu Kojima Shinji Mizuno Akiko Yoshise	7
+	Path-Following Methods for Linear Programming	1992	Clóvis C. Gonzaga	7
+	A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems	1997	Benjamin Jansen C. Roos Tamás Terlaky	6
+	A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming	1996	Benjamin Jansen C. Roos Tamás Terlaky	6
+	A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension	1990	Renato D. C. Monteiro Ilan Adler Maurício G. C. Resende	6
+	An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm	1994	Yinyu Ye Michael J. Todd Shinji Mizuno	6
+	A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems	1991	Masakazu Kojima Nimrod Megiddo Toshihito Noma Akiko Yoshise	6
+	A polynomial-time algorithm, based on Newton's method, for linear programming	1988	James Renegar	5
+	Interior Point Approach to Linear, Quadratic and Convex Programming	1994	Dick den Hertog	5
+	A polynomial method of approximate centers for linear programming	1992	C. Roos Jean-Philippe Vial	5
+	An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming	2006	Gy. Sonnevend	5
+	Computational experience with a primal-dual interior point method for linear programming	1991	Irvin J. Lustig Roy E. Marsten David F. Shanno	4
+	On the Implementation of a Primal-Dual Interior Point Method	1992	Sanjay Mehrotra	4
+ PDF Chat	The nonlinear geometry of linear programming. I. Affine and projective scaling trajectories	1989	David Bayer Jeffrey C. Lagarias	4
+	A geometric view of parametric linear programming	1992	Ilan Adler Renato D. C. Monteiro	4
+	Primal-dual algorithms for linear programming based on the logarithmic barrier method	1994	Benjamin Jansen C. Roos Tamás Terlaky J.‐P. Vial	4
+	The use of the optimal partition in a linear programming solution for postoptimal analysis	1994	Harvey J. Greenberg	4
+	An Algorithm Based on Weighted Logarithmic Barrier Functions for Linear Complementarity Problems	1990	Jiu Ding T.Y. Li	4
+	Convergence behavior of interior-point algorithms	1993	Osman Güler Yinyu Ye	4
+ PDF Chat	On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming	1993	Shinji Mizuno Michael J. Todd Yinyu Ye	4
+	Nonlinear Programming: Sequential Unconstrained Minimization Techniques	1968	Anthony V. Fiacco Garth P. McCormick	4
+	Interior path following primal-dual algorithms. part II: Convex quadratic programming	1989	Renato D. C. Monteiro Ilan Adler	4
+	Progress in Mathematical Programming: Interior-Point and Related Methods	2011	Nimrod Megiddo	4
+	An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations	1989	Clóvis C. Gonzaga	3
+	Interior-Point Polynomial Algorithms in Convex Programming	1994	Yurii Nesterov Arkadi Nemirovski	3
+	On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method	1986	Philip E. Gill Walter Murray Michael A. Saunders John A. Tomlin Margaret H. Wright	3
+	Transactions of the American Mathematical Society	2012		3
+	A polynomial-time algorithm for a class of linear complementarity problems	1989	Masakazu Kojima Shinji Mizuno Akiko Yoshise	3
+ PDF Chat	AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM	1990	Shinji Mizuno	3
+ PDF Chat	Self-Scaled Barriers and Interior-Point Methods for Convex Programming	1997	Yu. E. Nesterov Michael J. Todd	3
+	Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method	1991	Clóvis C. Gonzaga	3
+	A new polynomial time method for a linear complementarity problem	1992	Shinji Mizuno	3
+	An Implementation of a Primal-Dual Interior Point Method for Linear Programming	1989	Kevin A. McShane Clyde Monma David F. Shanno	3
+	Duality Theory of Linear Programs: A Constructive Approach with Applications	1969	Michel Balinski A. W. Tucker	2
+	On the classical logarithmic barrier function method for a class of smooth convex programming problems	1992	Dick den Hertog C. Roos Tamás Terlaky	2
+	An interior point algorithm to solve computationally difficult set covering problems	1991	Narendra Karmarkar Maurício G. C. Resende K. G. Ramakrishnan	2
+	A path following algorithm for a class of convex programming problems	1992	Jianxiong Zhu	2
+ PDF Chat	On the Quadratic Convergence of the Simplified Mizuno--Todd--Ye Algorithm for Linear Programming	1997	Clóvis C. Gonzaga R. A. Tapia	2
+	P∗-matrices are just sufficient	1996	Hannu Väliaho	2
+	A modification of karmarkar's linear programming algorithm	1986	Robert J. Vanderbei Marc S. Meketon Barry Freedman	2
+	Primal-dual target-following algorithms for linear programming	1996	Benjamin Jansen C. Roos Tamás Terlaky Jean-Philippe Vial	2
+	A scaling technique for finding the weighted analytic center of a polytope	1992	David S. Atkinson Pravin M. Vaidya	2
+ PDF Chat	Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem	1993	Robert M. Freund	2
+	Direct Methods for Sparse Matrices	2017	Iain Duff A. M. Erisman J. K. Reid	2
+	The theory of linear programming:skew symmetric self-dual problems and the central path<sup>*</sup>	1994	Benjamin Jansen C. Roos Tamás Terlaky	2
+	Advances in Linear and Integer Programming	1996	J. E. Beasley	2