DBLP: David F. Shanno

	2008
j18		Igor Griva, David F. Shanno, Robert J. Vanderbei, Hande Y. Benson: Global convergence of a primal-dual interior-point method for nonlinear programming. Algorithmic Operations Research 3(1) (2008)
j17		Hande Y. Benson, David F. Shanno: Interior-point methods for nonconvex nonlinear programming: regularization and warmstarts. Comp. Opt. and Appl. 40(2): 143-189 (2008)
	2007
j16		Hande Y. Benson, David F. Shanno: An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming. Comp. Opt. and Appl. 38(3): 371-399 (2007)
	2006
j15		Hande Y. Benson, Arun Sen, David F. Shanno, Robert J. Vanderbei: Interior-Point Algorithms, Penalty Methods and Equilibrium Problems. Comp. Opt. and Appl. 34(2): 155-182 (2006)
	2004
j14		Hande Y. Benson, David F. Shanno, Robert J. Vanderbei: Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing. Math. Program. 99(1): 35-48 (2004)
	2002
j13		Hande Y. Benson, Robert J. Vanderbei, David F. Shanno: Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions. Comp. Opt. and Appl. 23(2): 257-272 (2002)
	1994
j12		Irvin J. Lustig, Roy E. Marsten, David F. Shanno: Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art. INFORMS Journal on Computing 6(1): 1-14 (1994)
j11		Irvin J. Lustig, Roy E. Marsten, David F. Shanno: Rejoinder - The Last Word on Interior Point Methods for Linear Programming - For Now. INFORMS Journal on Computing 6(1): 35-36 (1994)
j10		Irvin Lustig, Roy E. Marsten, David F. Shanno: Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming. Math. Program. 66: 123-135 (1994)
	1993
j9		Tamra J. Carpenter, Irvin J. Lustig, John M. Mulvey, David F. Shanno: Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure. INFORMS Journal on Computing 5(2): 182-191 (1993)
	1992
j8		Greg Astfalk, Irvin Lustig, Roy E. Marsten, David F. Shanno: The Interior-Point Method for Linear Programming. IEEE Software 9(4): 61-68 (1992)
	1990
j7		In Chan Choi, Clyde L. Monma, David F. Shanno: Further Development of a Primal-Dual Interior Point Method. INFORMS Journal on Computing 2(4): 304-311 (1990)
	1989
j6		Kevin A. McShane, Clyde L. Monma, David F. Shanno: An Implementation of a Primal-Dual Interior Point Method for Linear Programming. INFORMS Journal on Computing 1(2): 70-83 (1989)
j5		Roy E. Marsten, Matthew J. Saltzman, David F. Shanno, George S. Pierce, J. F. Ballintijn: Implementation of a Dual Affine Interior Point Algorithm for Linear Programming. INFORMS Journal on Computing 1(4): 287-297 (1989)
j4		David F. Shanno, Kang-Hoh Phua: Numerical experience with sequential quadratic programming algorithms for equality constrained nonlinear programming. ACM Trans. Math. Softw. 15(1): 49-63 (1989)
	1980
j3		David F. Shanno, Kang-Hoh Phua: Remark on ``Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]''. ACM Trans. Math. Softw. 6(4): 618-622 (1980)
	1977
c2		David F. Shanno, Kang-Hoh Phua: Inexact Step Lengths and Quasi-Newton Methods. IFIP Congress 1977: 189-193
	1976
j2		David F. Shanno, Kang-Hoh Phua: Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]. ACM Trans. Math. Softw. 2(1): 87-94 (1976)
	1974
c1		David F. Shanno, Allen Berg, Grant A. Cheston: Restarts and Rotations of Quasi-Newton Methods. IFIP Congress 1974: 557-561
	1972
j1		David F. Shanno, Roman L. Weil: Management Science: A View from Nonlinear Programming. Commun. ACM 15(7): 542-549 (1972)

2008

j18

Igor Griva, David F. Shanno, Robert J. Vanderbei, Hande Y. Benson: Global convergence of a primal-dual interior-point method for nonlinear programming. Algorithmic Operations Research 3(1) (2008)

j17

Hande Y. Benson, David F. Shanno: Interior-point methods for nonconvex nonlinear programming: regularization and warmstarts. Comp. Opt. and Appl. 40(2): 143-189 (2008)

2007

j16

