Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (Q2354819): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CSDP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036542402 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1403.4806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly 3: moments, optimization and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / 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: GloptiPoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally optimal estimates for geometric reconstruction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4445267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Interval Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimisation globale et théorie des moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / 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: Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank

Latest revision as of 14:06, 10 July 2024

scientific article
Language Label Description Also known as
English
Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
scientific article

    Statements

    Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 July 2015
    0 references
    global optimization
    0 references
    linear matrix inequality
    0 references
    fundamental matrix
    0 references
    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
    0 references