Imagen de Portada

Harnessing Inferior Solutions For Superior Outcomes: Obtaining Robust Solutions From Quantum Algorithms

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Halffmann, Pascal, Lenk, Steve, Trebing, Michael
Formato:	Preprint
Publicado:	2024
Materias:	Quantum Physics Optimization and Control 90C17, 68Q12, 90C27
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
por: Goerigk, Marc, et al.
Publicado: (2026)

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

Uncomputability of Global Optima for Nonconvex Functions in the Oracle Model
por: Lakshmanan, K
Publicado: (2023)

Concave Certificates: Geometric Framework for Distributionally Robust Risk and Complexity Analysis
por: Chu, Hong T. M.
Publicado: (2026)

Characterization of Highly Robust Solutions in Multi-Objective Programming in Banach Spaces
por: Rahimi, Morteza, et al.
Publicado: (2025)

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

The n-vehicle exploration problem is NP-complete
por: Cui, Jinchuan, et al.
Publicado: (2023)

On the hardness of deciding the finite convergence of Lasserre hierarchies
por: Vargas, Luis Felipe
Publicado: (2024)

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

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

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)

Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room Entitlements
por: Brandt, Tabea, et al.
Publicado: (2023)

Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods
por: Kitaoka, Akira
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)

Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
por: Barkel, Mathijs, et al.
Publicado: (2026)

Adjustable Robust Nonlinear Network Design Without Controllable Elements under Load Scenario Uncertainties
por: Thürauf, Johannes, et al.
Publicado: (2024)

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

A Gauge Set Framework for Flexible Robustness Design
por: Wei, Ningji, et al.
Publicado: (2025)

Robust Graph-Based Semi-Supervised Learning via $p$-Conductances
por: Robertson, Sawyer Jack, et al.
Publicado: (2025)

A Heuristic Alternating Direction Method of Multipliers Framework for Distributed and Centralized Tree-Constrained Optimization: Applications to Hop-Constrained Spanning Tree Multicommodity Flow Design
por: Mokhtari, Yacine
Publicado: (2025)

On Computing and Pricing of Adjustable Robust Chemical Process Designs
por: Schwientek, Jan, et al.
Publicado: (2025)

Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
por: Borgwardt, Steffen, et al.
Publicado: (2024)

Policy Gradient Algorithms for Robust MDPs with Non-Rectangular Uncertainty Sets
por: Li, Mengmeng, et al.
Publicado: (2023)

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

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)

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

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
por: Jung, Woosuk L., et al.
Publicado: (2023)

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

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
por: Guo, Feng, et al.
Publicado: (2023)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
por: Rubbens, Anne, et al.
Publicado: (2024)

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

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

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
por: Lara, Felipe, et al.
Publicado: (2024)