Cover Image

A preconditioned inexact infeasible quantum interior point method for linear optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wu, Zeguan, Yang, Xiu, Terlaky, Tamás
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 81P68, 90C05, 90C51, 65F08
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
by: Mohammadisiahroudi, Mohammadhossein, et al.
Published: (2023)

An inexact infeasible arc-search interior-point method for linear optimization problems
by: Iida, Einosuke, et al.
Published: (2024)

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

On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
by: Habibi, Soodeh, et al.
Published: (2024)

An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
by: Iida, Einosuke, et al.
Published: (2023)

A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure
by: Kempke, Nils-Christian, et al.
Published: (2024)

Randomized Nyström Preconditioned Interior Point-Proximal Method of Multipliers
by: Chu, Ya-Chi, et al.
Published: (2024)

A polynomial time infeasible interior-point arc-search algorithm for convex optimization
by: Yang, Yaguang
Published: (2022)

On the asymptotic behavior of a higher-order extrapolation primal-dual interior-point method for nonlinear programming
by: Heeman, Pim, et al.
Published: (2025)

Long-Step Path-Following Algorithm for Quantum Information Theory: Some Numerical Aspects and Applications
by: Faybusovich, Leonid, et al.
Published: (2019)

A Grover-compatible manifold optimization algorithm for quantum search
by: Lai, Zhijian, et al.
Published: (2025)

Curve fitting on a quantum annealer for an advanced navigation method
by: Isserstedt, Philipp, et al.
Published: (2024)

An interior point method for nonlinear constrained derivative-free optimization
by: Brilli, Andrea, et al.
Published: (2021)

Extragradient method with feasible inexact projection to variational inequality problem
by: Millán, R. Díaz, et al.
Published: (2023)

New complexity bounds for primal--dual interior-point algorithms in conic optimization
by: Dahl, Joachim, et al.
Published: (2025)

Sampling-Based Methods for Multi-Block Optimization Problems over Transport Polytopes
by: Hu, Yukuan, et al.
Published: (2023)

Time-integrated Optimal Transport: A Robust Minimax Framework
by: Nguyen, Thai P. D., et al.
Published: (2025)

A computationally efficient arc-search interior-point algorithm for nonlinear constrained optimization
by: Yang, Yaguang
Published: (2024)

Implementing a unified solver for nonlinearly constrained optimization
by: Vanaret, Charlie, et al.
Published: (2024)

Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
by: He, Xin, et al.
Published: (2026)

Moment-sos and spectral hierarchies for polynomial optimization on the sphere and quantum de Finetti theorems
by: Blomenhofer, Alexander Taveira, et al.
Published: (2024)

Optimization in Theory and Practice
by: Wright, Stephen J.
Published: (2025)

A preconditioned difference of convex functions algorithm with extrapolation and line search
by: Zhang, Ran, et al.
Published: (2025)

Complexity of an inexact stochastic SQP algorithm for equality constrained optimization
by: O'Neill, Michael J., et al.
Published: (2026)

Quantum circuit design from a retraction-based Riemannian optimization framework
by: Lai, Zhijian, et al.
Published: (2026)

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

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

Optimization in complex spaces with the Mixed Newton Method
by: Bakhurin, Sergey, et al.
Published: (2022)

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

Efficiency and Convergence Insights in Large-Scale Optimization Using the Improved Inexact-Newton-Smart Algorithm and Interior-Point Framework
by: Renani, Neda Bagheri, et al.
Published: (2025)

On the convergence of critical points on real algebraic sets and applications to optimization
by: Basu, Saugata, et al.
Published: (2025)

Randomized quasi-Monte Carlo methods for risk-averse stochastic optimization
by: Melnikov, Olena, et al.
Published: (2024)

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)

On the Convergence of the Sinkhorn-Knopp Algorithm with Sparse Cost Matrices
by: Mena, Jose Rafael Espinosa
Published: (2024)

On the Convergence of Interior-Point Methods for Bound-Constrained Nonlinear Optimization Problems with Noise
by: Dezfulian, Shima, et al.
Published: (2024)

A Non-Archimedean Interior Point Method for Solving Lexicographic Multi-Objective Quadratic Programming Problems
by: Fiaschi, Lorenzo, et al.
Published: (2021)

Greedy Learning to Optimize with Convergence Guarantees
by: Fahy, Patrick, et al.
Published: (2024)

Mixed-integer linearity in nonlinear optimization: a trust region approach
by: De Marchi, Alberto
Published: (2023)