Suchergebnisse - algorithm analysis and (problem OR problems) complexity

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

Horse herd optimization algorithm: A nature-inspired algorithm for high-dimensional optimization problems von MiarNaeimi, Farid, Azizyan, Gholamreza, Rashki, Mohsen

“… This paper proposes a new meta-heuristic algorithm inspired by horses’ herding behavior for high-dimensional optimization problems …”
Volltext

Energy-aware lot sizing problem: Complexity analysis and exact algorithms von Rapine, Christophe, Goisque, Guillaume, Akbalik, Ayse

“… The single-item lot sizing problem under a periodic energy limitation is considered in this paper …”
Volltext

A unified single-loop alternating gradient projection algorithm for nonconvex–concave and convex–nonconcave minimax problems von 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 …”
Volltext

Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms von Rebennack, Steffen, Prokopyev, Oleg A., Singh, Bismark

“… This fact turns out to be not surprising as we prove that the considered problem is NP‐hard in general, but admits a linear time solution algorithm when the graph is a tree …”
Volltext

Complexity of Quantum Impurity Problems von Bravyi, Sergey, Gosset, David

“… We give a quasi-polynomial time classical algorithm for estimating the ground state energy and for computing low energy states of quantum impurity models …”
Volltext

A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems von Chen, Yu, Kuang, Kai, Yan, Xueling

“… Additionally, the complexity analysis of the proposed algorithm is investigated. To reach the point with the norm of the gradient below ɛ …”
Volltext

An efficient algorithm and complexity result for solving the sum of general affine ratios problem von Jiao, Hongwei, Ma, Junqiao

“… In this paper, with the unique hypothesis that the denominator is not equal to 0, an efficient outer space rectangle branch-and-bound algorithm is presented to globally solve the sum of general affine ratios problem …”
Volltext

Meta-heuristic search algorithms in truss optimization: Research on stability and complexity analyses von Öztürk, Hasan Tahsin, Kahraman, Hamdi Tolga

“… ) the competitor algorithms used in the optimization process being insufficient, and (iii) the stability analysis and computational complexity information of the algorithms are not investigated …”
Volltext

Zeroth-order algorithms for nonconvex–strongly-concave minimax problems with improved complexities von 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 …”
Volltext

On the sphere-decoding algorithm I. Expected complexity von Hassibi, B., Vikalo, H.

“… Therefore, in this paper, rather than dwell on the worst-case complexity of the integer least-squares problem, we study its expected …”
Volltext

Complexity and Algorithms for Superposed Data Uploading Problem in Networks With Smart Devices von Li, Wenjun, Xu, Huayi, Li, Huixi, Yang, Yongjie, Sharma, Pradip Kumar, Wang, Jin, Singh, Saurabh

“… ) or servers can be merged between SDs with a fixed size, which is called superposed data . In this article, we consider the superposed data uploading problem in a decentralized device-to-device communication system …”
Volltext

The Traveling Salesman Problem: A Computational Study von Applegate, David L, Bixby, Robert E, Chvátal, Vašek, Cook, William J

“… This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem …”
Volltext

Complexity analysis and approximation algorithms for the single-machine scheduling problem with workload-dependent maintenance activities von Liu, Peihai, Gu, Manzhan, Lu, Xiwen

“… In the case where the function is concave, we study the computational complexity of the three problems with the goal of minimizing the makespan, the total completion time, and the total weighted …”
Volltext

On the Parameterized Complexity of Reconfiguration Problems von Mouawad, Amer E., Nishimura, Naomi, Raman, Venkatesh, Simjour, Narges, Suzuki, Akira

“… We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration variant of an optimization problem Q takes as input two feasible solutions S and T …”
Volltext

On lower iteration complexity bounds for the convex concave saddle point problems von 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 …”
Volltext

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems von Le Gall, François, Seddighin, Saeed

“… ) are three fundamental string problems that can be classically solved in near linear time. In this work, we present sublinear time quantum algorithms for these problems along with quantum lower bounds …”
Volltext

Algorithms and complexity for the almost equal maximum flow problem von Haese, Rebekka, Heller, Till, Krumke, Sven O.

“… In the equal maximum flow problem (EMFP), we aim for a maximum flow where we require the same flow value on all arcs in some given subsets of the arc set, so called homologous arc sets …”
Volltext

Predictor-corrector interior-point algorithm for P(κ)-linear complementarity problems based on a new type of algebraic equivalent transformation technique von Darvay, Zsolt, Illés, Tibor, Rigó, Petra Renáta

“… •Polynomial complexity in the size of the problem and in the handicap of the matrix.•Numerical results show the efficiency of the introduced interior-point algorithm …”
Volltext

Data complexity meta-features for regression problems von Lorena, Ana C., Maciel, Aron I., de Miranda, Péricles B. C., Costa, Ivan G., Prudêncio, Ricardo B. C.

“… This paper presents and analyses measures devoted to estimate the complexity of the function that should fitted to the data in regression problems …”
Volltext