A partitioned PSB method for partially separable unconstrained optimization problems
From MaRDI portal
Publication:1733684
DOI10.1016/j.amc.2016.06.009zbMath1410.90247OpenAlexW2503639334MaRDI QIDQ1733684
Publication date: 21 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2016.06.009
global convergencesuperlinear convergencepartially separable optimization problemspartitioned PSB methodprojected PSB method
Large-scale problems in mathematical programming (90C06) Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53)
Uses Software
Cites Work
- Unnamed Item
- Analysis of sparse quasi-Newton updates with positive definite matrix completion
- Sufficient descent directions in unconstrained optimization
- Sparse quasi-Newton updates with positive definite matrix completion
- Partitioned variable metric updates for large structured optimization problems
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- Local convergence analysis for partitioned quasi-Newton updates
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- On the Superlinear Convergence of an Algorithm for Solving a Sparse Minimization Problem
- Convergence Results for Schubert’s Method for Solving Sparse Nonlinear Equations
- Updating Quasi-Newton Matrices with Limited Storage
- On the Global Convergence of Broyden's Method
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- An Optimal Positive Definite Update for Sparse Hessian Matrices
- Trust-region interior-point method for large sparsel1optimization
- A modified BFGS method and its global convergence in nonconvex minimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: A partitioned PSB method for partially separable unconstrained optimization problems
