Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs

DOI10.1007/S10107-021-01684-5zbMATH Open1479.90150OpenAlexW3178052468MaRDI QIDQ2235166FDOQ2235166

Authors: Samuel Burer, Yinyu Ye 

Publication date: 20 October 2021

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-021-01684-5

Recommendations

• Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
• Corrigendum: Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
• Erratum to: ``Computational complexity of stochastic programming problems
• Comment on: ``Approximation algorithms for quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22)

Cites Work

• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs

Cited In (12)

• Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
• Erratum to: ``On the Aubin property of critical points to perturbed second-order cone programs
• Comment on: ``Approximation algorithms for quadratic programming
• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
• A correction to a result in linear programming
• Comments on ``On the indefinite quadratic fractional optimization with two quadratic constraints
• Erratum to: ``Computational complexity of stochastic programming problems
• Corrigendum to ``Solving equations via the trust region and its application to a class of stochastic linear complementarity problems [Comput. Math. Appl. 61 (2011) 1646-1664]
• A short note on strongly convex programming for exact matrix completion and robust principal component analysis
• KKT-based primal-dual exactness conditions for the Shor relaxation
• Corrigendum: Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
• Publisher's note

This page was built for publication: Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs

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