Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022

DOI10.4171/owr/2022/20zbMath1519.00018OpenAlexW4365459091MaRDI QIDQ6170529

No author found.

Publication date: 10 August 2023

Published in: Oberwolfach Reports (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/owr/2022/20

Mathematics Subject Classification ID

Semidefinite programming (90C22) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Collections of abstracts of lectures (00B05) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Mathematical programming (90Cxx) Graph theory (05Cxx) Real algebraic and real-analytic geometry (14Pxx) Computer assisted proofs of proofs-by-exhaustion type (68V05)

Cites Work

• An optimal gradient method for smooth strongly convex minimization
• On the effective Putinar's Positivstellensatz and moment approximation
• Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming
• Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Amoebas, nonnegative polynomials and sums of squares supported on circuits
• Optimized first-order methods for smooth convex minimization
• Sphere packing bounds via spherical codes
• Global injectivity and multiple equilibria in uni- and bi-molecular reaction networks
• Relative entropy optimization and its applications
• Smooth strongly convex interpolation and exact worst-case performance of first-order methods
• Stability and performance verification of optimization-based controllers
• Sums of squares of polynomials with rational coefficients
• Signomial and polynomial optimization via relative entropy and partial dualization
• On the convergence rate of the Halpern-iteration
• On the complexity of Putinar's Positivstellensatz
• Symmetry in semidefinite programs
• Stability of a 4th-order curvature condition arising in optimal transport theory
• Optimality and uniqueness of the \((4,10,1/6)\) spherical code
• Lower bounds for measurable chromatic numbers
• Relaxations of vertex packing
• Forms derived from the arithmetic-geometric inequality
• Relaxation of optimal control problems to equivalent convex programs
• Expressing combinatorial optimization problems by linear programs
• On Sperner families satisfying an additional condition
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• An exact duality theory for semidefinite programming and its complexity implications
• New upper bounds on sphere packings. I
• On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
• Symmetric sums of squares over \(k\)-subset hypercubes
• Symmetry groups, semidefinite programs, and sums of squares
• Average kissing numbers for non-congruent sphere packings
• How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
• Conic programming: infeasibility certificates and projective geometry
• A simplex algorithm for rational cp-factorization
• Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions
• Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares
• Newton polytopes and relative entropy optimization
• Semidefinite programming bounds for the average kissing number
• Efficient first-order methods for convex minimization: a constructive approach
• Accelerated proximal point method for maximally monotone operators
• Performance of first-order methods for smooth convex minimization: a novel approach
• The theta number of simplicial complexes
• The sphere packing problem in dimension 8
• The sphere packing problem in dimension \(24\)
• Rational factorizations of completely positive matrices
• Triangle-intersecting families of graphs
• A proof of the Kepler conjecture
• Conducteurs d'Artin des caracteres reels. (Artin conductors of real characters)
• Edmonds polytopes and a hierarchy of combinatorial problems
• Positive definite functions on spheres
• High-dimensional sphere packing and the modular bootstrap
• The exact worst-case convergence rate of the gradient method with fixed step lengths for \(L\)-smooth functions
• An effective version of Schmüdgen's Positivstellensatz for the hypercube
• High dimensional Hoffman bound and applications in extremal combinatorics
• Global Optimization with Polynomials and the Problem of Moments
• Invariant Semidefinite Programs
• Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
• Relative Entropy Relaxations for Signomial Optimization
• Bad Semidefinite Programs: They All Look the Same
• Flag Algebras: A First Glance
• The kernel polynomial method
• A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
• Outline of an algorithm for integer solutions to linear programs
• Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
• New upper bounds for kissing numbers from semidefinite programming
• On the Shannon capacity of a graph
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Linear Programming Formulation for Optimal Stopping Problems
• Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
• Exact Semidefinite Programming Bounds for Packing Problems
• Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
• An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
• Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
• Splitting fields of real irreducible representations of finite groups
• Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
• An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
• Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization
• Hybrid Systems: Computation and Control
• Flag algebras
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Upper bounds for packings of spheres of several radii
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
• A unified framework of SAGE and SONC polynomials and its duality theory
• Intersecting families of permutations
• Positive trigonometric polynomials and signal processing applications
• On copositive programming and standard quadratic optimization problems