Cover Image

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mohammadisiahroudi, Mohammadhossein, Fakhimi, Ramin, Wu, Zeguan, Terlaky, Tamás
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 90C51, 90C05, 68Q12, 81P68
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Scaling Quantum Interior Point Method for Linear Optimization
by: Mohammadisiahroudi, Mohammadhossein, et al.
Published: (2025)

A quantum dual logarithmic barrier method for linear optimization
by: Wu, Zeguan, et al.
Published: (2024)

A preconditioned inexact infeasible quantum interior point method for linear optimization
by: Wu, Zeguan, et al.
Published: (2024)

Optimal phase change for a generalized Grover's algorithm
by: Cardullo, Christopher, et al.
Published: (2025)

Quantum Computing in Logistics and Supply Chain Management an Overview
by: Phillipson, Frank
Published: (2024)

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

On semidefinite programming characterizations of the numerical radius and its dual norm
by: Friedland, Shmuel, et al.
Published: (2023)

Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems
by: Hartung, Tobias, et al.
Published: (2025)

Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA
by: Ali, Alejandro Mata
Published: (2025)

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

An Efficient Quantum Algorithm for Linear System Problem in Tensor Format
by: Wu, Zeguan, et al.
Published: (2024)

Quantum-Inspired DRL Approach with LSTM and OU Noise for Cut Order Planning Optimization
by: Chrisnanto, Yulison Herry, et al.
Published: (2025)

Solving the semidefinite relaxation of QUBOs in matrix multiplication time, and faster with a quantum computer
by: Augustino, Brandon, et al.
Published: (2023)

Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
by: Gribling, Sander, et al.
Published: (2025)

Harnessing Inferior Solutions For Superior Outcomes: Obtaining Robust Solutions From Quantum Algorithms
by: Halffmann, Pascal, et al.
Published: (2024)

Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
by: Vodeb, Jaka, et al.
Published: (2024)

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

Quantum computing and the stable set problem
by: Krpan, Aljaž, et al.
Published: (2024)

Quantum and Simulated Annealing-Based Iterative Algorithms for QUBO Relaxations of the Sparsest $k$-Subgraph Problem
by: Bihani, Omkar, et al.
Published: (2025)

A Quantum Computing Approach for the Unit Commitment Problem
by: Halffmann, Pascal, et al.
Published: (2022)

Tensors, entanglement, separability, and their complexity
by: Friedland, Shmuel
Published: (2025)

Superlinear Convergence of an Interior Point Algorithm on Linear Semi-definite Feasibility Problems
by: Sim, Chee-Khian
Published: (2022)

On the Curvature of the Central Path of Linear Programming Theory
by: Dedieu, Jean-Pierre, et al.
Published: (2003)

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

Riemannian Interior Point Methods for Constrained Optimization on Manifolds
by: Lai, Zhijian, et al.
Published: (2022)

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

Kurdyka-Łojasiewicz exponent via square transformation
by: Ouyang, Wenqing
Published: (2025)

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

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

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

Quantum Query Complexity of the Hyperoctahedral Group
by: Bae, Ji Ho
Published: (2026)

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

Quadratic Programming over Linearly Ordered Fields: Decidability and Attainment of Optimal Solutions
by: Plutenko, Dmytro O.
Published: (2026)

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

Mixed-Integer Linear Optimization for Cardinality-Constrained Random Forests
by: Burgard, Jan Pablo, et al.
Published: (2024)

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

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
by: Bousselmi, Nizar, et al.
Published: (2023)

Mixed-Integer Linear Optimization for Semi-Supervised Optimal Classification Trees
by: Burgard, Jan Pablo, et al.
Published: (2024)

Asymmetric Long-Step Primal-Dual Interior-Point Methods with Dual Centering
by: Nesterov, Yurii
Published: (2025)

Interior-Point Algorithms for Monotone Linear Complementarity Problem Based on Different Predictor Directions
by: -Nagy, Marianna E., et al.
Published: (2025)