On solving a non-convex quadratic programming problem involving resistance distances in graphs

DOI10.1007/S10479-018-3018-5MaRDI QIDQ2177791zbMATH OpenOpenAlexFDO

Authors Dipti Dubey, S. K. Neogy

Publication date 6 May 2020

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-018-3018-5

zbMATH Keywords

Laplacian matrixresistance distancepolynomial time algorithmsymmetric bimatrix gamenon-convex quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Programming involving graphs or networks (90C35) Nonconvex programming, global optimization (90C26)

Recommendations

• On a quadratic programming problem involving distances in trees
• Quadratic Matrix Programming
• scientific article; zbMATH DE number 2116355
• On solving matrix quadratic programming problems
• A solvable case of quadratic 0-1 programming

Cites work

• scientific article; zbMATH DE number 5784188 (Why is no real title available?)
• scientific article; zbMATH DE number 5784227 (Why is no real title available?)
• scientific article; zbMATH DE number 2116355 (Why is no real title available?)
• scientific article; zbMATH DE number 2121250 (Why is no real title available?)
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A clique algorithm for standard quadratic programming
• A polynomial-time algorithm for a class of linear complementarity problems
• Average distance in weighted graphs
• Bimatrix Equilibrium Points and Mathematical Programming
• Finite metric spaces of strictly negative type
• Identities for minors of the Laplacian, resistance and distance matrices
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
• On a quadratic programming problem involving distances in trees
• Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different Aspects
• Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm
• Two-person nonzero-sum games and quadratic programming

Cited in

(1)

• Variance and covariance of distributions on graphs

This page was built for publication: On solving a non-convex quadratic programming problem involving resistance distances in graphs

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