The method of successive affine reduction for nonlinear minimization

DOI10.1007/BF01589444zbMATH Open0621.90076OpenAlexW1965393410MaRDI QIDQ3758575FDOQ3758575

J. L. 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)

Cites Work

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

Cited In (4)

• Efficient generalized conjugate gradient algorithms. II: Implementation
• Hierarchical gradient methods for nonlinear LSQ problems
• Slide reduction, successive minima and several~applications
• Preconditioned low-order Newton methods

Uses Software

• MINOS
• minpack

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758575)