Semidefinite relaxations of dynamical programs under discrete constraints

DOI10.1007/S11590-010-0184-ZzbMATH Open1202.90268OpenAlexW2076833298MaRDI QIDQ601981FDOQ601981

Authors: Camilo Ortiz, René Meziat 

Publication date: 29 October 2010

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0184-z

Recommendations

• Semidefinite relaxations for integer programming
• Semidefinite relaxation for linear programs with equilibrium constraints
• Semidefinite programming relaxations for semialgebraic problems
• Exploiting semidefinite relaxations in constraint programming
• Semidefinite programming and constraint programming
• Solving semidefinite programs via discretization method for solving semiinfinite programming problems
• On semidefinite programming relaxations for the satisfiability problem
• Relaxations of the satisfiability problem using semidefinite programming
• Relaxations of the satisfiability problem using semidefinite programming
• Semidefinite optimization in discrepancy theory

zbMATH Keywords

method of momentschessinteger programminginventory problem

Mathematics Subject Classification ID

Dynamic programming (90C39)

Cites Work

• Global optimization with polynomials and the problem of moments
• GloptiPoly
• Symmetry groups, semidefinite programs, and sums of squares
• Title not available (Why is that?)
• Nonlinear Control Synthesis by Convex Optimization
• Semidefinite Programming vs. LP Relaxations for Polynomial Programming
• A semidefinite programming approach to the generalized problem of moments
• SOSTOOLS and Its Control Applications
• Title not available (Why is that?)
• Positive polynomials in control.
• Title not available (Why is that?)
• The method of moments in global optimization
• A Sum of Squares Approximation of Nonnegative Polynomials
• Title not available (Why is that?)
• An alternative approach for nonlinear optimal control problems based on the method of moments
• Semidefinite programming relaxations and algebraic optimization in control
• Polynomials nonnegative on a grid and discrete optimization
• Parametric optimization and optimal control using algebraic geometry methods

Cited In (4)

• On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming
• Time-Varying Semidefinite Programs
• Trajectory generation for the unicycle model using semidefinite relaxations
• Immediate schedule adjustment and semidefinite relaxation

Uses Software

• Sostools
• SeDuMi
• GloptiPoly

This page was built for publication: Semidefinite relaxations of dynamical programs under discrete constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q601981)