Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
From MaRDI portal
Publication:429494
DOI10.1007/S10589-011-9393-3zbMATH Open1245.90122DBLPjournals/coap/GrattonMT12OpenAlexW1995294269WikidataQ58185718 ScholiaQ58185718MaRDI QIDQ429494FDOQ429494
Authors: Serge Gratton, Vincent Malmedy, Philippe L. Toint 
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-011-9393-3
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
- Algorithm 851
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- On the limited memory BFGS method for large scale optimization
- Updating Quasi-Newton Matrices with Limited Storage
- Function minimization by conjugate gradients
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- Conditioning of Quasi-Newton Methods for Function Minimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Methods of conjugate gradients for solving linear systems
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- A multigrid approach to discretized optimization problems
- A survey of nonlinear conjugate gradient methods
- An efficient hybrid conjugate gradient method for unconstrained optimization
- Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization
- Approximate invariant subspaces and quasi-Newton optimization methods
- A recursive Formula-trust-region method for bound-constrained nonlinear optimization
- Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
Cited In (5)
- Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
- Approximate invariant subspaces and quasi-Newton optimization methods
- Approximating Hessians in unconstrained optimization arising from discretized problems
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems
- Using inexact gradients in a multilevel optimization algorithm
Uses Software
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)
