Semidefinite relaxations of dynamical programs under discrete constraints

DOI10.1007/s11590-010-0184-zzbMath1202.90268OpenAlexW2076833298MaRDI QIDQ601981

Camilo Ortiz, René J. 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

zbMATH Keywords

chessinteger programmingmethod of momentsinventory problem

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (1)

On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming

Uses Software

• Sostools
• SeDuMi
• GloptiPoly

Cites Work

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

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