Cover Image

Ethic Duality: A Homological Framework for Primal-Dual Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pasechnyuk-Vilensky, Dmitry, Takáč, Martin
Format:	Preprint
Published:	2025
Subjects:	Category Theory Optimization and Control 18G10, 90C25, 68Q17 F.1.1; G.1.6; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning Latent Graph Geometry via Fixed-Point Schrödinger-Type Activation: A Theoretical Study
by: Pasechnyuk-Vilensky, Dmitry, et al.
Published: (2025)

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
by: Emmerich, Michael T. M., et al.
Published: (2026)

On (In)approximability of MaxMin Independent Set Reconfiguration
by: Hoang, Hung P., et al.
Published: (2026)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
by: Emmerich, Michael T. M.
Published: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
by: Heimann, Sophia, et al.
Published: (2026)

Quantum walk informed variational algorithm design
by: Matwiejew, Edric, et al.
Published: (2024)

Benders Cut Filtering for Affine Potential-Based Flow Problems with Robustness Scenarios and Topology Switching
by: Donkiewicz, Tim, et al.
Published: (2026)

Reinterpreting EMML as Mirror Descent for Constrained Maximum Likelihood Estimation
by: Clerc, Antonin, et al.
Published: (2026)

Approximation algorithms for the prize-collecting rural postman problem
by: Li, Hong, et al.
Published: (2026)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

An SoS Entropy Dichotomy via Windowed Hypercontractivity
by: Lela, Marko
Published: (2025)

Extending Exact Integrality Gap Computations for the Metric TSP
by: Cook, William, et al.
Published: (2026)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)

Leveraging Analog Neutral Atom Quantum Computers for Diversified Pricing in Hybrid Column Generation Frameworks
by: Perron, Cédrick, et al.
Published: (2025)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
by: Neira, David E. Bernal, et al.
Published: (2021)

P vs NP Problem in Portfolio Optimization: Integrating the Markowitz-CAPM Framework with Cardinality Constraints and Black-Scholes Derivative Pricing
by: Gondauri, Davit
Published: (2026)

IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
by: Lela, Marko
Published: (2025)

Modern column generation for estimating single- and multi-purchase ranked list choice models
by: Costa, Luciano, et al.
Published: (2026)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
by: Heimann, Sophia, et al.
Published: (2025)

Quantum Annealing and Tensor Networks: a Powerful Combination to Solve Optimization Problems
by: Binimelis, Miquel Albertí
Published: (2024)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
by: Ali, Alejandro Mata
Published: (2025)

A simple algorithm for the simple bilevel programming (SBP) problem
by: Dempe, Stephan, et al.
Published: (2025)

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity
by: Gratton, Serge, et al.
Published: (2024)

Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
by: Gratton, Serge, et al.
Published: (2026)

Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization
by: Bellavia, S., et al.
Published: (2025)

Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
by: Bärligea, Adelina, et al.
Published: (2025)

Moduli space of optimization algorithms
by: Pasechnyuk-Vilensky, Dmitry, et al.
Published: (2025)

Heterogeneous-Horizon Exact-Weight Local SGD
by: Pasechnyuk-Vilensky, Dmitry, et al.
Published: (2026)

Cubic Regularized Newton Method with Variance Reduction for Finite-sum Non-convex Problems
by: Pasechnyuk-Vilensky, Dmitry, et al.
Published: (2025)

Investigating Techniques to Optimise the Layout of Turbines in a Windfarm using a Quantum Computer
by: Hancock, James, et al.
Published: (2023)

Investigating methods to solve large windfarm optimization problems with a minimum number of qubits using circuit-based quantum computers
by: Hancock, James, et al.
Published: (2025)

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
by: Cheng, Cong-Dian
Published: (2017)

PRIME: Efficient Algorithm for Token Graph Routing Problem
by: Xu, Haotian, et al.
Published: (2026)

Internalizing Tools as Morphisms in Graded Transformers
by: Shaska, Tony
Published: (2025)

Primal-Dual Sample Complexity Bounds for Constrained Markov Decision Processes with Multiple Constraints
by: Buckley, Max, et al.
Published: (2025)

An optimally fast objective-function-free minimization algorithm using random subspaces
by: Bellavia, S., et al.
Published: (2023)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
by: Chen, Yijia, et al.
Published: (2023)

Examples of slow convergence for adaptive regularization optimization methods are not isolated
by: Toint, Philippe L.
Published: (2024)

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o(ε^{-2})$ rather than $\mathcal{O}(ε^{-2})$
by: Gratton, Serge, et al.
Published: (2024)

A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees
by: Ryabchenko, Alexander, et al.
Published: (2026)