Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems
DOI10.1080/01630560903574985zbMath1196.49025OpenAlexW2126506455MaRDI QIDQ3590027
René J. Meziat, Tomáš Roubíček, Diego Patino
Publication date: 17 September 2010
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630560903574985
Semidefinite programming (90C22) Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Discrete approximations in optimal control (49M25) PDEs in connection with control and optimization (35Q93)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of microstructures and phase transition phenomena in one-dimensional, non-linear elasticity by convex optimization
- Linear-programming approach to nonconvex variational problems
- Problème des moments sur un compact de \({\mathbb{R}}^ n\) et décomposition de polynômes a plusieurs variables
- Exact relaxations of non-convex variational problems
- A semidefinite programming approach to the generalized problem of moments
- The \(K\)-moment problem for compact semi-algebraic sets
- Gradient Young measures generated by sequences in Sobolev spaces
- Adaptive finite element methods for microstructures? Numerical experiments for a 2-well benchmark
- The method of moments in global optimization
- Semidefinite programming relaxations for semialgebraic problems
- Ten remarks on nonconvex minimisation for phase transition simulations
- From a nonlinear, nonconvex variational problem to a linear, convex formulation
- Higher-order convex approximations of Young measures in optimal control
- Symmetry groups, semidefinite programs, and sums of squares
- On the numerical analysis of non-convex variational problems
- Numerical approximation of Young measures in non-convex variational problems
- Semidefinite programming relaxations and algebraic optimization in control
- Global Optimization with Polynomials and the Problem of Moments
- Distinguished representations of strictly positive polynomials
- Lectures on Modern Convex Optimization
- SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems
- Numerical Approach to Double Well Problems
- Numerical solution of the scalar double-well problem allowing microstructure
- PENNON: A code for convex nonlinear and semidefinite programming
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
- Adaptive Approximation of Young Measure Solutions in Scalar Nonconvex Variational Problems
- NUMERICAL SOLUTION OF A CLASS OF NON-CONVEX VARIATIONAL PROBLEMS BY SQP
- Numerical approximation of parametrized measures
- Approximation theory for generalized young measures
- The truncated complex $K$-moment problem
- 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
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- Direct methods in the calculus of variations
- Mathematical control theory: an introduction
- A refinement on existence results in nonconvex optimal control
- Young measure approximation in micromagnetics
This page was built for publication: Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems
