default search action
Philip E. Gill
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j38]Philip E. Gill, Minxin Zhang:
A projected-search interior-point method for nonlinearly constrained optimization. Comput. Optim. Appl. 88(1): 37-70 (2024) - [j37]Michael W. Ferry, Philip E. Gill, Elizabeth Wong, Minxin Zhang:
A class of projected-search methods for bound-constrained optimization. Optim. Methods Softw. 39(3): 459-488 (2024) - [j36]Johannes J. Brust, Philip E. Gill:
An \({LDL}^{\textrm{T}}\) Trust-Region Quasi-Newton Method. SIAM J. Sci. Comput. 46(5): 3330- (2024) - 2023
- [i2]Johannes J. Brust, Philip E. Gill:
An LDLT Trust-Region Quasi-Newton Method. CoRR abs/2312.06884 (2023) - 2020
- [j35]Philip E. Gill, Vyacheslav Kungurtsev
, Daniel P. Robinson
A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization. SIAM J. Optim. 30(2): 1067-1093 (2020)
2010 – 2019
- 2017
- [j34]Philip E. Gill, Vyacheslav Kungurtsev
A stabilized SQP method: superlinear convergence. Math. Program. 163(1-2): 369-410 (2017) - 2016
- [j33]Anders Forsgren, Philip E. Gill, Elizabeth Wong:
Primal and dual active-set methods for convex quadratic programming. Math. Program. 159(1-2): 469-508 (2016) - 2015
- [j32]Philip E. Gill, Elizabeth Wong:
Methods for convex and general quadratic programming. Math. Program. Comput. 7(1): 71-112 (2015) - [j31]Daniel Bienstock, Philip E. Gill, Nicholas I. M. Gould
A note on "On fast trust region methods for quadratic models with linear constraints", by Michael J.D. Powell. Math. Program. Comput. 7(3): 235 (2015) - 2013
- [j30]Philip E. Gill, Daniel P. Robinson:
A Globally Convergent Stabilized SQP Method. SIAM J. Optim. 23(4): 1983-2010 (2013) - 2012
- [j29]Philip E. Gill, Daniel P. Robinson:
A primal-dual augmented Lagrangian. Comput. Optim. Appl. 51(1): 1-25 (2012) - 2011
- [j28]Stanley H. Chan, Ramsin Khoshabeh, Kristofor B. Gibson
An Augmented Lagrangian Method for Total Variation Video Restoration. IEEE Trans. Image Process. 20(11): 3097-3111 (2011) - [c1]Stanley H. Chan, Ramsin Khoshabeh, Kristofor B. Gibson, Philip E. Gill, Truong Q. Nguyen:
An augmented Lagrangian method for video restoration. ICASSP 2011: 941-944
2000 – 2009
- 2009
- [j27]Jennifer B. Erway, Philip E. Gill, Joshua D. Griffin:
Iterative Methods for Finding a Trust-region Step. SIAM J. Optim. 20(2): 1110-1131 (2009) - [j26]Jennifer B. Erway, Philip E. Gill:
A Subspace Minimization Method for the Trust-Region Step. SIAM J. Optim. 20(3): 1439-1461 (2009) - 2008
- [j25]Philip E. Gill, Walter Murray, Michael A. Saunders
George B. Dantzig and systems optimization. Discret. Optim. 5(2): 151-158 (2008) - 2007
- [j24]Anders Forsgren, Philip E. Gill, Joshua D. Griffin:
Iterative Solution of Augmented Systems Arising in Interior Methods. SIAM J. Optim. 18(2): 666-690 (2007) - [p1]Gene H. Golub, Philip E. Gill, Walter Murray, Michael A. Saunders:
Methods for modifying matrix factorizations. Milestones in Matrix Computation 2007: 309-344 - 2005
- [j23]Philip E. Gill, Walter Murray, Michael A. Saunders
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization. SIAM Rev. 47(1): 99-131 (2005) - 2004
- [j22]E. Michael Gertz, Philip E. Gill:
A primal-dual trust region algorithm for nonlinear optimization. Math. Program. 100(1): 49-94 (2004) - 2003
- [j21]Philip E. Gill, Michael W. Leonard:
Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization. SIAM J. Optim. 14(2): 380-401 (2003) - 2002
- [j20]Philip E. Gill, Walter Murray, Michael A. Saunders:
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization. SIAM J. Optim. 12(4): 979-1006 (2002) - [j19]Anders Forsgren, Philip E. Gill, Margaret H. Wright:
Interior Methods for Nonlinear Optimization. SIAM Rev. 44(4): 525-597 (2002) - 2001
- [j18]Philip E. Gill, Michael W. Leonard:
Reduced-Hessian Quasi-Newton Methods for Unconstrained Optimization. SIAM J. Optim. 12(1): 209-237 (2001) - [i1]E. Michael Gertz, Philip E. Gill, Julia Muetherig:
Users Guide for SnadiOpt: A Package Adding Automatic Differentiation to Snopt. CoRR cs.MS/0106051 (2001)
1990 – 1999
- 1998
- [j17]Anders Forsgren, Philip E. Gill:
Primal-Dual Interior Methods for Nonconvex Nonlinear Programming. SIAM J. Optim. 8(4): 1132-1152 (1998) - 1996
- [j16]Philip E. Gill, Michael A. Saunders, Joseph R. Shinnerl:
On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems. SIAM J. Matrix Anal. Appl. 17(1): 35-46 (1996) - [j15]Anders Forsgren, Philip E. Gill, Joseph R. Shinnerl:
Stability of Symmetric Ill-Conditioned Systems Arising in Interior Methods for Constrained Optimization. SIAM J. Matrix Anal. Appl. 17(1): 187-211 (1996) - 1995
- [j14]Philip E. Gill, Walter Murray, Dulce B. Ponceleon, Michael A. Saunders:
Primal - dual methods for linear programming. Math. Program. 70: 251-277 (1995) - [j13]Anders Forsgren, Philip E. Gill, Walter Murray:
Computing Modified Newton Directions Using a Partial Cholesky Factorization. SIAM J. Sci. Comput. 16(1): 139-150 (1995) - 1992
- [j12]Philip E. Gill, Walter Murray, Dulce B. Ponceleón, Michael A. Saunders:
Preconditioners for Indefinite Systems Arising in Optimization. SIAM J. Matrix Anal. Appl. 13(1): 292-311 (1992) - 1991
- [j11]Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright:
Inertia-Controlling Methods for General Quadratic Programming. SIAM Rev. 33(1): 1-36 (1991)
1980 – 1989
- 1989
- [j10]Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright:
A practical anti-cycling procedure for linearly constrained optimization. Math. Program. 45(1-3): 437-474 (1989) - 1986
- [j9]Philip E. Gill, Walter Murray, Michael A. Saunders, John A. Tomlin, Margaret H. Wright:
On projected newton barrier methods for linear programming and an equivalence to Karmarkar's projective method. Math. Program. 36(2): 183-209 (1986) - 1985
- [j8]Philip E. Gill, Walter Murray, Michael A. Saunders, G. W. Stewart, Margaret H. Wright:
Properties of a representation of a basis for the null space. Math. Program. 33(2): 172-186 (1985) - 1984
- [j7]Philip E. Gill, Nicholas I. M. Gould
A weighted gram-schmidt method for convex quadratic programming. Math. Program. 30(2): 176-195 (1984) - [j6]Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright:
Procedures for optimization problems with a mixture of bounds and general linear constraints. ACM Trans. Math. Softw. 10(3): 282-298 (1984) - 1982
- [j5]Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright:
A note on a sufficient-decrease criterion for a non-derivative step-length procedure. Math. Program. 23(1): 349-352 (1982) - 1981
- [b1]Philip E. Gill, Walter Murray, Margaret H. Wright:
Practical optimization. Academic Press 1981, ISBN 978-0-12-283952-8, pp. I-XVI, 1-401
1970 – 1979
- 1979
- [j4]Philip E. Gill, Walter Murray:
The computation of Lagrange-multiplier estimates for constrained minimization. Math. Program. 17(1): 32-60 (1979) - [j3]Philip E. Gill, Walter Murray, Susan M. Picken, Margaret H. Wright:
The Design and Structure of a Fortran Program Library for Optimization. ACM Trans. Math. Softw. 5(3): 259-283 (1979) - 1978
- [j2]Philip E. Gill, Walter Murray:
Numerically stable methods for quadratic programming. Math. Program. 14(1): 349-372 (1978) - 1974
- [j1]Philip E. Gill, Walter Murray:
Newton-type methods for unconstrained and linearly constrained optimization. Math. Program. 7(1): 311-350 (1974)
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-12-03 21:18 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: