Philip E. Gill

According to our database1, Philip E. Gill authored at least 39 papers between 1974 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An LDL<sup>T</sup> Trust-Region Quasi-Newton Method.
CoRR, 2023

2020
A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization.
SIAM J. Optim., 2020

2017
A stabilized SQP method: superlinear convergence.
Math. Program., 2017

2016
Primal and dual active-set methods for convex quadratic programming.
Math. Program., 2016

2015
Methods for convex and general quadratic programming.
Math. Program. Comput., 2015

A note on "On fast trust region methods for quadratic models with linear constraints", by Michael J.D. Powell.
Math. Program. Comput., 2015

2013
A Globally Convergent Stabilized SQP Method.
SIAM J. Optim., 2013

2012
A primal-dual augmented Lagrangian.
Comput. Optim. Appl., 2012

2011
An Augmented Lagrangian Method for Total Variation Video Restoration.
IEEE Trans. Image Process., 2011

An augmented Lagrangian method for video restoration.
Proceedings of the IEEE International Conference on Acoustics, 2011

2009
Iterative Methods for Finding a Trust-region Step.
SIAM J. Optim., 2009

A Subspace Minimization Method for the Trust-Region Step.
SIAM J. Optim., 2009

2008
George B. Dantzig and systems optimization.
Discret. Optim., 2008

2007
Iterative Solution of Augmented Systems Arising in Interior Methods.
SIAM J. Optim., 2007

Methods for modifying matrix factorizations.
Proceedings of the Milestones in Matrix Computation, 2007

2004
A primal-dual trust region algorithm for nonlinear optimization.
Math. Program., 2004

2003
Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization.
SIAM J. Optim., 2003

2002
Interior Methods for Nonlinear Optimization.
SIAM Rev., 2002

SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization.
SIAM J. Optim., 2002

2001
Reduced-Hessian Quasi-Newton Methods for Unconstrained Optimization.
SIAM J. Optim., 2001

Users Guide for SnadiOpt: A Package Adding Automatic Differentiation to Snopt
CoRR, 2001

1998
Primal-Dual Interior Methods for Nonconvex Nonlinear Programming.
SIAM J. Optim., 1998

1996
On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems.
SIAM J. Matrix Anal. Appl., 1996

Stability of Symmetric Ill-Conditioned Systems Arising in Interior Methods for Constrained Optimization.
SIAM J. Matrix Anal. Appl., 1996

1995
Computing Modified Newton Directions Using a Partial Cholesky Factorization.
SIAM J. Sci. Comput., 1995

Primal - dual methods for linear programming.
Math. Program., 1995

1992
Preconditioners for Indefinite Systems Arising in Optimization.
SIAM J. Matrix Anal. Appl., 1992

1991
Inertia-Controlling Methods for General Quadratic Programming.
SIAM Rev., 1991

1989
A practical anti-cycling procedure for linearly constrained optimization.
Math. Program., 1989

1986
On projected newton barrier methods for linear programming and an equivalence to Karmarkar's projective method.
Math. Program., 1986

1985
Properties of a representation of a basis for the null space.
Math. Program., 1985

1984
Procedures for optimization problems with a mixture of bounds and general linear constraints.
ACM Trans. Math. Softw., 1984

A weighted gram-schmidt method for convex quadratic programming.
Math. Program., 1984

1982
A note on a sufficient-decrease criterion for a non-derivative step-length procedure.
Math. Program., 1982

1981
Practical optimization.
Academic Press, ISBN: 978-0-12-283952-8, 1981

1979
The Design and Structure of a Fortran Program Library for Optimization.
ACM Trans. Math. Softw., 1979

The computation of Lagrange-multiplier estimates for constrained minimization.
Math. Program., 1979

1978
Numerically stable methods for quadratic programming.
Math. Program., 1978

1974
Newton-type methods for unconstrained and linearly constrained optimization.
Math. Program., 1974


  Loading...