Imagen de Portada

On the Hardness of Short and Sign-Compatible Circuit Walks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Borgwardt, Steffen, Grewe, Weston, Kafer, Sean, Lee, Jon, Sanità, Laura
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control 52B05, 68Q25, 90C60
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Diameter of a 2-Sum of Polyhedra
por: Borgwardt, Steffen, et al.
Publicado: (2023)

On Circuit Imbalance and 0/1 Circuits for Coloring and Spanning Forest Problems
por: Borgwardt, Steffen, et al.
Publicado: (2025)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
por: Yang, Xiangyu, et al.
Publicado: (2021)

Topological structure and a polynomial-time solution of linear programming over the real numbers
por: Wei, Jing-Yuan
Publicado: (2018)

A non-iterative polynomial algorithm for linear programming
por: Jing-Yuan, Wei
Publicado: (2013)

On the Circuit Diameter Conjecture for Counterexamples to the Hirsch Conjecture
por: Black, Alexander E., et al.
Publicado: (2023)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
por: Hua, Zheng, et al.
Publicado: (2021)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
por: Zhang, Chenyu, et al.
Publicado: (2023)

The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm
por: Ye, Yuhan, et al.
Publicado: (2026)

Circuit and Graver Walks and Linear and Integer Programming
por: Onn, Shmuel
Publicado: (2024)

Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods
por: Kitaoka, Akira
Publicado: (2024)

Online Convex Optimization Using Coordinate Descent Algorithms
por: Lin, Yankai, et al.
Publicado: (2022)

Birkhoff interpolation models for optimization with some available derivatives
por: Larson, Jeffrey, et al.
Publicado: (2026)

A Function-Space Stability Boundary for Generalization in Interpolating Learning Systems
por: Katende, Ronald
Publicado: (2026)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
por: Nesterov, Yurii
Publicado: (2025)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
por: Ouyang, Wenqing, et al.
Publicado: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
por: Ouyang, Wenqing
Publicado: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
por: Zhang, Liwei, et al.
Publicado: (2025)

Learning Decision-Sufficient Representations for Linear Optimization
por: Ye, Yuhan, et al.
Publicado: (2026)

Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses
por: Ye, Yuhan
Publicado: (2026)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
por: Geremew, W., et al.
Publicado: (2026)

A template for gradient norm minimization
por: Florea, Mihai I.
Publicado: (2024)

An optimal lower bound for smooth convex functions
por: Florea, Mihai I., et al.
Publicado: (2024)

Adaptive first-order methods with enhanced worst-case rates
por: Florea, Mihai I.
Publicado: (2024)

Barrier Algorithms for Constrained Non-Convex Optimization
por: Dvurechensky, Pavel, et al.
Publicado: (2024)

On the Hardness of the $L_1-L_2$ Regularization Problem
por: Ouyang, Yuyuan, et al.
Publicado: (2024)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
por: Bot, Radu Ioan, et al.
Publicado: (2024)

A practical randomized trust-region method to escape saddle points in high dimension
por: Dragomir, Radu-Alexandru, et al.
Publicado: (2026)

Accelerating preconditioned ADMM via degenerate proximal point mappings
por: Sun, Defeng, et al.
Publicado: (2024)

Analysis of Kernel Mirror Prox for Measure Optimization
por: Dvurechensky, Pavel, et al.
Publicado: (2024)

A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm
por: Chiarini, Alberto, et al.
Publicado: (2024)

Bilateral facial reduction: qualification-free subdifferential calculus and exact duality
por: Scott, Matthew S.
Publicado: (2025)

Consensus in Multiagent Systems under communication failure
por: Bentaibi, Mohamed, et al.
Publicado: (2024)

The Hard-Constraint PINNs for Interface Optimal Control Problems
por: Lai, Ming-Chih, et al.
Publicado: (2023)

An adaptive framework for first-order gradient methods
por: Hu, Xiaozhe, et al.
Publicado: (2026)

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
por: He, Chuan, et al.
Publicado: (2023)

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
por: Friedland, Shmuel
Publicado: (2023)

Incremental Certificate Learning for Hybrid Neural Network Verification . A Solver Architecture for Piecewise-Linear Safety Queries
por: Gokavarapu, Chandrasekhar
Publicado: (2025)

Improved global performance guarantees of second-order methods in convex minimization
por: Dvurechensky, Pavel, et al.
Publicado: (2024)

Performance Estimation of second-order optimization methods on classes of univariate functions
por: Rubbens, Anne, et al.
Publicado: (2025)