A structured quasi-Newton algorithm for optimizing with incomplete Hessian information
DOI10.1137/18M1167942zbMATH Open1411.90358OpenAlexW2937637171WikidataQ128070022 ScholiaQ128070022MaRDI QIDQ4634097FDOQ4634097
Authors: Cosmin Petra, Nai-Yuan Chiang, Mihai Anitescu 
Publication date: 7 May 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1167942
Recommendations
- A modified quasi-Newton method for structured optimization with partial information on the Hessian
- A new structured quasi-Newton algorithm using partial information on Hessian
- On the Derivation of Quasi-Newton Formulas for Optimization in Function Spaces
- Structured symmetric rank-one method for unconstrained optimization
- New quasi-Newton methods for unconstrained optimization problems
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Cites Work
- Local convergence analysis for partitioned quasi-Newton updates
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- CUTEr and SifDec
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Line search algorithms with guaranteed sufficient decrease
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Representations of quasi-Newton matrices and their use in limited memory methods
- Quasi-Newton Methods, Motivation and Theory
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Variable metric methods for unconstrained optimization and nonlinear least squares
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
- Convergence Theorems for Least-Change Secant Update Methods
- On Secant Updates for Use in General Constrained Optimization
- An Optimal Positive Definite Update for Sparse Hessian Matrices
- A new structured quasi-Newton algorithm using partial information on Hessian
- Exploiting additional structure in equality constrained optimization by structured SQP secant algorithms
- Duality in quasi-Newton methods and new variational characterizations of the DFP and BFGS updates
Cited In (6)
- ALADIN‐—An open‐source MATLAB toolbox for distributed non‐convex optimization
- Newton-type methods for non-convex optimization under inexact Hessian information
- On the implementation of a quasi-Newton interior-point method for PDE-constrained optimization using finite element discretizations
- Compact representations of structured BFGS matrices
- A modified quasi-Newton method for structured optimization with partial information on the Hessian
- A new structured quasi-Newton algorithm using partial information on Hessian
Uses Software
This page was built for publication: A structured quasi-Newton algorithm for optimizing with incomplete Hessian information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634097)
