The following pages link to David F. Shanno (Q457204):
Displayed 50 items.
- Interior-point methods for nonconvex nonlinear programming: cubic regularization (Q457205) (← links)
- Item:Q457204 (redirect page) (← links)
- An example of numerical nonconvergence of a variable-metric method (Q795739) (← links)
- A unified view of interior point methods for linear programming (Q803041) (← links)
- Computational experience with a primal-dual interior point method for linear programming (Q808184) (← links)
- Interior-point algorithms, penalty methods and equilibrium problems (Q853552) (← links)
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts (Q953208) (← links)
- Adding variables to quasi-newton Hessian approximations (Q1077886) (← links)
- A reduced-gradient variant of Karmarkar's algorithm and null-space projections (Q1090599) (← links)
- Computing Karmarkar projections quickly (Q1107438) (← links)
- Computational experience with methods for estimating sparse hessians for nonlinear optimization (Q1142991) (← links)
- Numerical comparison of several variable metric algorithms (Q1243254) (← links)
- An interior point method for quadratic programs based on conjugate projected gradients (Q1260618) (← links)
- An interior-point algorithm for nonconvex nonlinear programming (Q1294828) (← links)
- Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming (Q1338138) (← links)
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing (Q1424286) (← links)
- Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods (Q1591484) (← links)
- Cubic regularization in symmetric rank-1 quasi-Newton methods (Q1741108) (← links)
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions (Q1856370) (← links)
- Computational experience with penalty-barrier methods for nonlinear programming (Q1915922) (← links)
- Who invented the interior-point method? (Q1946008) (← links)
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming (Q2477012) (← links)
- (Q2867318) (← links)
- (Q3314449) (← links)
- (Q3348699) (← links)
- Optimization and dynamical systems algorithms for finding equilibria of stochastic games (Q3605212) (← links)
- (Q3688121) (← links)
- Globally convergent conjugate gradient algorithms (Q3703663) (← links)
- The scale problem in robust regression<i>M</i>- estimates (Q3783370) (← links)
- Numerical experience with sequential quadratic programming algorithms for equality constrained nonlinear programming (Q3833529) (← links)
- On Variable-Metric Methods for Sparse Hessians (Q3859198) (← links)
- (Q3865853) (← links)
- Conjugate gradient methods for linearly constrained nonlinear programming (Q3934156) (← links)
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods (Q4015480) (← links)
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming (Q4018837) (← links)
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming (Q4019974) (← links)
- Implementation of a Dual Affine Interior Point Algorithm for Linear Programming (Q4020667) (← links)
- Further Development of a Primal-Dual Interior Point Method (Q4025908) (← links)
- (Q4048496) (← links)
- Effective Comparison of Unconstrained Optimization Techniques (Q4073137) (← links)
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4] (Q4082237) (← links)
- (Q4144117) (← links)
- Matrix conditioning and nonlinear optimization (Q4147882) (← links)
- Conjugate Gradient Methods with Inexact Searches (Q4184635) (← links)
- On the Convergence of a New Conjugate Gradient Algorithm (Q4196255) (← links)
- Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure (Q4202585) (← links)
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives (Q4277508) (← links)
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art (Q4291492) (← links)
- Rejoinder—The Last Word on Interior Point Methods for Linear Programming—For Now (Q4291497) (← links)
- (Q4311902) (← links)