Projected Newton Methods for Optimization Problems with Simple Constraints

This publication has 15 references indexed in Scilit:

• Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
  SIAM Journal on Control and Optimization, 1980
• A computational study of active set strategies in nonlinear programming with linear constraints
  Mathematical Programming, 1979
• Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
  Mathematical Programming, 1976
• On the Goldstein-Levitin-Polyak gradient projection method
  IEEE Transactions on Automatic Control, 1976
• The Variable Reduction Method for Nonlinear Programming
  Management Science, 1970
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
  SIAM Journal on Applied Mathematics, 1969
• Communications to the Editor—Exponential Forecasting: Some New Variations
  Management Science, 1969
• Constrained minimization methods
  USSR Computational Mathematics and Mathematical Physics, 1966
• Convex programming in Hilbert space
  Bulletin of the American Mathematical Society, 1964
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
  Journal of the Society for Industrial and Applied Mathematics, 1960