A hybrid method for the nonlinear least squares problem with simple bounds

DOI10.1016/0377-0427(91)90023-DzbMath0742.65050MaRDI QIDQ1177199

Masao Fukushima, Nobuko Sagara

Publication date: 26 June 1992

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

zbMATH Keywords

convergence; numerical experiments; interior point method; trust region method; large scale problems; nonlinear least squares problem; active set strategy; affine-scaling; trust region constraints

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

90C06: Large-scale problems in mathematical programming

90C30: Nonlinear programming

90C20: Quadratic programming

Uses Software

• GQTPAR

Cites Work

• A modification of Karmarkar's linear programming algorithm
• Affine-scaling for linear programs with free variables
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Computing a Trust Region Step
• Algorithms for Nonlinear Least Squares with Linear Inequality Constraints
• A variable-metric variant of the Karmarkar algorithm for linear programming
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• An Algorithm for Constrained Non-Linear Least-Squares
• On Large Scale Nonlinear Least Squares Calculations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item