A Newton-like trust region method for large-scale unconstrained nonconvex minimization
DOI10.1155/2013/478407zbMATH Open1291.90192OpenAlexW2032089608WikidataQ58916376 ScholiaQ58916376MaRDI QIDQ2015579FDOQ2015579
Authors: Yang Weiwei, Yang Yueting, Zhang Chenhui, Cao Mingyuan 
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
Recommendations
- A new non-monotone self-adaptive trust region method for unconstrained optimization
- A new nonmonotone adaptive trust region method based on simple quadratic models
- A nonmonotone quasi-Newton trust-region method of conic model for unconstrained optimization
- scientific article; zbMATH DE number 4068627
- A new nonmonotone adaptive trust region method for unconstrained optimization problems
Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)
Cites Work
- Testing Unconstrained Optimization Software
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Numerical Optimization
- On the limited memory BFGS method for large scale optimization
- Updating Quasi-Newton Matrices with Limited Storage
- Representations of quasi-Newton matrices and their use in limited memory methods
- Trust Region Methods
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- A trust region algorithm for equality constrained optimization
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- A New Algorithm for Unconstrained Optimization
- A modified BFGS method and its global convergence in nonconvex minimization
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
- A survey of quasi-Newton equations and quasi-Newton methods for optimization
- Title not available (Why is that?)
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Cubic regularization of Newton method and its global performance
- A compact limited memory method for large scale unconstrained optimization
- Title not available (Why is that?)
- A limited-memory multipoint symmetric secant method for bound constrained optimization
- Title not available (Why is that?)
- Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
- A structured trust region method for nonconvex programming with separable structure
Cited In (4)
- A recursive trust-region method for non-convex constrained minimization
- A self-adaptive trust region method for extreme \(\mathcal {B}\)-eigenvalues of symmetric tensors
- Nonstandard Scaling Matrices for Trust Region Gauss–Newton Methods
- Faster Riemannian Newton-type optimization by subsampling and cubic regularization
Uses Software
This page was built for publication: A Newton-like trust region method for large-scale unconstrained nonconvex minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015579)
