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