A multigrid approach to SDP relaxations of sparse polynomial optimization problems
From MaRDI portal
Publication:4600837
Approximation methods and heuristics in mathematical programming (90C59) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Nonconvex programming, global optimization (90C26) Interior-point methods (90C51) Semidefinite programming (90C22) Numerical computation of solutions to systems of equations (65H10) Finite difference methods for boundary value problems involving PDEs (65N06) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Boundary value problems for nonlinear higher-order PDEs (35G30)
Recommendations
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
- Convergent SDP-relaxations for polynomial optimization with sparsity
- Regularization methods for SDP relaxations in large-scale polynomial optimization
Cites work
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- A Line Search Multigrid Method for Large-Scale Nonlinear Optimization
- A Multigrid Tutorial, Second Edition
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- A multigrid approach to discretized optimization problems
- A rigorous global optimization algorithm for problems with ordinary differential equations
- Accuracy and Convergence Properties of the Finite Difference Multigrid Solution of an Optimal Control Optimality System
- Algorithmic graph theory and perfect graphs
- An introduction to polynomial and semi-algebraic optimization
- Computational optimization of systems governed by partial differential equations
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Global optimization with polynomials and the problem of moments
- MAGMA: multilevel accelerated gradient mirror descent algorithm for large-scale convex composite minimization
- Multigrid Methods for PDE Optimization
- Newton-Type Minimization via the Lanczos Method
- Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- Optimization with PDE Constraints
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- Semidefinite programming relaxations for semialgebraic problems
- Singularly perturbed Markov decision processes: a multiresolution algorithm
- Solutions of polynomial systems derived from the steady cavity flow problem (extended abstract).
- Solving partial differential equations via sparse SDP relaxations
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Testing Unconstrained Optimization Software
- The Euler approximation in state constrained optimal control
Cited in
(7)- Regularization methods for SDP relaxations in large-scale polynomial optimization
- A multilevel analysis of the Lasserre hierarchy
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Solving Large Sparse Nonlinear Programs Using GRG
- Partial Lasserre relaxation for sparse Max-Cut
- Solving partial differential equations via sparse SDP relaxations
- Newton-type multilevel optimization method
This page was built for publication: A multigrid approach to SDP relaxations of sparse polynomial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600837)
