E. Michael Gertz

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Primal-Dual Interior-Point Methods 1997 Stephen J. Wright
4
+ On the Implementation of a Primal-Dual Interior Point Method 1992 Sanjay Mehrotra
3
+ PDF Chat Interior-Point Methods for Massive Support Vector Machines 2002 Michael C. Ferris
Todd Munson
3
+ Practical Methods of Optimization 2009 R. Ian Fletcher
3
+ PDF Chat Object-oriented software for quadratic programming 2003 E. Michael Gertz
Stephen J. Wright
3
+ Combination trust-region line-search methods for unconstrained optimization 1999 E. Michael Gertz
Philip E. Gill
3
+ Multiple centrality corrections in a primal-dual method for linear programming 1996 Jacek Gondzio
3
+ Sequential estimation techniques for quasi-newton algorithms. 1975 Stephen W Thomas
3
+ On the formulation and theory of the Newton interior-point method for nonlinear programming 1996 Amr El-Bakry
R. A. Tapia
Takashi Tsuchiya
Y. Zhang
2
+ PDF Chat QMR: a quasi-minimal residual method for non-Hermitian linear systems 1991 Roland W. Freund
No�l M. Nachtigal
2
+ PDF Chat Properties of the Log-Barrier Function on Degenerate Nonlinear Programs 2002 Stephen J. Wright
Dominique Orban
2
+ PDF Chat An Interior Point Algorithm for Large-Scale Nonlinear Programming 1999 Richard H. Byrd
Mary E. Hribar
Jorge Nocedal
2
+ A Primal-dual Interior Method for Nonconvex Nonlinear Programming 1998 David M. Gay
Michael L. Overton
Margaret H. Wright
2
+ PDF Chat Primal-Dual Interior Methods for Nonconvex Nonlinear Programming 1998 Anders Forsgren
Philip E. Gill
2
+ PDF Chat Computing Modified Newton Directions Using a Partial Cholesky Factorization 1995 Anders Forsgren
Phillip Gill
Walter Murray
2
+ PDF Chat Newton’s Method with a Model Trust Region Modification 1982 D. C. Sorensen
2
+ Iterative methods for linear and nonlinear equations 1996 C. T. Kelley
2
+ PDF Chat Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming 2001 Nicholas I. M. Gould
Dominique Orban
Annick Sartenaer
Philippe L. Toint
2
+ OOQP User Guide 2002 E. Michael Gertz
Stephen J. Wright
2
+ Interior methods for constrained optimization 1992 Margaret H. Wright
2
+ PDF Chat On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems 1993 Yin Zhang
R. A. Tapia
Florian A. Potra
2
+ PDF Chat Semismooth support vector machines 2004 Michael C. Ferris
Todd Munson
2
+ PDF Chat Solving Reduced KKT Systems in Barrier Methods for Linear and Quadratic Programming 1991 Philip E. Gill
Walter Murray
Dulce B. Ponceleón
Michael A. Saunders
2
+ PDF Chat On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms 1992 Yin Zhang
R. A. Tapia
J. E. Dennis
2
+ PDF Chat An augmented Lagrangian interior-point method using directions of negative curvature 2003 Javier M. Moguerza
Francisco J. Prieto
2
+ Computing Optimal Locally Constrained Steps 1981 David M. Gay
2
+ PDF Chat On the Global Convergence of a Modified Augmented Lagrangian Linesearch Interior-Point Newton Method for Nonlinear Programming 2002 Miguel Argáez
R. A. Tapia
2
+ Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods 2000 David F. Shanno
Robert J. Vanderbei
2
+ MA27 -- A set of Fortran subroutines for solving sparse symmetric sets of linear equations 1982 Iain Duff
John Reid
2
+ None 2002 Hande Y. Benson
Robert J. Vanderbei
David F. Shanno
2
+ PDF Chat A primal-dual algorithm for minimizing a non-convex function subject to bound and linear equality constraints 2000 Andrew R. Conn
Nicholas I. M. Gould
Philippe L. Toint
2
+ PDF Chat Analysis of the Cholesky decomposition of a semi-definite matrix 1990 Nicholas J. Higham
2
+ PDF Chat A globally convergent primal-dual interior-point filter method for nonlinear programming 2004 Michael Ulbrich
Stefan Ulbrich
L. N. Vicente
2
+ PDF Chat A repository of convex quadratic programming problems 1999 István Maros
Csaba Mészáros
2
+ PCx: an interior-point code for linear programming 1999 Joseph Czyzyk
Sanjay Mehrotra
Michael Wagner
Stephen J. Wright
2
+ A primal-dual trust-region algorithm for non-convex nonlinear programming 2000 Andrew R. Conn
Nicholas I. M. Gould
Dominique Orban
Philippe L. Toint
2
+ PDF Chat Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems 1998 J. E. Dennis
Matthias Heinkenschloss
L. N. Vicente
2
+ Stability of Symmetric Ill-Conditioned Systems Arising in Interior Methods for Constrained Optimization 1996 Anders Forsgren
Philip E. Gill
Joseph R. Shinnerl
2
+ On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions 1986 Nicholas I. M. Gould
2
+ Solving symmetric indefinite systems in an interior-point method for linear programming 1993 Robert Fourer
Sanjay Mehrotra
2
+ SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization 2002 Philip E. Gill
Walter Murray
Michael A. Saunders
2
+ PDF Chat CUTE 1995 Ingrid Bongartz
Andrew R. Conn
Nicholas I. M. Gould
Philippe L. Toint
2
+ A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems 1993 Roland W. Freund
2
+ PDF Chat A trust region method based on interior point techniques for nonlinear programming 2000 Richard H. Byrd
Jean Charles Gilbert
Jorge Nocedal
2
+ Inertia-controlling factorizations for optimization algorithms 2002 Anders Forsgren
2
+ Stability of Linear Equations Solvers in Interior-Point Methods 1995 Stephen J. Wright
2
+ Nonlinear programming without a penalty function 2002 R. Fletcher
Sven Leyffer
2
+ CONVERGENCE PROPERTIES OF A CLASS OF MINIMIZATION ALGORITHMS 1975 M. J. D. Powell
2
+ None 1999 Robert J. Vanderbei
David F. Shanno
2
+ Newton Methods for Large-Scale Linear Equality-Constrained Minimization 1993 Anders Forsgren
Walter Murray
2