Hybrid methods for minimizing least-distance functions with semi-definite matrix constraints
From MaRDI portal
Publication:2751273
zbMATH Open0980.65060MaRDI QIDQ2751273
Publication date: 21 October 2001
convergencenumerical resultssequential quadratic programmingnonlinear minimization problemconstrained least-distance problem
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Quadratic programming (90C20)
Related Items (1)
This page was built for publication: Hybrid methods for minimizing least-distance functions with semi-definite matrix constraints