Semidefinite relaxations of dynamical programs under discrete constraints (Q601981): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Sostools / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GloptiPoly / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-010-0184-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076833298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric optimization and optimal control using algebraic geometry methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry groups, semidefinite programs, and sums of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive polynomials in control. / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3955520 / 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: Polynomials nonnegative on a grid and discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming vs. LP Relaxations for Polynomial Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sum of Squares Approximation of Nonnegative Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite programming approach to the generalized problem of moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4464677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of moments in global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternative approach for nonlinear optimal control problems based on the method of moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations and algebraic optimization in control / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOSTOOLS and Its Control Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Control Synthesis by Convex Optimization / rank
 
Normal rank

Latest revision as of 10:18, 3 July 2024

scientific article
Language Label Description Also known as
English
Semidefinite relaxations of dynamical programs under discrete constraints
scientific article

    Statements

    Semidefinite relaxations of dynamical programs under discrete constraints (English)
    0 references
    0 references
    0 references
    29 October 2010
    0 references
    0 references
    integer programming
    0 references
    method of moments
    0 references
    chess
    0 references
    inventory problem
    0 references
    0 references
    0 references
    0 references
    0 references