Výsledky vyhľadávania - and (problem OR problems) complexity: numerical algorithms

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

“… (in theory and practice).•A comprehensive numerical study of non-linear problems at a very large scale. Patriksson (2008…”
Získať plný text

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

“…This paper presents a novel meta-heuristic algorithm called Ali Baba and the forty thieves (AFT…”
Získať plný text

A unified single-loop alternating gradient projection algorithm for nonconvex–concave and convex–nonconcave minimax problems Autor 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…”
Získať plný text

On lower iteration complexity bounds for the convex concave saddle point problems Autor 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…”
Získať plný text

The cardiovascular system: Mathematical modelling, numerical algorithms and clinical applications Autor 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…”
Získať plný text

HOT: An Efficient Halpern Accelerating Algorithm for Optimal Transport Problems Autor 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…”
Získať plný text

Information acquisition optimizer: a new efficient algorithm for solving numerical and constrained engineering optimization problems Autor 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…”
Získať plný text

Optimistic planning algorithms for state-constrained optimal control problems Autor 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…”
Získať plný text

On the parameterized complexity of multiple-interval graph problems Autor 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…”
Získať plný text

Solving the quantum many-body problem with artificial neural networks Autor 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…”
Zistit podrobnosti o prístupe

Solution Algorithms for the Bounded Acceleration Shortest Path Problem Autor 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…”
Získať plný text

Computational complexity continuum within Ising formulation of NP problems Autor 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…”
Získať plný text

Economic lot-sizing problem with remanufacturing option: complexity and algorithms Autor 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…”
Získať plný text

Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems Autor Bergou, El Houcine, Diouane, Youssef, Kungurtsev, Vyacheslav

“…The Levenberg–Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems…”
Získať plný text

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

“…The Hiking Optimization Algorithm (HOA) is a meta-heuristic approach based on the mathematical modeling of Tobler’s hiking function…”
Získať plný text

A Low-Complexity Algorithm to Determine Trajectories Within the Circular Restricted Three-Body Problem Autor 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…”
Získať plný text

Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms Autor Bullo, Francesco, Cortés, Jorge, Martínez, Sonia

“… The book presents a broad set of tools for understanding coordination algorithms, determining their correctness, and assessing their complexity…”
Získať plný text

Pseudo-Deterministic Query Complexity of Search Problems Autor Chattopadhyay, Arkadev, Dahiya, Yogesh, Mahajan, Meena

“… Using these relations, we show that the deterministic query complexity of total search problems is at most the third power of its pseudo-deterministic query complexity…”
Získať plný text

Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems Autor Wang, Junlin, Xu, Zi

“…In this paper, we study second-order algorithms for solving nonconvex-strongly concave minimax problems, which have attracted much attention in recent years in many fields, especially in machine learning…”
Získať plný text

Asymmetry in the complexity of the multi-commodity network pricing problem Autor Bui, Quang Minh, Carvalho, Margarida, Neto, José

“…: the number of tolled arcs, and the number of commodities. We devise a simple algorithm showing that if the number of tolled arcs is fixed, then the problem can be solved in polynomial time with respect to the number of commodities…”
Získať plný text