Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables

DOI10.1137/21m1463793zbMath1519.90151arXiv2112.03886OpenAlexW4200629722MaRDI QIDQ6161304

Shaoning Han, Jong-Shi Pang

Publication date: 27 June 2023

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.03886

zbMATH Keywords

diagonal dominanceZ-matrixquadratic programsstrong polynomiality

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Some LCPs solvable in strongly polynomial time with Lemke's algorithm
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Manifestations of the Schur complement
• Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
• The Linear Complementarity Problem
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• A Survey onM-Matrices
• A graph-based decomposition method for convex quadratic optimization with indicators

This page was built for publication: Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables