Search Results - "Randomized algorithms"
-
1
Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method
ISSN: 0969-6016, 1475-3995Published: Oxford Blackwell Publishing Ltd 01.09.2024Published in International transactions in operational research (01.09.2024)“…The team orienteering problem (TOP) is an NP‐hard optimization problem with an increasing number of potential applications in smart cities, humanitarian…”
Get full text
Journal Article -
2
A Practical Randomized CP Tensor Decomposition
ISSN: 0895-4798, 1095-7162Published: 01.01.2018Published in SIAM journal on matrix analysis and applications (01.01.2018)Get full text
Journal Article -
3
Randomized algorithms for the approximations of Tucker and the tensor train decompositions
ISSN: 1019-7168, 1572-9044Published: New York Springer US 05.02.2019Published in Advances in computational mathematics (05.02.2019)“…Randomized algorithms provide a powerful tool for scientific computing. Compared with standard deterministic algorithms, randomized algorithms are often faster…”
Get full text
Journal Article -
4
Constraint-Tightening and Stability in Stochastic Model Predictive Control
ISSN: 0018-9286, 1558-2523Published: IEEE 01.07.2017Published in IEEE transactions on automatic control (01.07.2017)“…Constraint tightening to non-conservatively guarantee recursive feasibility and stability in Stochastic Model Predictive Control is addressed. Stability and…”
Get full text
Journal Article -
5
Convergence in total variation for the kinetic Langevin algorithm
ISSN: 2520-2316, 2520-2324Published: 21.08.2025Published in Mathematical statistics and learning (Online) (21.08.2025)“…We prove non-asymptotic total variation estimates for the kinetic Langevin algorithm in high dimension when the target measure satisfies a Poincaré inequality…”
Get full text
Journal Article -
6
On adaptive Linear–Quadratic regulators
ISSN: 0005-1098Published: Elsevier Ltd 01.07.2020Published in Automatica (Oxford) (01.07.2020)“…Performance of adaptive control policies is assessed through the regret with respect to the optimal regulator, which reflects the increase in the operating…”
Get full text
Journal Article -
7
Robust stochastic configuration networks with kernel density estimation for uncertain data regression
ISSN: 0020-0255, 1872-6291Published: Elsevier Inc 01.10.2017Published in Information sciences (01.10.2017)“…Neural networks have been widely used as predictive models to fit data distribution, and they could be implemented through learning a collection of samples. In…”
Get full text
Journal Article -
8
Coordinate descent algorithms
ISSN: 0025-5610, 1436-4646Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2015Published in Mathematical programming (01.06.2015)“…Coordinate descent algorithms solve optimization problems by successively performing approximate minimization along coordinate directions or coordinate…”
Get full text
Journal Article -
9
Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery
ISSN: 0969-6016, 1475-3995Published: Oxford Blackwell Publishing Ltd 01.01.2021Published in International transactions in operational research (01.01.2021)“…In this paper, we consider a vehicle routing problem in which a fleet of homogeneous vehicles, initially located at a depot, has to satisfy customers' demands…”
Get full text
Journal Article -
10
Fault Detection for Non-Gaussian Processes Using Generalized Canonical Correlation Analysis and Randomized Algorithms
ISSN: 0278-0046, 1557-9948Published: New York IEEE 01.02.2018Published in IEEE transactions on industrial electronics (1982) (01.02.2018)“…In this paper, we first study a generalized canonical correlation analysis (CCA)-based fault detection (FD) method aiming at maximizing the fault detectability…”
Get full text
Journal Article -
11
Stochastic Configuration Networks: Fundamentals and Algorithms
ISSN: 2168-2267, 2168-2275, 2168-2275Published: United States IEEE 01.10.2017Published in IEEE transactions on cybernetics (01.10.2017)“…This paper contributes to the development of randomized methods for neural networks. The proposed learner model is generated incrementally by stochastic…”
Get full text
Journal Article -
12
Robust stochastic configuration networks with maximum correntropy criterion for uncertain data regression
ISSN: 0020-0255, 1872-6291Published: Elsevier Inc 01.01.2019Published in Information sciences (01.01.2019)“…This paper develops a robust stochastic configuration network (RSCN) framework to cope with data modelling problems when the given samples contain noises or…”
Get full text
Journal Article -
13
Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
ISSN: 0895-4798, 1095-7162Published: 01.01.2015Published in SIAM journal on matrix analysis and applications (01.01.2015)Get full text
Journal Article -
14
Insights into randomized algorithms for neural networks: Practical issues and common pitfalls
ISSN: 0020-0255, 1872-6291Published: Elsevier Inc 01.03.2017Published in Information sciences (01.03.2017)“…Random Vector Functional-link (RVFL) networks, a class of learner models, can be regarded as feed-forward neural networks built with a specific randomized…”
Get full text
Journal Article -
15
The Algorithmic Leviathan: Arbitrariness, Fairness, and Opportunity in Algorithmic Decision-Making Systems
ISSN: 0045-5091, 1911-0820Published: Edmonton Cambridge University Press 01.01.2022Published in Canadian journal of philosophy (01.01.2022)“…This article examines the complaint that arbitrary algorithmic decisions wrong those whom they affect. It makes three contributions. First, it provides an…”
Get full text
Journal Article -
16
A randomized approach to sensor placement with observability assurance
ISSN: 0005-1098, 1873-2836Published: Elsevier Ltd 01.01.2021Published in Automatica (Oxford) (01.01.2021)“…Given a linear dynamical system, we provide a probabilistic treatment to the classic problem of placing sensors in a set of candidate locations such that the…”
Get full text
Journal Article -
17
The loss of serving in the dark
ISSN: 0020-0190, 1872-6119Published: Elsevier B.V 01.02.2023Published in Information processing letters (01.02.2023)“…We study the following balls and bins stochastic process: There is a buffer with B bins, and there is a stream of balls X=〈X1,X2,…,XT〉 such that Xi is the…”
Get full text
Journal Article -
18
Asymptotic theory of rerandomization in treatment-control experiments
ISSN: 1091-6490, 1091-6490Published: United States 11.09.2018Published in Proceedings of the National Academy of Sciences - PNAS (11.09.2018)“…Although complete randomization ensures covariate balance on average, the chance of observing significant differences between treatment and control covariate…”
Get more information
Journal Article -
19
Application of randomized algorithms to assessment and design of observer-based fault detection systems
ISSN: 0005-1098, 1873-2836Published: Elsevier Ltd 01.09.2019Published in Automatica (Oxford) (01.09.2019)“…This work is an attempt to establish a probabilistic framework for the assessment and design of observer-based fault detection systems. The fundament of our…”
Get full text
Journal Article -
20
Stochastic configuration networks with robust supervised least squares regression
ISSN: 0925-2312Published: Elsevier B.V 28.09.2025Published in Neurocomputing (Amsterdam) (28.09.2025)“…Stochastic Configuration Networks (SCNs) are widely used in regression modeling to fit data distributions due to their fast convergence and powerful learning…”
Get full text
Journal Article