Quadratic programming with M-matrices

DOI10.1016/0024-3795(80)90095-6MaRDI QIDQ1152695zbMATH OpenOpenAlexWikidataFDO

Authors Franklin T. Luk, Marcello Pagano

Publication date 1980

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/7510

zbMATH Keywords

large sparse M-matrixlinear complementarity problemmodified algorithmsnumerical examples

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites work

• scientific article; zbMATH DE number 3718852 (Why is no real title available?)
• scientific article; zbMATH DE number 3557157 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• scientific article; zbMATH DE number 3216614 (Why is no real title available?)
• Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
• On the Approximate Solution of Free Boundary Problems Using Finite Differences
• On the convergence of a basic iterative method for the implicit complementarity problem
• Some algorithms solving the unilateral Dirichlet problem with two constraints
• Sur des méthodes d'optimisation par relaxation

Cited in

(4)

• Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
• On the connectedness of the solution set to linear complementarity systems
• Strong formulations for quadratic optimization with M-matrices and indicator variables
• An equivalence between two algorithms for a class of quadratic programming problems withmmatrices^*

This page was built for publication: Quadratic programming with M-matrices

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