Výsledky vyhledávání - analysis of algorithms and ((problem OR problemy) OR problems) complexity general terms algorithms

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

“…) algorithm, and provide improved results compared to existing works, in terms of oracle complexity…”
Získat plný text

An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms Autor 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…”
Získat plný text

Fast algorithms for non-convex tensor completion problems: Fast algorithms for non-convex tensor completion problems Autor 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…”
Získat plný text

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

A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems Autor 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…”
Získat plný text

A survey on evolutionary computation for complex continuous optimization Autor 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…”
Získat plný text

Algorithm for Solving Optimal Arrangement Problem in Connected- (r,s)-out-of- (m,n):F Lattice System Autor 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…”
Získat plný text

Practical options for selecting data-driven or physics-based prognostics algorithms with reviews Autor 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…”
Získat plný text

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

“… ( n , k ) time by characterizing the structure that different algorithms require in terms of simple variants of the dual feasibility oracle…”
Získat plný text

Matchings with Lower Quotas: Algorithms and Complexity Autor 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…”
Získat plný text

Improving the Kepler optimization algorithm with chaotic maps: comprehensive performance evaluation and engineering applications Autor 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…”
Získat plný text

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 Autor 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 α…”
Získat plný text

Applications, classifications, and challenges: a comprehensive evaluation of recently developed metaheuristics for search and analysis Autor 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…”
Získat plný text

Efficient algorithms for robust and stable principal component pursuit problems Autor 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…”
Získat plný text

Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP Autor 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…”
Získat plný text

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

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

Communication-efficient algorithms for decentralized and stochastic optimization Autor Lan, Guanghui, Lee, Soomin, Zhou, Yi

“…We present a new class of decentralized first-order methods for nonsmooth and stochastic optimization problems defined over multiagent networks…”
Získat plný text

Merge Nondominated Sorting Algorithm for Many-Objective Optimization Autor Moreno, Javier, Rodriguez, Daniel, Nebro, Antonio J., Lozano, Jose A.

“… particularly in the case of dealing with many-objective optimization problems. In this article, we present a new efficient algorithm for computing the nondominated sorting procedure, called merge nondominated sorting (MNDS…”
Získat plný text

Efficient maximum iterations for swarm intelligence algorithms: a comparative study Autor 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…”
Získat plný text

Interpretable Rule Discovery Through Bilevel Optimization of Split-Rules of Nonlinear Decision Trees for Classification Problems Autor Dhebar, Yashesh, Deb, Kalyanmoy

“…For supervised classification problems involving design, control, and other practical purposes, users are not only interested in finding a highly accurate classifier but they also demand…”
Získat plný text