P. Gill

Publications141
h-index50
Citations20,820
Highly Influential Citations1,000
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • W. Murray
  • 88 Publications • 16,244 Citations
  • M. Saunders
  • 168 Publications • 28,051 Citations
  • M. H. Wright
  • 102 Publications • 20,057 Citations
  • P. Toint
  • 269 Publications • 12,037 Citations
  • Publications
  • Influence
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
TLDR
An SQP algorithm that uses a smooth augmented Lagrangian merit function and makes explicit provision for infeasibility in the original problem and the QP subproblems is discussed. Expand
Practical optimization
TLDR
This ebook Practical Optimization by Philip E. Gill is presented in pdf format and the full version of this ebook in DjVu, ePub, doc, txt, PDF forms is presented. Expand
An Augmented Lagrangian Method for Total Variation Video Restoration
TLDR
The proposed algorithm, as opposed to existing methods, does not consider video restoration as a sequence of image restoration problems, rather, it treats a video sequence as a space-time volume and poses aspace-time total variation regularization to enhance the smoothness of the solution. Expand
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
TLDR
An SQP algorithm that uses a smooth augmented Lagrangian merit function and makes explicit provision for infeasibility in the original problem and the QP subproblems is discussed and a reduced-Hessian semidefinite QP solver (SQOPT) is discussed. Expand
Interior Methods for Nonlinear Optimization
TLDR
A condensed, selective look at classical material and recent research about interior methods for nonlinearly constrained optimization shows how their influence has transformed both the theory and practice of constrained optimization. Expand
Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
TLDR
Large-scale general (nonconvex) nonlinear programming when first and second derivatives of the objective and constraint functions are available is concerned, and a method suitable for large problems can be obtained. Expand
Newton-type methods for unconstrained and linearly constrained optimization
TLDR
The methods are intimately based on the recurrence of matrix factorizations and are linked to earlier work on quasi-Newton methods and quadratic programming. Expand
User''s guide for NPSOL (Ver-sion 4.0): A FORTRAN package for nonlinear programming
A multisectional support useful as a trellis and for other purposes. Each section includes one or more components to which the corresponding components of super- and/or subjacent sections can be… Expand
Algorithms for the Solution of the Nonlinear Least-Squares Problem
This paper describes a modification to the Gauss–Newton method for the solution of nonlinear least-squares problems. The new method seeks to avoid the deficiencies in the Gauss–Newton method by… Expand
Fortran package for nonlinear programming. User's Guide for NPSOL (Version 4. 0)
This report forms the user's guide for Version 4.0 of NPSOL, a set of Fortran subroutines designed to minimize a smooth function subject to constraints, which may include simple bounds on the… Expand
...
1
2
3
4
5
...