Global minimization of polynomial integral functionals

DOI10.1137/23M1592584zbMATH Open1543.49022MaRDI QIDQ6573176FDOQ6573176

Authors: Giovanni Fantuzzi, Federico Fuentes

Publication date: 16 July 2024

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Recommendations

Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization
scientific article; zbMATH DE number 1984325
Global optimization with polynomials and the problem of moments
Exact relaxations of non-convex variational problems
A new hierarchy of SDP-relaxations for polynomial programming

convex relaxation calculus of variations finite element method sparse polynomial optimization global minimization moment-SOS hierarchy

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical methods of relaxation type (49M20) Polynomial optimization (90C23)

Cites Work

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Semidefinite Programming
Some NP-complete problems in quadratic and nonlinear programming
Theory and practice of finite elements.
Global optimization with polynomials and the problem of moments
Infinite-dimensional dynamical systems. An introduction to dissipative parabolic PDEs and the theory of global attractors
The finite element methods for elliptic problems.
Minimizers and gradient flows for singularly perturbed bi-stable potentials with a Dirichlet condition
Optimization with PDE Constraints
Title not available (Why is that?)
The Mathematical Theory of Finite Element Methods
Direct methods in the calculus of variations
Semidefinite programming relaxations for semialgebraic problems
Moments, positive polynomials and their applications
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
Local minimization, variational evolution and \(\Gamma\)-convergence
Title not available (Why is that?)
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
Local minima and convergence in low-rank semidefinite programming
Variational Methods in Nonlinear Elasticity
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Optimality conditions and finite convergence of Lasserre's hierarchy
Title not available (Why is that?)
Advances in convex optimization: conic programming
Linear functional analysis. An application-oriented introduction. Translated from the 6th German edition by Robert Nürnberg
Computing the Minimum Fill-In is NP-Complete
An introduction to polynomial and semi-algebraic optimization
A note on the representation of positive polynomials with structured sparsity
Higher-order quasiconvexity reduces to quasiconvexity
Maximum cardinality search for computing minimal triangulations of graphs
Polynomial optimization, sums of squares, and applications
A simplified calculation of reduced HCT-basis funtions in a finite element context
Solving a class of semidefinite programs via nonlinear programming
Solving partial differential equations via sparse SDP relaxations
Title not available (Why is that?)
Finite element simulation of nonlinear bending models for thin elastic rods and plates
A brief introduction to PDE-constrained optimization
Calculus of variations
Numerical solution of a Föppl-von Kármán model
Deflation techniques for finding distinct solutions of nonlinear partial differential equations
Bilayer plates: model reduction, \(\gamma\)-convergent finite element approximation, and discrete gradient flow
Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs
The empirical Christoffel function with applications in data analysis
A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
Semi-algebraic approximation using Christoffel-Darboux kernel
TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
Sum-of-squares optimization without semidefinite programming
A new sparse SOS decomposition algorithm based on term sparsity
Solutions of polynomial systems derived from the steady cavity flow problem (extended abstract).
Rank optimality for the Burer-Monteiro factorization
Approximations of energy minimization in cell-induced phase transitions of fibrous biomaterials: \(\Gamma\)-convergence analysis
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

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