Search Results - and (problem OR problemy) complexity: numerical algorithms

Algorithms for the continuous nonlinear resource allocation problem—New implementations and numerical studies by Patriksson, Michael, Strömberg, Christoffer

“… (in theory and practice).•A comprehensive numerical study of non-linear problems at a very large scale. Patriksson (2008…”
Get full text

A novel meta-heuristic algorithm for solving numerical optimization problems: Ali Baba and the forty thieves by Braik, Malik, Ryalat, Mohammad Hashem, Al-Zoubi, Hussein

“…This paper presents a novel meta-heuristic algorithm called Ali Baba and the forty thieves (AFT…”
Get full text

The cardiovascular system: Mathematical modelling, numerical algorithms and clinical applications by Quarteroni, A., Manzoni, A., Vergara, C.

“… PDE and ODE systems, proposing sound and efficient numerical methods for their approximation, and simulating both benchmark problems and clinically…”
Get full text

A unified single-loop alternating gradient projection algorithm for nonconvex–concave and convex–nonconcave minimax problems by Xu, Zi, Zhang, Huiling, Xu, Yang, Lan, Guanghui

“…Much recent research effort has been directed to the development of efficient algorithms for solving minimax problems with theoretical convergence guarantees due to the relevance of these problems…”
Get full text

On lower iteration complexity bounds for the convex concave saddle point problems by Zhang, Junyu, Hong, Mingyi, Zhang, Shuzhong

“…In this paper, we study the lower iteration complexity bounds for finding the saddle point of a strongly convex and strongly concave saddle point problem: min x max y F ( x , y…”
Get full text

Information acquisition optimizer: a new efficient algorithm for solving numerical and constrained engineering optimization problems by Wu, Xiao, Li, Shaobo, Jiang, Xinghe, Zhou, Yanqiu

“…This paper addresses the increasing complexity of challenges in the field of continuous nonlinear optimization by proposing an innovative algorithm called information acquisition optimizer (IAO…”
Get full text

HOT: An Efficient Halpern Accelerating Algorithm for Optimal Transport Problems by Zhang, Guojun, Gu, Zhexuan, Yuan, Yancheng, Sun, Defeng

“…) problems with finite supports. We particularly focus on an efficient implementation of the HOT algorithm for the case where the supports are in <inline-formula><tex…”
Get full text

A trust region algorithm with a worst-case iteration complexity of O(ϵ-3/2) for nonconvex optimization by Curtis, Frank E., Robinson, Daniel P., Samadi, Mohammadreza

“…We propose a trust region algorithm for solving nonconvex smooth optimization problems…”
Get full text

On the parameterized complexity of multiple-interval graph problems by Fellows, Michael R., Hermelin, Danny, Rosamond, Frances, Vialette, Stéphane

“… In this sequel, we study multiple-interval graph problems from the perspective of parameterized complexity…”
Get full text

On the Complexity of the Plantinga–Vegter Algorithm by Cucker, Felipe, Ergür, Alperen A., Tonelli-Cueto, Josué

“…We introduce tools from numerical analysis and high dimensional probability for precision control and complexity analysis of subdivision-based algorithms in computational geometry…”
Get full text

Optimistic planning algorithms for state-constrained optimal control problems by Bokanowski, Olivier, Gammoudi, Nidhal, Zidani, Hasnaa

“…In this work, we study optimistic planning methods to solve some state-constrained optimal control problems in finite horizon…”
Get full text

Variational learning algorithms for quantum query complexity by Wu, Zipeng, Hou, Shi-Yao, Zhang, Chao, Li, Lvzhou, Zeng, Bei

“… We apply this technique to various quantum query complexities, notably devising a new algorithm that resolves the 5-bit Hamming modulo problem with four queries, addressing an open question from Cornelissen et al (2021 arXiv: 2112.14682…”
Get full text

Solution Algorithms for the Bounded Acceleration Shortest Path Problem by Ardizzoni, Stefano, Consolini, Luca, Laurini, Mattia, Locatelli, Marco

“… Even if the BASP is NP-hard in the general case, we present a solution algorithm that achieves polynomial time-complexity under some additional hypotheses on problem data…”
Get full text

Economic lot-sizing problem with remanufacturing option: complexity and algorithms by Arulselvan, Ashwin, Akartunalı, Kerem, van den Heuvel, Wilco

“…In a single item dynamic lot-sizing problem, we are given a time horizon and demand for a single item in every time period…”
Get full text

Solving the quantum many-body problem with artificial neural networks by Carleo, Giuseppe, Troyer, Matthias

“…The challenge posed by the many-body problem in quantum physics originates from the difficulty of describing the nontrivial correlations encoded in the exponential complexity of the many-body wave function…”
Get more information

The Sinkhorn algorithm, parabolic optimal transport and geometric Monge–Ampère equations by Berman, Robert J.

“…We show that the discrete Sinkhorn algorithm—as applied in the setting of Optimal Transport on a compact manifold…”
Get full text

A Low-Complexity Algorithm to Determine Trajectories Within the Circular Restricted Three-Body Problem by Canales, David, Perera, Sirani M., Kurttisi, Atahan, Baker-McEvilly, Brian

“… A low-complexity algorithm utilizing interpolation and incorporating boundary conditions is introduced for generating accurate trajectories and periodic orbits within the Cislunar domain…”
Get full text

Computational complexity continuum within Ising formulation of NP problems by Kalinin, Kirill P., Berloff, Natalia G.

“… The minimisation of the Ising Hamiltonian is known to be NP-hard problem yet not all problem instances are equivalently hard to optimise…”
Get full text

Mhoa: multi-strategy Hiking Optimization Algorithm for solving engineering and numerical optimization problems by Zhang, Jinmeng, Liu, Hao

“…The Hiking Optimization Algorithm (HOA) is a meta-heuristic approach based on the mathematical modeling of Tobler’s hiking function…”
Get full text

Sample complexity analysis for adaptive optimization algorithms with stochastic oracles by Jin, Billy, Scheinberg, Katya, Xie, Miaolan

“…Several classical adaptive optimization algorithms, such as line search and trust-region methods, have been recently extended to stochastic settings where function values, gradients, and Hessians…”
Get full text