A new method of moving asymptotes for large-scale unconstrained optimization

DOI10.1016/j.amc.2008.03.035zbMath1159.65066OpenAlexW2013780395MaRDI QIDQ2518690

Qin Ni, Hai-Jun Wang

Publication date: 16 January 2009

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

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

zbMATH Keywords

algorithmunconstrained optimizationconvergencemethod of moving asymptoteslinear searchnumerical experimentationtrust regionlarge scale optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items (5)

A new direct search method based on separable fractional interpolation model ⋮ A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems ⋮ A new method of moving asymptotes for large-scale linearly equality-constrained minimization ⋮ A CONVEX APPROXIMATION METHOD FOR LARGE SCALE LINEAR INEQUALITY CONSTRAINED MINIMIZATION ⋮ A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem

Uses Software

• CUTEr
• CUTE

Cites Work

• Unnamed Item
• Optimization theory and methods. Nonlinear programming
• The method of moving asymptotes—a new method for structural optimization
• CUTE
• A globally convergent method of moving asymptotes with trust region technique
• Global convergence of a nonlinear programming method using convex approximations

This page was built for publication: A new method of moving asymptotes for large-scale unconstrained optimization