Suchergebnisse - Analysis of Algorithms and Problem Complexity General Terms

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

“… ) algorithm, and provide improved results compared to existing works, in terms of oracle complexity …”
Volltext

An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms von He, Jiefei, Zhang, Huiling, Xu, Zi

“… In this paper, we propose an efficient approximation proximal gradient algorithm for solving a class of nonsmooth nonconvex-linear minimax problems with a nonconvex nonsmooth term, and the number …”
Volltext

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

“… , where the term L xy 2 μ x μ y explains how the coupling influences the iteration complexity. Under several special parameter regimes, this lower bound has been achieved by corresponding optimal algorithms …”
Volltext

A survey on evolutionary computation for complex continuous optimization von Zhan, Zhi-Hui, Shi, Lin, Tan, Kay Chen, Zhang, Jun

“… any-constraints, and M any-costs. We term these as 5-M challenges that exist in large-scale optimization problems, dynamic optimization problems, multi-modal optimization problems, multi-objective optimization problems, many …”
Volltext

A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems von Jiao, Hongwei, Li, Binbin, Yang, Wenqiang

“… In this paper, we investigate a generalized multiplicative problem (GMP) that is known to be NP-hard even with one linear product term …”
Volltext

Fast algorithms for non-convex tensor completion problems: Fast algorithms for non-convex tensor completion problems von Kanwal, Asia, ur Rahman, Mati, Boulaaras, Salah

“… visualization and analysis. Traditional methods for processing multi-dimensional data, such as matrix-based singular value decomposition (SVD …”
Volltext

Matchings with Lower Quotas: Algorithms and Complexity von Arulselvan, Ashwin, Cseh, Ágnes, Groß, Martin, Manlove, David F., Matuschke, Jannik

“… We study a natural generalization of the maximum weight many-to-one matching problem …”
Volltext

Practical options for selecting data-driven or physics-based prognostics algorithms with reviews von An, Dawn, Kim, Nam H., Choi, Joo-Ho

“… algorithm’s attributes and pros and cons are analyzed in terms of model definition, model parameter estimation and ability to handle noise and bias in data …”
Volltext

Quantum Hamiltonian complexity in thermal equilibrium von Bravyi, Sergey, Chowdhury, Anirban, Gosset, David, Wocjan, Pawel

“… Our algorithm contributes to a body of work investigating the hardness of approximation for difficult optimization problems …”
Volltext

Applications, classifications, and challenges: a comprehensive evaluation of recently developed metaheuristics for search and analysis von Shaikh, Muhammad Suhail, Raj, Saurav, Zheng, Gengzhong, Xie, Senlin, Wang, Chang, Dong, Xiaoqing, Lin, Yifan, Wang, Chunwu, Junejo, Naveed Ur Rehman

“… Metaheuristic algorithms (MAs) are powerful tools for solving complex optimization problems across diverse domains …”
Volltext

An Analysis of the Computational Complexity and Efficiency of Various Algorithms for Solving a Nonlinear Model of Radon Volumetric Activity with a Fractional Derivative of a Variable Order von Tverdyi, Dmitrii

“… The article presents a study of the computational complexity and efficiency of various parallel algorithms that implement the numerical solution of the equation in the hereditary α …”
Volltext

Improving the Kepler optimization algorithm with chaotic maps: comprehensive performance evaluation and engineering applications von El Ghouate, Nawal, Bencherqui, Ahmed, Mansouri, Hanaa, Maloufy, Ahmed El, Tahiri, Mohamed Amine, Karmouni, Hicham, Sayyouri, Mhamed, Askar, S. S., Abouhawwash, Mohamed

“… The Kepler Optimisation Algorithm (KOA) is a recently proposed algorithm that is inspired …”
Volltext

Algorithm for Solving Optimal Arrangement Problem in Connected- (r,s)-out-of- (m,n):F Lattice System von Nakamura, Taishin, Yamamoto, Hisashi

“… In this paper, we develop an improved algorithm for efficiently finding the optimal arrangement of general connected-(r, s)-out-of-(m, n):F lattice systems …”
Volltext

Algorithms for stochastic optimization with function or expectation constraints von Lan, Guanghui, Zhou, Zhiqiang

“… ), to handle problems with the constraint on devision variables. We show that this algorithm exhibits the optimal O ( 1 / ϵ 2 …”
Volltext

Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP von Englert, Matthias, Röglin, Heiko, Vöcking, Berthold

“… Previous probabilistic analyses were restricted to instances in which n points are placed uniformly at random in the unit square [0,1 …”
Volltext

Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization von Lin, Qihang, Ma, Runchao, Xu, Yangyang

“… In this paper, an inexact proximal-point penalty method is studied for constrained optimization problems, where the objective function is non-convex, and the constraint functions can also be non-convex …”
Volltext

Efficient maximum iterations for swarm intelligence algorithms: a comparative study von Si-Ma, Shen, Liu, Han-Ming, Zhan, Hong-Xiang, Liu, Zhao-Fa, Guo, Gang, Yu, Cong, Hu, Peng-Cheng

“… A swarm intelligence algorithm usually iterates many times to approximate the optimum to obtain the solution of a problem …”
Volltext

An analysis of the parameterized complexity of periodic timetabling von Lindner, Niels, Reisch, Julian

“… Public transportation networks are typically operated with a periodic timetable. The periodic event scheduling problem (PESP …”
Volltext

Efficient algorithms for robust and stable principal component pursuit problems von Aybat, Necdet Serhat, Goldfarb, Donald, Ma, Shiqian

“… ) problem is solved to recover the low-rank matrix. In this paper, we develop efficient algorithms with provable iteration complexity bounds for solving RPCP and SPCP …”
Volltext

Trade-Offs in Dynamic Coloring for Bipartite and General Graphs von Kashyop, Manas Jyoti, Narayanaswamy, N. S., Nasre, Meghana, Potluri, Sai Mohith

“… The dynamic coloring problem has gained attention in the recent past. The focus has largely been on obtaining efficient update time algorithms using Δ …”
Volltext