Global Optimization via the Dual SONC Cone and Linear Programming
Explore global optimization techniques using the dual SONC cone and linear programming, with applications to minimizing exponential sums and multivariate real polynomials.
HiGHS - Theory, Software and Impact
Explore the theory, software, and impact of HiGHS optimization solver, covering simplex methods, hyper-sparsity, parallel solutions, and performance across various problem types.
LP, SOCP, and Optimization-Free Approaches to Polynomial Optimization
Explore advanced techniques in polynomial optimization, including LP, SOCP, and optimization-free methods, with a focus on hierarchies and matrix-analytic approaches.
Polyhedral Techniques in Combinatorial Optimization: Matchings and Tours
Explore recent advancements in combinatorial optimization, focusing on matching and traveling salesman problems. Learn about polyhedral techniques and linear programming formulations for designing efficient algorithms.
Noriyoshi Sukegawa- On the Diameter of Polyhedra and Related Topics
Explore polyhedra diameter and its impact on simplex method complexity. Overview previous findings, recent results, and open questions in this mathematical field.
On Circuit Imbalance Measures and Their Role in Circuit Augmentation Algorithms
Explore new combinatorial condition numbers for linear and integer programs, their relation to existing measures, and their impact on circuit diameter bounds and simplex methods.
Polyhedral Geometry of Pivot Rules
Explore the geometric perspective on pivot rules in linear programming, connecting polyhedra, simplex methods, and arborescences to gain insights into optimization algorithms.
Performance of Steepest Descent in 0/1 LPs
Explores steepest descent in 0/1 LPs, proving polynomial-length paths and developing a new pivot rule for the Simplex method. Unifies circuit and edge steps, advancing understanding of combinatorial optimization.
Introduction to Parameterized Algorithms and Applications
Explore parameterized complexity and its applications in discrete optimization, focusing on LP-guided techniques, Lenstra's algorithm, and structured ILPs using Graver bases.
The Geometry of the Space of All Pivot Rules of a Linear Optimization Problem
Explore the geometric aspects of pivot rules in linear optimization with Jesús A. De Loera. Gain insights into advanced mathematical concepts and their applications in industrial problem-solving.
Solving the Hardest Problems in Mathematics - Interview with Daniel Spielman
Mathematician Tom Crawford interviews Daniel Spielman about his career, the Nevanlinna Prize, and contributions to mathematical aspects of information sciences, offering insights into solving complex problems.
Formalising the Theory of Combinatorial Optimisation
Explore formalisation of combinatorial optimisation theory in Isabelle/HOL, focusing on matching theory and its mathematical implications for computer science and applied mathematics.
Linear Programming and Semidefinite Programming in Coding Theory - An Incomplete Overview
Explore linear programming in coding theory, including MRRW and Levenshtein bounds, spherical codes, and connections to combinatorial objects. Discover recent advances in equiangular lines and energy bounds.
Polyhedral Techniques in Combinatorial Optimization - Matchings and Tours
Explore recent advancements in combinatorial optimization, focusing on matching and traveling salesman problems. Learn about polyhedral techniques and linear programming formulations for designing efficient algorithms.
A Case for Correctly Rounded Math Libraries
Explore the RLIBM project's approach to building correctly rounded elementary functions, revolutionizing polynomial approximations for enhanced mathematical precision in computing.
Visual Optimization Solver - Graphical Solution and LLM-Generated Reports
Explore a graphical solver for mathematical optimization, visualizing function minimization with equality constraints and generating LLM-based reports for enhanced understanding.
Optimization in Theory and Practice
Explore optimization techniques and their real-world applications with insights from Stephen Wright of University of Wisconsin-Madison, blending theoretical foundations and practical implementations.
A Linear Program for Points of Interest Relocation in Adaptive Maps
Explore an innovative linear program for relocating points of interest in adaptive maps, enhancing cartographic visualization and user experience.
Simplex Methods in Matrix Form
Learn matrix-based simplex methods for efficient linear programming problem-solving, enhancing your optimization skills and mathematical understanding.
GeoCombSurfX - Exploring Properties of Polygonal Complexes
Explore polygonal complexes, analyze combinatoric and geometric properties, and tackle interlocking problems using Julia's ecosystem. Learn about future developments in algebraic analysis and 3D embeddings.
Exploiting Sparsity in Polynomial Optimization - Lecture 1
Explore sparsity exploitation techniques in polynomial optimization, focusing on advanced mathematical concepts and practical applications.