An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Exact Recovery in the Stochastic Block Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5433140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity and nondegeneracy in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypercontractivity, sum-of-squares proofs, and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Optimization and Convex Algebraic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manopt, a Matlab toolbox for optimization on manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase Retrieval via Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the local stability of semidefinite relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Splitting Methods in Signal Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimizing over a simplex, hypercube or sphere: a short survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sum-of-squares hierarchy on the sphere and applications in quantum information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the partition function of the Sherrington-Kirkpatrick model is hard on average / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite programming approach to the quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection Methods in Conic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the nearest correlation matrix--a problem from finance / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong duality in lasserre's hierarchy for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representations for finite varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual Approach to Semidefinite Least-Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization Methods for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clarke generalized Jacobian of the projection onto the cone of positive semidefinite matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured low-rank approximation and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software for weighted structured low-rank approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overview of total least-squares methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3597151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Optimization with Real Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions and finite convergence of Lasserre's hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Low-Rank Semidefinite Programming for Certifiably Correct Machine Perception / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Least Norm Formulation and Solution for Structured Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual quadratic estimates in polynomial and Boolean programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tightness of SDP relaxations of QCQPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Linear Quadratic Regulator of Switched Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-CG Augmented Lagrangian Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal decomposition in operator-splitting methods for sparse semidefinite programs / rank
 
Normal rank

Revision as of 11:04, 2 August 2024

scientific article; zbMATH DE number 7720812
Language Label Description Also known as
English
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
scientific article; zbMATH DE number 7720812

    Statements

    An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 August 2023
    0 references
    semidefinite programming
    0 references
    polynomial optimization
    0 references
    inexact projected gradient method
    0 references
    rank-one solutions
    0 references
    nonlinear programming
    0 references
    degeneracy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references