An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
Heng Yang, Ling Liang, Luca Carlone, Kim-Chuan Toh
Topics & Concepts
Semidefinite programmingBroyden–Fletcher–Goldfarb–Shanno algorithmMathematicsMathematical optimizationInterior point methodRelaxation (psychology)Nonlinear programmingRank (graph theory)Robustness (evolution)Convergence (economics)PolynomialGradient descentNonlinear systemComputer scienceCombinatoricsComputer networkArtificial neural networkEconomicsAsynchronous communicationGeneMachine learningPsychologyPhysicsEconomic growthSocial psychologyMathematical analysisQuantum mechanicsChemistryBiochemistrySparse and Compressive Sensing TechniquesAdvanced Optimization Algorithms ResearchAdvanced Vision and Imaging