Hande Y. Benson, David F. Shanno: An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming. Comp. Opt. and Appl. 38(3): 371-399 (2007)

2006

j15

Hande Y. Benson, Arun Sen, David F. Shanno, Robert J. Vanderbei: Interior-Point Algorithms, Penalty Methods and Equilibrium Problems. Comp. Opt. and Appl. 34(2): 155-182 (2006)

2004

j14

Hande Y. Benson, David F. Shanno, Robert J. Vanderbei: Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing. Math. Program. 99(1): 35-48 (2004)

2002

j13

Hande Y. Benson, Robert J. Vanderbei, David F. Shanno: Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions. Comp. Opt. and Appl. 23(2): 257-272 (2002)

1994

j12

Irvin J. Lustig, Roy E. Marsten, David F. Shanno: Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art. INFORMS Journal on Computing 6(1): 1-14 (1994)

j11

Irvin J. Lustig, Roy E. Marsten, David F. Shanno: Rejoinder - The Last Word on Interior Point Methods for Linear Programming - For Now. INFORMS Journal on Computing 6(1): 35-36 (1994)

j10

Irvin Lustig, Roy E. Marsten, David F. Shanno: Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming. Math. Program. 66: 123-135 (1994)

1993

Tamra J. Carpenter, Irvin J. Lustig, John M. Mulvey, David F. Shanno: Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure. INFORMS Journal on Computing 5(2): 182-191 (1993)

1992

Greg Astfalk, Irvin Lustig, Roy E. Marsten, David F. Shanno: The Interior-Point Method for Linear Programming. IEEE Software 9(4): 61-68 (1992)

1990

In Chan Choi, Clyde L. Monma, David F. Shanno: Further Development of a Primal-Dual Interior Point Method. INFORMS Journal on Computing 2(4): 304-311 (1990)

1989

Kevin A. McShane, Clyde L. Monma, David F. Shanno: An Implementation of a Primal-Dual Interior Point Method for Linear Programming. INFORMS Journal on Computing 1(2): 70-83 (1989)

Roy E. Marsten, Matthew J. Saltzman, David F. Shanno, George S. Pierce, J. F. Ballintijn: Implementation of a Dual Affine Interior Point Algorithm for Linear Programming. INFORMS Journal on Computing 1(4): 287-297 (1989)

David F. Shanno, Kang-Hoh Phua: Numerical experience with sequential quadratic programming algorithms for equality constrained nonlinear programming. ACM Trans. Math. Softw. 15(1): 49-63 (1989)

1980

David F. Shanno, Kang-Hoh Phua: Remark on ``Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]''. ACM Trans. Math. Softw. 6(4): 618-622 (1980)

1977

David F. Shanno, Kang-Hoh Phua: Inexact Step Lengths and Quasi-Newton Methods. IFIP Congress 1977: 189-193

1976

David F. Shanno, Kang-Hoh Phua: Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]. ACM Trans. Math. Softw. 2(1): 87-94 (1976)

1974

David F. Shanno, Allen Berg, Grant A. Cheston: Restarts and Rotations of Quasi-Newton Methods. IFIP Congress 1974: 557-561

1972

David F. Shanno, Roman L. Weil: Management Science: A View from Nonlinear Programming. Commun. ACM 15(7): 542-549 (1972)

1	Greg Astfalk	[j8]
2	J. F. Ballintijn	[j5]
3	Hande Y. Benson	[j18] [j17] [j16] [j15] [j14] [j13]
4	Allen Berg	[c1]
5	Tamra J. Carpenter	[j9]
6	Grant A. Cheston	[c1]
7	In Chan Choi	[j7]
8	Igor Griva	[j18]
9	Irvin Lustig (Irvin J. Lustig)	[j12] [j11] [j10] [j9] [j8]
10	Roy E. Marsten	[j12] [j11] [j10] [j8] [j5]
11	Kevin A. McShane	[j6]
12	Clyde L. Monma	[j7] [j6]
13	John M. Mulvey	[j9]
14	Kang-Hoh Phua	[j4] [j3] [c2] [j2]
15	George S. Pierce	[j5]
16	Matthew J. Saltzman	[j5]
17	Arun Sen	[j15]
18	Robert J. Vanderbei	[j18] [j15] [j14] [j13]
19	Roman L. Weil	[j1]

David F. Shanno

Coauthor Index