Philip E. Gill

From MaRDI portal
Person:312691

Available identifiers

zbMath Open gill.philip-eWikidataQ102123373 ScholiaQ102123373MaRDI QIDQ312691

List of research outcomes





PublicationDate of PublicationType
A class of projected-search methods for bound-constrained optimization2024-11-20Paper
An \(LDL^{\mathrm{T}}\) trust-region quasi-Newton method2024-10-24Paper
A projected-search interior-point method for nonlinearly constrained optimization2024-05-07Paper
Projected-Search Methods for Bound-Constrained Optimization2021-10-15Paper
Numerical Linear Algebra and Optimization2021-09-29Paper
A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization2020-04-16Paper
Practical Optimization2020-01-22Paper
A study of structure-exploiting SQP algorithms for an optimal control problem with coupled hyperbolic and ordinary differential equation constraints2019-01-24Paper
A stabilized SQP method: global convergence2018-09-26Paper
An Augmented Lagrangian Method for Total Variation Video Restoration2017-10-19Paper
On the performance of SQP methods for nonlinear optimization2017-08-29Paper
A stabilized SQP method: superlinear convergence2017-05-15Paper
Primal and dual active-set methods for convex quadratic programming2016-09-16Paper
Methods for convex and general quadratic programming2015-07-29Paper
A Globally Convergent Stabilized SQP Method2014-04-09Paper
A primal-dual augmented Lagrangian2012-07-10Paper
Sequential quadratic programming methods2012-07-10Paper
State and parameter estimation in nonlinear systems as an optimal tracking problem2011-09-02Paper
A Subspace Minimization Method for the Trust-Region Step2010-09-06Paper
Iterative methods for finding a trust-region step2010-06-01Paper
George B. Dantzig and systems optimization2008-10-29Paper
Iterative Solution of Augmented Systems Arising in Interior Methods2008-05-22Paper
Optimization of tensegrity structures2007-10-17Paper
Algebraic tensegrity form-finding2007-10-15Paper
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization2005-09-16Paper
https://portal.mardi4nfdi.de/entity/Q46548412005-03-10Paper
A primal-dual trust region algorithm for nonlinear optimization2005-01-03Paper
Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization2004-01-19Paper
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization2003-01-05Paper
Interior Methods for Nonlinear Optimization2003-01-05Paper
Reduced-Hessian quasi-Newton methods for unconstrained optimization2002-04-23Paper
An SQP method for the optimal control of large-scale dynamical systems2001-07-03Paper
https://portal.mardi4nfdi.de/entity/Q42498162000-01-09Paper
Primal-Dual Interior Methods for Nonconvex Nonlinear Programming1999-02-22Paper
https://portal.mardi4nfdi.de/entity/Q43710751998-01-28Paper
Primal-dual methods for linear programming1997-02-03Paper
On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems1996-03-27Paper
Stability of Symmetric Ill-Conditioned Systems Arising in Interior Methods for Constrained Optimization1996-03-27Paper
Computing Modified Newton Directions Using a Partial Cholesky Factorization1995-10-22Paper
https://portal.mardi4nfdi.de/entity/Q42885531995-06-30Paper
https://portal.mardi4nfdi.de/entity/Q43236081995-02-23Paper
https://portal.mardi4nfdi.de/entity/Q42955681994-06-14Paper
https://portal.mardi4nfdi.de/entity/Q46923871993-06-05Paper
Preconditioners for Indefinite Systems Arising in Optimization1992-06-28Paper
On the Identification of Local Minimizers in Inertia-Controlling Methods for Quadratic Programming1992-06-26Paper
Inertia-Controlling Methods for General Quadratic Programming1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52035861990-01-01Paper
A practical anti-cycling procedure for linearly constrained optimization1989-01-01Paper
Recent developments in constrained optimization1988-01-01Paper
Maintaining LU factors of a general sparse matrix1987-01-01Paper
On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37426261986-01-01Paper
Properties of a representation of a basis for the null space1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37149111985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36945731985-01-01Paper
Sparse Matrix Methods in Optimization1984-01-01Paper
A weighted gram-schmidt method for convex quadratic programming1984-01-01Paper
Procedures for optimization problems with a mixture of bounds and general linear constraints1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33437861984-01-01Paper
Computing Forward-Difference Intervals for Numerical Optimization1983-01-01Paper
A note on a sufficient-decrease criterion for a non-derivative step-length procedure1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36881121982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33406421982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47396591981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33176571981-01-01Paper
Aspects of mathematical modelling related to optimization1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33282691981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39179061980-01-01Paper
The computation of Lagrange-multiplier estimates for constrained minimization1979-01-01Paper
The Design and Structure of a Fortran Program Library for Optimization1979-01-01Paper
Numerically stable methods for quadratic programming1978-01-01Paper
Algorithms for the Solution of the Nonlinear Least-Squares Problem1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41146981976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40882111976-01-01Paper
Methods for Computing and Modifying the LDV Factors of a Matrix1975-01-01Paper
Methods for Modifying Matrix Factorizations1974-01-01Paper
Newton-type methods for unconstrained and linearly constrained optimization1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47779471973-01-01Paper
A numerically stable form of the simplex algorithm1973-01-01Paper
Quasi-Newton Methods for Unconstrained Optimization1972-01-01Paper

Research outcomes over time

This page was built for person: Philip E. Gill