Global minimization of polynomial integral functionals

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Linear functional analysis. An application-oriented introduction. Translated from the 6th German edition by Robert Nürnberg
Local minimization, variational evolution and $\Gamma$-convergence
Optimality conditions and finite convergence of Lasserre's hierarchy
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Semidefinite programming relaxations for semialgebraic problems
Solving a class of semidefinite programs via nonlinear programming
Higher-order quasiconvexity reduces to quasiconvexity
Maximum cardinality search for computing minimal triangulations of graphs
Theory and practice of finite elements.
The empirical Christoffel function with applications in data analysis
Semi-algebraic approximation using Christoffel-Darboux kernel
A brief introduction to PDE-constrained optimization
A note on the representation of positive polynomials with structured sparsity
Local minima and convergence in low-rank semidefinite programming
Global Optimization with Polynomials and the Problem of Moments
Solutions of polynomial systems derived from the steady cavity flow problem
An Introduction to Polynomial and Semi-Algebraic Optimization
Bilayer Plates: Model Reduction, Γ-Convergent Finite Element Approximation, and Discrete Gradient Flow
Minimizers and gradient flows for singularly perturbed bi-stable potentials with a Dirichlet condition
A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis
Finite element simulation of nonlinear bending models for thin elastic rods and plates
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Optimization with PDE Constraints
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
Some NP-complete problems in quadratic and nonlinear programming
Computing the Minimum Fill-In is NP-Complete
Sum-of-Squares Optimization without Semidefinite Programming
Semidefinite Programming
Variational Methods in Nonlinear Elasticity
Rank Optimality for the Burer--Monteiro Factorization
Approximations of Energy Minimization in Cell-Induced Phase Transitions of Fibrous Biomaterials: $\Gamma$-Convergence Analysis
Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
A New Sparse SOS Decomposition Algorithm Based on Term Sparsity
TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
Numerical Solution of a Föppl--von Kármán Model
A Simplified Calculation of Reduced HCT--Basis Functions in a Finite Element Context
The Mathematical Theory of Finite Element Methods
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
Deflation Techniques for Finding Distinct Solutions of Nonlinear Partial Differential Equations
Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
Calculus of variations
Direct methods in the calculus of variations
Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization
Occupation measure relaxations in variational problems: the role of convexity
CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization

This page was built for publication: Global minimization of polynomial integral functionals