Using the eigenvalue relaxation for binary least-squares estimation problems (Q839052): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.sigpro.2009.04.025 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065939443 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0902.1324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of convex optimization in signal processing and digital communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming for discrete optimization and matrix completion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second-order bundle method to minimize the maximum eigenvalue function. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517108 / 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: Bounding the convergence time of the Gibbs sampler in Bayesian image restoration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3750011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxations of (0, 1)-Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpolyhedral Relaxations of Graph-Bisection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivatives and Perturbations of Eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum probability of error for asynchronous Gaussian multiple-access channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing structured tight frames via an alternating projection method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.SIGPRO.2009.04.025 / rank
 
Normal rank

Latest revision as of 04:45, 10 December 2024

scientific article
Language Label Description Also known as
English
Using the eigenvalue relaxation for binary least-squares estimation problems
scientific article

    Statements

    Using the eigenvalue relaxation for binary least-squares estimation problems (English)
    0 references
    0 references
    0 references
    1 September 2009
    0 references
    binary least squares
    0 references
    eigenvalue relaxation
    0 references
    semi-definite relaxation
    0 references
    image denoising
    0 references
    CDMA
    0 references
    multiuser detection
    0 references

    Identifiers