The method of successive affine reduction for nonlinear minimization
From MaRDI portal
Publication:3758575
Recommendations
Cites work
- scientific article; zbMATH DE number 3864392 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3453051 (Why is no real title available?)
- An aggregate subgradient method for nonsmooth convex minimization
- Conjugate Gradient Methods less Dependent on Conjugacy
- Conjugate Gradient Methods with Inexact Searches
- Methods of conjugate gradients for solving linear systems
- Note on an extension of “Davidon” methods to nondifferentiable functions
- Projected Newton Methods for Optimization Problems with Simple Constraints
- QN-like variable storage conjugate gradients
- Quasi-Newton Methods, Motivation and Theory
- Testing Unconstrained Optimization Software
Cited in
(5)- Hierarchical gradient methods for nonlinear LSQ problems
- scientific article; zbMATH DE number 4109975 (Why is no real title available?)
- Preconditioned low-order Newton methods
- Efficient generalized conjugate gradient algorithms. II: Implementation
- Slide reduction, successive minima and several~applications
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)