An algorithm for computing nonnegative minimal norm solutions

DOI10.1080/01630569408816552zbMath0811.65033OpenAlexW2154840230MaRDI QIDQ4291888

P. V. Nikolopoulos, V. P. Sreedharan

Publication date: 22 June 1994

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630569408816552

zbMATH Keywords

algorithmglobal convergencenumerical experimentsdualityquadratic programming problemnonnegative, minimal norm solution

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items (3)

A least distance algorithm for a smooth strictly convex norm ⋮ An Algorithm For A Minimum Norm Solution Of A System Of Linear Inequalities ⋮ An algorithm for non—negative least error minimal norm solutions

Cites Work

• Unnamed Item
• Unnamed Item
• Extensions of subgradient projection algorithms
• \(\epsilon\)-subgradient projection algorithm
• Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
• Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
• An algorithm for non-negative norm minimal solutions

This page was built for publication: An algorithm for computing nonnegative minimal norm solutions