Trust region algorithm with two subproblems for bound constrained problems

DOI10.1016/j.amc.2014.06.074zbMath1334.90206OpenAlexW1992956333MaRDI QIDQ279647

Mingyun Tang

Publication date: 28 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.06.074

zbMATH Keywords

two subproblemstrust regionbound constrained problems

Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55)

Uses Software

• SLMQN
• CUTEr
• SifDec

Cites Work

• An active set limited memory BFGS algorithm for bound constrained optimization
• A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
• An active set limited memory BFGS algorithm for large-scale bound constrained optimization
• A trust region affine scaling method for bound constrained optimization
• Optimization theory and methods. Nonlinear programming
• A trust region method based on a new affine scaling technique for simple bounded optimization
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
• Trust Region Methods
• CUTEr and SifDec
• Using truncated conjugate gradient method in trust-region method with two subproblems and backtracking line search
• Unnamed Item
• Unnamed Item

This page was built for publication: Trust region algorithm with two subproblems for bound constrained problems