On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- 1 October 1994
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 67 (1-3) , 189-224
- https://doi.org/10.1007/bf01582221
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A Globally Convergent Method for $l_p $ ProblemsSIAM Journal on Optimization, 1993
- Algorithms for bound constrained quadratic programming problemsNumerische Mathematik, 1989
- Testing a class of methods for solving minimization problems with simple bounds on the variablesMathematics of Computation, 1988
- A modification of karmarkar's linear programming algorithmAlgorithmica, 1986
- Solving the minimal least squares problem subject to bounds on the variablesBIT Numerical Mathematics, 1984
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problemsLinear Algebra and its Applications, 1980
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper BoundsIMA Journal of Applied Mathematics, 1974
- Iterative Solution of Nonlinear Equations in Several VariablesMathematics of Computation, 1971
- Minimization of functions having Lipschitz continuous first partial derivativesPacific Journal of Mathematics, 1966
- On Steepest DescentJournal of the Society for Industrial and Applied Mathematics Series A Control, 1965