Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
From MaRDI portal
(Redirected from Publication:429494)
Recommendations
- Approximate invariant subspaces and quasi-Newton optimization methods
- Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems
- Multilevel least-change Newton-like methods for equality constrained optimization problems
- New quasi-Newton methods for unconstrained optimization problems
- Inexact Secant Methods for Nonlinear Constrained Optimization
Cites work
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- A Family of Variable-Metric Methods Derived by Variational Means
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A multigrid approach to discretized optimization problems
- A new approach to variable metric algorithms
- A recursive Formula-trust-region method for bound-constrained nonlinear optimization
- A survey of nonlinear conjugate gradient methods
- Algorithm 851
- An efficient hybrid conjugate gradient method for unconstrained optimization
- Approximate invariant subspaces and quasi-Newton optimization methods
- Benchmarking optimization software with performance profiles.
- Conditioning of Quasi-Newton Methods for Function Minimization
- Function minimization by conjugate gradients
- Methods of conjugate gradients for solving linear systems
- Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization
- On the limited memory BFGS method for large scale optimization
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Updating Quasi-Newton Matrices with Limited Storage
- Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
Cited in
(7)- Approximate invariant subspaces and quasi-Newton optimization methods
- Newton-type multilevel optimization method
- Approximating Hessians in unconstrained optimization arising from discretized problems
- Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
- Using inexact gradients in a multilevel optimization algorithm
- On high-order multilevel optimization strategies
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems
This page was built for publication: Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429494)
