A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems
DOI10.1137/16M1109060zbMath1398.90118OpenAlexW2781517632MaRDI QIDQ4600837
Publication date: 17 January 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1109060
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Numerical computation of solutions to systems of equations (65H10) Approximation methods and heuristics in mathematical programming (90C59) Interior-point methods (90C51) Boundary value problems for nonlinear higher-order PDEs (35G30) Finite difference methods for boundary value problems involving PDEs (65N06) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semidefinite programming relaxations for semialgebraic problems
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- A rigorous global optimization algorithm for problems with ordinary differential equations
- Algorithmic graph theory and perfect graphs
- Global Optimization with Polynomials and the Problem of Moments
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- Solutions of polynomial systems derived from the steady cavity flow problem
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Computational Optimization of Systems Governed by Partial Differential Equations
- MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization
- Newton-Type Minimization via the Lanczos Method
- Optimization with PDE Constraints
- A Line Search Multigrid Method for Large-Scale Nonlinear Optimization
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- Multigrid Methods for PDE Optimization
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Testing Unconstrained Optimization Software
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- Accuracy and Convergence Properties of the Finite Difference Multigrid Solution of an Optimal Control Optimality System
- A Multigrid Tutorial, Second Edition
- The Euler approximation in state constrained optimal control
- A multigrid approach to discretized optimization problems
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Singularly Perturbed Markov Decision Processes: A Multiresolution Algorithm
- Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
This page was built for publication: A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems
