Robert Sarkissian

Generating author description...

All published works

Action	Title	Year	Authors
+	None	2001	Jacek Gondzio Robert Sarkissian Jean-Philippe Vial
+	None	2001	Emmanuel Fragnière Jacek Gondzio Robert Sarkissian
+	Parallel Implementation of a Central Decomposition Method for Solving Large Scale Planning Problems	1998	J. Gondzion Robert Sarkissian J.‐P. Vial
+	Using an interior point method for the master problem in a decomposition approach	1997	Jacek Gondzio Robert Sarkissian J.‐P. Vial
+ 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
+	ACCPM — A library for convex optimization based on an analytic center cutting plane method	1996	Jacek Gondzio O. du Merle Robert Sarkissian J.‐P. Vial
+	THE EVALUATION OF AUTHENTICITY OF FAINT ASTROPHYSICAL OBJECTS TREATED BY COMPUTER	1975	Robert Sarkissian V.S. Khitrova

Common Coauthors

Coauthor	Papers Together
Jacek Gondzio	5
J.‐P. Vial	4
J. Gondzion	1
Emmanuel Fragnière	1
Jean‐Louis Goffin	1
Jean-Philippe Vial	1
V.S. Khitrova	1
O. du Merle	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Decomposition and Nondifferentiable Optimization with the Projective Algorithm	1992	Jean‐Louis Goffin Alain Haurie J.‐P. Vial	4
+	The Cutting-Plane Method for Solving Convex Programs	1960	James E. Kelley	4
+	The Decomposition Algorithm for Linear Programs	1961	George B. Dantzig Philip Wolfe	4
+	A polynomial newton method for linear programming	1986	Guy de Ghellinck J.‐P. Vial	4
+	New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation	1988	Gy. Sonnevend	3
+	Multicommodity network flows: The impact of formulation on decomposition	1993	Kim L. Jones Irvin J. Lustig Judith M. Farvolden Warren B. Powell	3
+ 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	3
+	A cutting plane method from analytic centers for stochastic programming	1995	Olivier Bahn O. du Merle Jean‐Louis Goffin J.‐P. Vial	3
+	Using central prices in the decomposition of linear programs	1993	Jean‐Louis Goffin Alain Haurie Jean-Philippe Vial Dinghuan Zhu	3
+	A Potential Reduction Algorithm Allowing Column Generation	1992	Yinyu Ye	2
+	Implementing cholesky factorization for interior point methods of linear programming	1993	Jacek Gondzio	2
+	Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming	1994	Olivier Bahn Jean‐Louis Goffin J.‐P. Vial O. du Merle	2
+	Mathematical Programming: Theory and Algorithms.	1987	David K. Smith Michel Minoux S. Vajda	2
+ PDF Chat	New variants of bundle methods	1995	Claude Lemaréchal Arkadi Nemirovski Yurii Nesterov	2
+	Path-Following Methods for Linear Programming	1992	Clóvis C. Gonzaga	2
+	Advances in Linear and Integer Programming	1996	J. E. Beasley	2
+	HOPDM (version 2.12) — A fast LP solver based on a primal-dual interior point method	1995	Jacek Gondzio	2
+	ACCPM — A library for convex optimization based on an analytic center cutting plane method	1996	Jacek Gondzio O. du Merle Robert Sarkissian J.‐P. Vial	2
+	Partitioning procedures for solving mixed-variables programming problems	1962	J. F. Benders	2
+	Direct Methods for Sparse Matrices	2017	Iain Duff A. M. Erisman J. K. Reid	2
+	None	1999	J. Gondizo J.‐P. Vial	2
+	Proximity control in bundle methods for convex nondifferentiable minimization	1990	Krzysztof C. Kiwiel	1
+ PDF Chat	Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art	1994	Irvin J. Lustig Roy E. Marsten David F. Shanno	1
+	A regularized decomposition method for minimizing a sum of polyhedral functions	1986	Andrzej Ruszczyński	1
+	Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming	1988	John R. Birge Liqun Qi	1
+	Linear Programming and Extensions	1963	George B. Dantzig	1
+ PDF Chat	Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs	1985	John R. Birge	1
+	Exploiting Special Structure in Primal Dual Interior Point Methods	1992	James K. Hurd Frederic H. Murphy	1
+ PDF Chat	Sparse Matrix Methods in Optimization	1984	Philip E. Gill Walter Murray Michael A. Saunders Margaret H. Wright	1
+	A computational view of interior point methods	1996	Jacek Gondzio Tamás Terlaky	1
+	Warm Start and E-Subgradients in Cutting Plane Scheme for Block-Angular Linear Programs	1997	Jacek Gondzio J.‐P. Vial	1
+	Parallel Implementation of a Central Decomposition Method for Solving Large Scale Planning Problems	1998	J. Gondzion Robert Sarkissian J.‐P. Vial	1
+ PDF Chat	Methods of Descent for Nondifferentiable Optimization	1985	Krzysztof C. Kiwiel	1
+	Mathematical Programming	1995	Brian Conolly S. Vajda	1
+	Chapter VII Nondifferentiable optimization	1989	Claude Lemaréchal	1
+	Optimal Ergodic Control of Singularly Perturbed Hybrid Stochastic Systems	1997	Jerzy A. Filar Alain Haurie	1
+	On the Complexity of a Column Generation Algorithm for Convex or Quasiconvex Feasibility Problems	1994	Jean‐Louis Goffin Zhi‐Quan Luo Yinyu Ye	1
+	None	2000	Emmanuel Fragnière Jacek Gondzio Jean-Philippe Vial	1
+	Primal-Dual Interior-Point Methods	1997	Stephen J. Wright	1
+	None	2001	Jacek Gondzio Robert Sarkissian Jean-Philippe Vial	1
+	Interior Point Methods for Nondifferentiable Optimization	1998	Jean‐Louis Goffin Jean-Philippe Vial	1
+	Restricted simplicial decomposition: Computation and extensions	1987	Donald W. Hearn Siriphong Lawphongpanich José A. Ventura	1
+	A polynomial-time algorithm, based on Newton's method, for linear programming	1988	James Renegar	1
+	An interior-point method for generalized linear-fractional programming	1995	Yu. E. Nesterov Arkadi Nemirovski	1
+	Cutting planes and column generation techniques with the projective algorithm	1990	Jean‐Louis Goffin J.‐P. Vial	1
+	Newton's method for convex programming and Tchebycheff approximation	1959	E. W. Cheney A. A. Goldstein	1
+	Primal-dual target-following algorithms for linear programming	1996	Benjamin Jansen C. Roos Tamás Terlaky Jean-Philippe Vial	1
+	Using an interior point method for the master problem in a decomposition approach	1997	Jacek Gondzio Robert Sarkissian J.‐P. Vial	1
+	On the formulation of stochastic linear programs using algebraic modelling languages	1996	Horand I. Gassmann Alice Ireland	1
+ PDF Chat	Exploiting special structure in Karmarkar's linear programming algorithm	1988	Michael J. Todd	1