A Newton-like trust region method for large-scale unconstrained nonconvex minimization
From MaRDI portal
Publication:2015579
DOI10.1155/2013/478407zbMath1291.90192OpenAlexW2032089608WikidataQ58916376 ScholiaQ58916376MaRDI QIDQ2015579
Zhang Chenhui, Yang Weiwei, Cao Mingyuan, Yang Yueting
Publication date: 23 June 2014
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/478407
Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)
Related Items
A self-adaptive trust region method for extreme \(\mathcal {B}\)-eigenvalues of symmetric tensors ⋮ Faster Riemannian Newton-type optimization by subsampling and cubic regularization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- A compact limited memory method for large scale unconstrained optimization
- On the limited memory BFGS method for large scale optimization
- A trust region algorithm for equality constrained optimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- A limited-memory multipoint symmetric secant method for bound constrained optimization
- A structured trust region method for nonconvex programming with separable structure
- Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
- Cubic regularization of Newton method and its global performance
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- Testing Unconstrained Optimization Software
- Updating Quasi-Newton Matrices with Limited Storage
- Numerical Optimization
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- Trust Region Methods
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- A New Algorithm for Unconstrained Optimization
- A modified BFGS method and its global convergence in nonconvex minimization
- A survey of quasi-Newton equations and quasi-Newton methods for optimization
This page was built for publication: A Newton-like trust region method for large-scale unconstrained nonconvex minimization