ArXivCSExplorer
β˜†β˜†BookmarksπŸ†RSSHow to UseFAQ
Built with and by Teycir Ben Soltaneβ€’
How to Useβ€’FAQβ€’GitHubβ€’arXiv.orgβ€’
Share:

20 results for β€œPolynomial optimization”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.β“˜

Want pure semantic search? Try claim verification β†’

math.COcs.CCTheoreticalRecentJul 9, 2026

Polynomial Binary Optimization

Endre Boros

The paper develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…

View β†’
cs.CCcs.GTcs.LGTheoreticalRecentJun 15, 2026

The Complexity of Min-Max Optimization for Quadratic Polynomials

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alexandros Hollender

Computing approximate stationary points of min-max optimization over the hypercube is proven to be PPAD-hard for quadratic polynomials.

View β†’
cs.LGmath.OCstat.MLEmpiricalRecentJun 18, 2026

On the Oracle Complexity of Interpolation-Based Gradient Descent

Dongmin Lee, William Lu, Anuran Makur

The paper proposes an inexact gradient method, PPI-GD, that improves the oracle complexity of gradient descent for smooth loss functions.

View β†’
cs.DScs.CCcs.GTTheoreticalRecentJul 28, 2026

A Unifying Framework for Quasi-Polynomial Optimization of Fixed-degree Polynomials

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Gabriele Farina

This paper constructs an epsilon-cover of the joint value set of m constant-degree polynomials over a convex set H in the linfty-norm, with size n^(O(log(mn)/Ξ΅^2)), given that the polynomials have a c…

View β†’
math.OCcs.DMTheoreticalRecentJun 16, 2026

An Adaptive Algorithm for the Approximation of General Linear-Parametric Optimization Problems

Levin Nemesch, Stefan Ruzika, Clemens Thielen, Alina Wittmann

A new algorithm is proposed for approximating solutions to linear-multi-parametric optimization problems with negative parameter dependencies and non-fixed parameter sets.

View β†’
quant-phcs.CCTheoreticalRecentOct 7, 2026

Quantum Approximation Complexity of Classical Optimization Problems

Stuart Hadfield

The paper defines and studies the complexity classes for quantum approximation algorithms and establishes a hierarchy of quantum approximation classes.

View β†’
cs.DScs.LGTheoreticalRecentAug 3, 2026

The Condition-Number Barrier in Sparse Least Squares

Honghao Lin, Vahab Mirrokni, David P. Woodruff

The paper establishes a lower bound for the improvement of linear dependence on the restricted condition number in sparse convex optimization, using the Small-Set Expansion Hypothesis.

View β†’
cs.DScs.GTTheoreticalRecentJul 17, 2026

Solving Stackelberg Vertex Cover on trees using split and join

Dominik Scheder, Johannes Tantow

This paper presents three new algorithms for maximizing revenue in the Stackelberg Vertex Cover problem on certain kinds of trees.

View β†’
math.OCcs.DSTheoreticalRecentOct 19, 2026

Solving Classes of Linear Programs with Strongly Polynomial Straight Line Complexity in Strongly Polynomial Time

Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver +1 more

This paper presents an initialization framework and rounding procedure for interior point methods in linear programming, ensuring strongly polynomial time complexity.

View β†’
cs.DSTheoreticalRecentSep 18, 2026

Faster SVP in Polynomial Space

Yansong Feng, Yiming Gao, Jiaqi Liu

The paper presents a randomized algorithm that solves the exact Euclidean shortest vector problem in polynomial space and improved time complexity.

View β†’
math.OCcs.CCcs.LGSurveyRecentOct 29, 2026

Stochastic and Noisy Oracles in Smooth Continuous Optimization

Albert S. Berahas, Liyuan Cao, Katya Scheinberg

This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.

View β†’
cs.DMTheoreticalRecentJun 27, 2026

Local Minima in Quadratic-Penalty Relaxations of Binary Linear Programs

Cheng-Han Huang, Yongliang Sun, Chaoyan Huang, Ismail Alkhouri +1 more

The paper establishes conditions for QUBO formulations of combinatorial optimization problems that guarantee valid binary and feasible local minimizers using gradient-based methods.

View β†’
cs.DScs.AIcs.CCTheoreticalRecentAug 17, 2026

Improving the matrix multiplication exponent with modern optimization and AlphaEvolve

Emilien Dupont, Marvin Eisenberger, Borislav Kozlovskii, Abbas Mehrabian +6 more

The paper improves the optimization problem at the core of the laser method for obtaining matrix multiplication bounds, yielding a new upper bound of Ο‰ < 2.371177.

View β†’
cs.SCcs.CCTheoreticalRecentJun 10, 2026

Output-sensitive Sparse Polynomial GCD over Finite Fields is NP-hard

Ruichen Qiu, Yichuan Cao, Qiao-Long Huang, Ruyong Feng +1 more

This paper proves that output-sensitive sparse polynomial GCD computation over finite fields is NP-hard.

View β†’
math.OCcs.DSTheoreticalRecentJun 10, 2026

On finding exact solutions of linear programs in the oracle model

Daniel Dadush, LΓ‘szlΓ³ A. VΓ©gh, Giacomo Zambelli

The paper presents an algorithm for solving linear programming problems in the oracle model with improved time complexity.

View β†’