Search Results - analysis of algorithms and (problem OR problemy) complexity- numerical algorithms and problems

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 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

Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems by 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…”
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

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

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

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

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

Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems by Doron, Lior, Shtern, Shimrit

“…Simple bilevel problems are optimization problems in which we want to find an optimal solution to an inner problem that minimizes an outer objective function…”
Get full text

The Bounded and Precise Word Problems for Presentations of Groups by Ivanov, S. V.

“…We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations…”
Get full text

Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems by 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…”
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

Polynomial-time algorithms for multimarginal optimal transport problems with structure by Altschuler, Jason M., Boix-Adserà, Enric

“… However, in most applications, the success of MOT is severely limited by a lack of efficient algorithms…”
Get full text

On efficient algorithms for bottleneck path problems with many sources by Kaymakov, Kirill V., Malyshev, Dmitry S.

“…For given edge-capacitated connected graph and two its vertices s and t , the bottleneck (or max min ) path problem is to find the maximum value of path-minimum edge capacities among all paths, connecting s and t…”
Get full text

Generalized Asymmetric Forward–Backward–Adjoint Algorithms for Convex–Concave Saddle-Point Problem by Bai, Jianchao, Chen, Yang, Yu, Xue, Zhang, Hongchao

“…The convex–concave minimax problem, also known as the saddle-point problem, has been extensively studied from various aspects including the algorithm design, convergence condition and complexity…”
Get full text

Zeroth-order algorithms for nonconvex–strongly-concave minimax problems with improved complexities by Wang, Zhongruo, Balasubramanian, Krishnakumar, Ma, Shiqian, Razaviyayn, Meisam

“…In this paper, we study zeroth-order algorithms for minimax optimization problems that are nonconvex in one variable and strongly-concave in the other…”
Get full text

A linear-time algorithm for trust region problems by Hazan, Elad, Koren, Tomer

“… We give the first provable linear-time (in the number of non-zero entries of the input) algorithm for approximately solving this problem…”
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

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