default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid F. Shanno
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Cassidy K. Buhler, Hande Y. Benson, David F. Shanno:
Regularized step directions in nonlinear conjugate gradient methods. Math. Program. Comput. 16(4): 629-664 (2024)
2010 – 2019
- 2018
- [j36]Hande Y. Benson
, David F. Shanno:
Cubic regularization in symmetric rank-1 quasi-Newton methods. Math. Program. Comput. 10(4): 457-486 (2018) - 2014
- [j35]Hande Y. Benson, David F. Shanno:
Interior-point methods for nonconvex nonlinear programming: cubic regularization. Comput. Optim. Appl. 58(2): 323-346 (2014)
2000 – 2009
- 2008
- [j34]Igor Griva, David F. Shanno, Robert J. Vanderbei, Hande Y. Benson:
Global convergence of a primal-dual interior-point method for nonlinear programming. Algorithmic Oper. Res. 3(1) (2008) - [j33]Hande Y. Benson, David F. Shanno:
Interior-point methods for nonconvex nonlinear programming: regularization and warmstarts. Comput. Optim. Appl. 40(2): 143-189 (2008) - [j32]Arun Sen, David F. Shanno:
Optimization and dynamical systems algorithms for finding equilibria of stochastic games. Optim. Methods Softw. 23(6): 975-993 (2008) - 2007
- [j31]Hande Y. Benson, David F. Shanno:
An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming. Comput. Optim. Appl. 38(3): 371-399 (2007) - 2006
- [j30]Hande Y. Benson, Arun Sen, David F. Shanno, Robert J. Vanderbei:
Interior-Point Algorithms, Penalty Methods and Equilibrium Problems. Comput. Optim. Appl. 34(2): 155-182 (2006) - 2004
- [j29]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
- [j28]Hande Y. Benson, Robert J. Vanderbei, David F. Shanno:
Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions. Comput. Optim. Appl. 23(2): 257-272 (2002) - 2000
- [j27]David F. Shanno, Robert J. Vanderbei:
Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods. Math. Program. 87(2): 303-316 (2000)
1990 – 1999
- 1999
- [j26]Robert J. Vanderbei, David F. Shanno:
An Interior-Point Algorithm for Nonconvex Nonlinear Programming. Comput. Optim. Appl. 13(1-3): 231-252 (1999) - 1997
- [j25]Evangelia M. Simantiraki, David F. Shanno:
An Infeasible-Interior-Point Method for Linear Complementarity Problems. SIAM J. Optim. 7(3): 620-640 (1997) - 1996
- [j24]Marc G. Breitfeld, David F. Shanno:
Computational experience with penalty-barrier methods for nonlinear programming. Ann. Oper. Res. 62(1): 439-463 (1996) - 1994
- [j23]Irvin J. Lustig, Roy E. Marsten, David F. Shanno:
Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art. INFORMS J. Comput. 6(1): 1-14 (1994) - [j22]Irvin J. Lustig, Roy E. Marsten, David F. Shanno:
Rejoinder - The Last Word on Interior Point Methods for Linear Programming - For Now. INFORMS J. Comput. 6(1): 35-36 (1994) - [j21]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
- [j20]Tamra J. Carpenter, David F. Shanno:
An interior point method for quadratic programs based on conjugate projected gradients. Comput. Optim. Appl. 2(1): 5-28 (1993) - [j19]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 J. Comput. 5(2): 182-191 (1993) - [j18]Tamra J. Carpenter, Irvin J. Lustig, John M. Mulvey, David F. Shanno:
Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives. SIAM J. Optim. 3(4): 696-725 (1993) - 1992
- [j17]Robert E. Bixby, John W. Gregory, Irvin J. Lustig, Roy E. Marsten, David F. Shanno:
Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods. Oper. Res. 40(5): 885-897 (1992) - [j16]Irvin J. Lustig, Roy E. Marsten, David F. Shanno:
On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming. SIAM J. Optim. 2(3): 435-449 (1992) - [j15]Greg Astfalk, Irvin Lustig, Roy E. Marsten, David F. Shanno:
The Interior-Point Method for Linear Programming. IEEE Softw. 9(4): 61-68 (1992) - 1990
- [j14]In Chan Choi, Clyde L. Monma, David F. Shanno:
Further Development of a Primal-Dual Interior Point Method. INFORMS J. Comput. 2(4): 304-311 (1990)
1980 – 1989
- 1989
- [j13]Kevin A. McShane, Clyde L. Monma, David F. Shanno:
An Implementation of a Primal-Dual Interior Point Method for Linear Programming. INFORMS J. Comput. 1(2): 70-83 (1989) - [j12]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 J. Comput. 1(4): 287-297 (1989) - [j11]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) - 1988
- [j10]David F. Shanno:
Computing Karmarkar projections quickly. Math. Program. 41(1-3): 61-71 (1988) - 1986
- [j9]David F. Shanno, A. J. J. Talman, Satoru Fujishige, Steven Nahmias, Karl Straßner, Götz Uebe:
Book reviews. Z. Oper. Research 30(3) (1986) - 1985
- [j8]David F. Shanno:
Globally convergent conjugate gradient algorithms. Math. Program. 33(1): 61-67 (1985) - 1980
- [j7]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)
1970 – 1979
- 1978
- [j6]David F. Shanno:
Conjugate Gradient Methods with Inexact Searches. Math. Oper. Res. 3(3): 244-256 (1978) - [j5]David F. Shanno, Kang-Hoh Phua:
Matrix conditioning and nonlinear optimization. Math. Program. 14(1): 149-160 (1978) - 1977
- [c2]David F. Shanno, Kang-Hoh Phua:
Inexact Step Lengths and Quasi-Newton Methods. IFIP Congress 1977: 189-193 - 1976
- [j4]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
- [j3]David F. Shanno, Roman L. Weil:
Management Science: A View from Nonlinear Programming. Commun. ACM 15(7): 542-549 (1972) - [j2]David F. Shanno:
Book review. Math. Program. 3(1): 392-394 (1972) - 1971
- [j1]David F. Shanno, Roman L. Weil:
Technical Note - "Linear" Programming with Absolute-Value Functionals. Oper. Res. 19(1): 120-124 (1971)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 20:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
