Semismooth Newton method for quadratic programs with bound constraints

DOI10.1134/S0965542509100066MaRDI QIDQ2995721zbMATH OpenFDO

Authors A. N. Daryina, A. F. Izmailov

Publication date 4 May 2011

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0965542509100066

zbMATH Keywords

variational inequalitymixed complementarity problemsemismooth Newton methodquadratic programactive-set methodcomplementarity functionnatural residualprojected gradient method.

Mathematics Subject Classification ID

Newton-type methods (49M15)

Recommendations

• A non-interior path following method for convex quadratic programming problems with bound constraints
• A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
• A New Algorithm for Solving Strictly Convex Quadratic Programs
• scientific article; zbMATH DE number 1059220
• A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming

Cited in

(6)

• A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations
• scientific article; zbMATH DE number 5937962 (Why is no real title available?)
• Semismooth Newton methods for solving semi-infinite programming problems
• A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming
• A semi‐smooth Newton method for constrained linear‐quadratic control problems
• A Feasible Semismooth Gauss-Newton Method for Solving a Class of SLCPs

This page was built for publication: Semismooth Newton method for quadratic programs with bound constraints

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