A Finite Continuation Algorithm for Bound Constrained Quadratic Programming

DOI10.1137/S1052623495297820MaRDI QIDQ4229473zbMATH OpenOpenAlexFDO

Authors Kaj Madsen, H. B. Nielsen, Mustafa Ç. Pınar

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

zbMATH Keywords

robust regressionLagrangian dualitybound constrained quadratic programmingHuber's M-estimatorlinear \(\ell_1\) estimation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Interior-point methods (90C51)

Recommendations

• Bound constrained quadratic programming via piecewise quadratic functions
• A New Finite Continuation Algorithm for Linear Programming
• A numerically stable dual method for solving strictly convex quadratic programs
• On the Solution of Large Quadratic Programming Problems with Bound Constraints
• Algorithms for bound constrained quadratic programming problems

Cited in

(14)

• A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming
• A hybrid algorithm for solving linear inequalities in a least squares sense
• scientific article; zbMATH DE number 4003917 (Why is no real title available?)
• Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
• scientific article; zbMATH DE number 3928729 (Why is no real title available?)
• scientific article; zbMATH DE number 4104797 (Why is no real title available?)
• A finite newton method for classification
• Continuous Approaches to the Unconstrained Binary Quadratic Problems
• Computing upper and lower bounds in interval decision trees
• Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces
• A continuation approach for solving binary quadratic program based on a class of NCP-functions
• Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense
• An exterior point polynomial-time algorithm for convex quadratic programming
• A New Finite Continuation Algorithm for Linear Programming

Describes a project that uses

Uses Software

• AAFAC
• LSSOL

This page was built for publication: A Finite Continuation Algorithm for Bound Constrained Quadratic Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229473)