A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
From MaRDI portal
Publication:4229473
DOI10.1137/S1052623495297820zbMath0997.90056OpenAlexW1968052917MaRDI QIDQ4229473
Kaj Madsen, Hans Bruun Nielsen, Mustafa Çelebi Pinar
Publication date: 22 February 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623495297820
robust regressionLagrangian dualitybound constrained quadratic programmingHuber's M-estimatorlinear \(\ell_1\) estimation
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Sparse solutions to an underdetermined system of linear equations via penalized Huber loss ⋮ Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces ⋮ Computing upper and lower bounds in interval decision trees ⋮ Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense ⋮ A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming ⋮ A finite newton method for classification ⋮ A hybrid algorithm for solving linear inequalities in a least squares sense ⋮ An exterior point polynomial-time algorithm for convex quadratic programming
Uses Software
This page was built for publication: A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
