Numerical study of some feasible direction methods in mathematical programming

DOI10.1007/BF00934629zbMath0487.65036MaRDI QIDQ1165559

A. Laratta, Ornella Menchi, Mario Arioli

Publication date: 1983

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

rate of convergencelinear least squaresfeasible directionsGauss-Jordan factorizationHouseholder orthogonal factorization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the rate of convergence of some feasible direction algorithms
• A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
• Numerical methods for solving linear least squares problems
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• On the stability of Gauss-Jordan elimination with pivoting
• A stable method for solving certain constrained least squares problems
• Rate of Convergence of a Class of Methods of Feasible Directions
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• On the Numerical Solution of Constrained Least-Squares Problems

This page was built for publication: Numerical study of some feasible direction methods in mathematical programming