The method of successive affine reduction for nonlinear minimization

DOI10.1007/BF01589444zbMath0621.90076OpenAlexW1965393410MaRDI QIDQ3758575

John Lawrence Nazareth

Publication date: 1986

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01589444

zbMATH Keywords

conjugate gradientsgradient-based algorithmhigh-dimensional optimizationsuccessive affine reductionvariable storage algorithmssmooth nonlinear function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (2)

Efficient generalized conjugate gradient algorithms. II: Implementation ⋮ Preconditioned low-order Newton methods

Uses Software

• MINOS
• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conjugate Gradient Methods less Dependent on Conjugacy
• An aggregate subgradient method for nonsmooth convex minimization
• QN-like variable storage conjugate gradients
• Testing Unconstrained Optimization Software
• Quasi-Newton Methods, Motivation and Theory
• Conjugate Gradient Methods with Inexact Searches
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Note on an extension of “Davidon” methods to nondifferentiable functions
• Methods of conjugate gradients for solving linear systems

This page was built for publication: The method of successive affine reduction for nonlinear minimization