Exact relaxations of non-convex variational problems
From MaRDI portal
Publication:941046
DOI10.1007/s11590-008-0077-6zbMath1143.49026OpenAlexW1977032668MaRDI QIDQ941046
Publication date: 4 September 2008
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-008-0077-6
Related Items
Infinitely many solutions for a double Sturm-Liouville problem ⋮ Duality for optimization problems in Banach algebras ⋮ Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems ⋮ A Modified Split Bregman Algorithm for Computing Microstructures Through Young Measures
Uses Software
Cites Work
- Analysis of microstructures and phase transition phenomena in one-dimensional, non-linear elasticity by convex optimization
- Problème des moments sur un compact de \({\mathbb{R}}^ n\) et décomposition de polynômes a plusieurs variables
- A semidefinite programming approach to the generalized problem of moments
- The \(K\)-moment problem for compact semi-algebraic sets
- Parametrized measures and variational principles
- The method of moments in global optimization
- Semidefinite programming relaxations for semialgebraic problems
- Positive polynomials in control.
- Duality theorems and algorithms for linear programming in measure spaces
- From a nonlinear, nonconvex variational problem to a linear, convex formulation
- Numerical analysis of oscillations in multiple well problems
- 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
- Lectures on Modern Convex Optimization
- Polynomials nonnegative on a grid and discrete optimization
- SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems
- SOSTOOLS and Its Control Applications
- Solution of the truncated complex moment problem for flat data
- Semidefinite Programming
- Variational Methods in Nonlinear Elasticity
- The truncated complex $K$-moment problem
- Polynomial Programming: LP-Relaxations Also Converge
- Parametric optimization and optimal control using algebraic geometry methods
- GloptiPoly
- Revisiting two theorems of Curto and Fialkow on moment matrices
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set
- A Sum of Squares Approximation of Nonnegative Polynomials
- Convex Analysis
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- Direct methods in the calculus of variations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
