407 results
Search Results
2. Zeroth and First Order Stochastic Frank-Wolfe Algorithms for Constrained Optimization.
- Author
-
Akhtar, Zeeshan and Rajawat, Ketan
- Subjects
STOCHASTIC orders ,MATHEMATICAL optimization ,SEMIDEFINITE programming ,NP-hard problems ,SPARSE matrices ,CONSTRAINED optimization ,DETERMINISTIC algorithms ,ALGORITHMS - Abstract
This paper considers stochastic convex optimization problems with two sets of constraints: (a) deterministic constraints on the domain of the optimization variable, which are difficult to project onto; and (b) deterministic or stochastic constraints that admit efficient projection. Problems of this form arise frequently in the context of semidefinite programming as well as when various NP-hard problems are solved approximately via semidefinite relaxation. Since projection onto the first set of constraints is difficult, it becomes necessary to explore projection-free algorithms, such as the stochastic Frank-Wolfe (FW) algorithm. On the other hand, the second set of constraints cannot be handled in the same way, and must be incorporated as an indicator function within the objective function, thereby complicating the application of FW methods. Similar problems have been studied before; however, they suffer from slow convergence rates. This work, equipped with momentum based gradient tracking technique, guarantees fast convergence rates on par with the best-known rates for problems without the second set of constraints. Zeroth-order variants of the proposed algorithms are also developed and again improve upon the state-of-the-art rate results. We further propose the novel trimmed FW variants that enjoy the same convergence rates as their classical counterparts, but are empirically shown to require significantly fewer calls to the linear minimization oracle speeding up the overall algorithm. The efficacy of the proposed algorithms is tested on relevant applications of sparse matrix estimation, clustering via semidefinite relaxation, and uniform sparsest cut problem. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
3. Joint Optimization of Beamforming, Phase-Shifting and Power Allocation in a Multi-Cluster IRS-NOMA Network.
- Author
-
Xie, Ximing, Fang, Fang, and Ding, Zhiguo
- Subjects
ALGORITHMS ,SEARCH algorithms ,ARRAY processing ,ENERGY consumption ,MATHEMATICAL optimization - Abstract
The combination of non-orthogonal multiple access (NOMA) and intelligent reflecting surface (IRS) is an efficient solution to significantly enhance the energy efficiency of the wireless communication system. In this paper, a downlink multi-cluster NOMA network is considered, where each cluster is supported by one IRS. This paper aims to minimize the transmit power by jointly optimizing the beamforming, the power allocation and the phase shift of each IRS. The formulated problem is non-convex and challenging to be solved due to the coupled variables, i.e., the beamforming vector, the power allocation coefficient and the phase shift matrix. To address this non-convex problem, an alternating optimization based algorithm is proposed. Specifically, the primal problem is divided into two subproblems for beamforming optimization and phase shifting feasiblity, where the two subproblems are solved iteratively. Moreover, to guarantee the feasibility of the beamforming optimization problem, an iterative algorithm is proposed to search the feasible initial points. To reduce the complexity, a simplified algorithm based on partial exhaustive search for this system model is also proposed. Simulation results demonstrate that the proposed alternating algorithm can yield a better performance gain than the partial exhaustive search algorithm, NOMA with random IRS phase shift scheme and OMA-IRS scheme. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
4. Dynamic AP Clustering and Precoding for User-Centric Virtual Cell Networks.
- Author
-
Jianfeng Shi, Ming Chen, Wence Zhang, Zhaohui Yang, and Hao Xu
- Subjects
PARTICLE swarm optimization ,FEMTOCELLS ,ALGORITHMS ,MEAN square algorithms ,MATHEMATICAL optimization - Abstract
This paper investigates the dynamic access point (AP) clustering and precoding problem in the downlink of user-centric virtual cell networks. The goal is to maximize the weighted sum spectral efficiency (SE) while satisfying the power constraints and AP clustering constraints in adjacent time slots (TSs). By adopting the random walk mobility to model the mobile user equipments’ movement behaviors, we consider dynamic and time-varying channel conditions. Therefore, the weighted sum SE maximization programming takes the form of discrete-time sequence of mixed-integer non-convex optimization problems. In this paper, we propose to solve this sequential problem in two stages. In the first stage, a dynamic AP clustering approach based on discrete particle swarm optimization is developed. This approach takes the advantage of the channel correlation by exploiting the relationship between AP clustering solutions in adjacent TSs to improve the SE performance and reduce complexity. In the second stage, given the AP clustering solution obtained in the first stage, a distributed precoding algorithm is devised via applying the weighted minimum mean square error method. By combining these two stages, we propose a novel dynamic AP clustering and precoding algorithm (DAPC-Pre). The effectiveness of the proposed DAPC-Pre algorithm is verified by the simulation results. In particular, the proposed algorithm converges fast and significantly outperforms benchmark algorithms in terms of sum SE under different dynamic environments. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
5. LookCom : Learning Optimal Network for Community Detection.
- Author
-
Dong, Yixiang, Luo, Minnan, Li, Jundong, Cai, Deng, and Zheng, Qinghua
- Subjects
MATHEMATICAL optimization ,COMPUTATIONAL complexity ,TOPOLOGY ,ALGORITHMS ,TASK analysis - Abstract
Community detection is one of the fundamental tasks in graph mining, which aims to identify group assignment of nodes in a complex network. Recently, network embedding techniques have demonstrated their strong power in advancing the community detection task and achieve better performance than various traditional methods. Despite their empirical success, most of the existing algorithms directly leverage the observed coarse network structure for community detection. Therefore, they often lead to suboptimal performance as the observed connections fail to capture the essential tie strength information among nodes precisely and account for the impact of noisy links. In this paper, an optimal network structure for community detection is introduced to characterize the fine-grained tie strength information between connected nodes and alleviate the adverse effects of noisy links. To obtain an expressive node representation for community detection, we learn the optimal network structure and network embeddings in a joint framework, instead of using a two-stage approach to derive the node embeddings from the coarse network topology. In particular, we formulate the joint framework as an optimization problem and an alternating optimization algorithm is exploited to solve the proposed optimization problem. Additionally, theoretical analyses regarding the computational complexity and the convergence of the optimization algorithm are also provided. Extensive experiments on both synthetic and real-world networks demonstrate the effectiveness and superiority of the proposed framework. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
6. A New Two-Stage Evolutionary Algorithm for Many-Objective Optimization.
- Author
-
Sun, Yanan, Xue, Bing, Zhang, Mengjie, and Yen, Gary G.
- Subjects
EVOLUTIONARY algorithms ,MATHEMATICAL optimization ,BENCHMARK problems (Computer science) ,EVOLUTIONARY computation ,GENETIC algorithms ,HEURISTIC algorithms ,ALGORITHMS - Abstract
Convergence and diversity are interdependently handled during the evolutionary process by most existing many-objective evolutionary algorithms (MaOEAs). In such a design, the degraded performance of one would deteriorate the other, and only solutions with both are able to improve the performance of MaOEAs. Unfortunately, it is not easy to constantly maintain a population of solutions with both convergence and diversity. In this paper, an MaOEA based on two independent stages is proposed for effectively solving many-objective optimization problems (MaOPs), where the convergence and diversity are addressed in two independent and sequential stages. To achieve this, we first propose a nondominated dynamic weight aggregation method by using a genetic algorithm, which is capable of finding the Pareto-optimal solutions for MaOPs with concave, convex, linear and even mixed Pareto front shapes, and then these solutions are employed to learn the Pareto-optimal subspace for the convergence. Afterward, the diversity is addressed by solving a set of single-objective optimization problems with reference lines within the learned Pareto-optimal subspace. To evaluate the performance of the proposed algorithm, a series of experiments are conducted against six state-of-the-art MaOEAs on benchmark test problems. The results show the significantly improved performance of the proposed algorithm over the peer competitors. In addition, the proposed algorithm can focus directly on a chosen part of the objective space if the preference area is known beforehand. Furthermore, the proposed algorithm can also be used to effectively find the nadir points. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
7. Distributed Stochastic Consensus Optimization With Momentum for Nonconvex Nonsmooth Problems.
- Author
-
Wang, Zhiguo, Zhang, Jiawei, Chang, Tsung-Hui, Li, Jian, and Luo, Zhi-Quan
- Subjects
DISTRIBUTED algorithms ,ALGORITHMS ,NONSMOOTH optimization ,MATHEMATICAL optimization ,RADIO frequency ,MOMENTUM transfer - Abstract
While many distributed optimization algorithms have been proposed for solving smooth or convex problems over the networks, few of them can handle non-convex and non-smooth problems. Based on a proximal primal-dual approach, this paper presents a new (stochastic) distributed algorithm with Nesterov momentum for accelerated optimization of non-convex and non-smooth problems. Theoretically, we show that the proposed algorithm can achieve an $\epsilon$ -stationary solution under a constant step size with $\mathcal {O}(1/\epsilon ^2)$ computation complexity and $\mathcal {O}(1/\epsilon)$ communication complexity when the epigraph of the non-smooth term is a polyhedral set. When compared to the existing gradient tracking based methods, the proposed algorithm has the same order of computation complexity but lower order of communication complexity. To the best of our knowledge, the presented result is the first stochastic algorithm with the $\mathcal {O}(1/\epsilon)$ communication complexity for non-convex and non-smooth problems. Numerical experiments for a distributed non-convex regression problem and a deep neural network based classification problem are presented to illustrate the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
8. Joint Subchannel Allocation and Power Control in Licensed and Unlicensed Spectrum for Multi-Cell UAV-Cellular Network.
- Author
-
Matar, Amr S. and Shen, Xuemin
- Subjects
DRONE aircraft ,NP-hard problems ,ALGORITHMS ,MATHEMATICAL optimization ,RESOURCE management - Abstract
In this paper, we investigate the resource and interference management problem in a novel scenario where multiple unmanned aerial vehicle base stations (UAV-BSs) provide cellular services to UAV users (UAV-UEs) by reusing both licensed and unlicensed spectrum. Considering the co-existence of terrestrial cellular, WiFi and UAV-BSs, a joint optimization problem is formulated for both subchannel allocation and power control of UAV-UEs over the licensed/unlicensed spectrum in order to maximize the uplink sum-rate of the multi-cell UAV-cellular network. Since the formulated problem is NP-hard, we decompose it into three sub-problems. Specifically, we first use the convex optimization and the Hungarian algorithm to obtain the global optimal of power and subchannel allocations in the licensed spectrum, respectively. Then, we propose a matching game with externalities and coalition game algorithms to obtain the Nash stable of the subchannel allocation in the unlicensed band. Local optimal power assignment in the unlicensed spectrum is obtained using the successive convex approximation (SCA) method. An iterative algorithm is thereby developed to solve the three sub-problems sequentially till reaching convergence. Simulation results show that the proposed algorithm can improve the network capacity by nearly two times than the Long Term Evolution-Advanced (LTE-A). [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
9. Multiclass Learning-Aided Temporal Decomposition and Distributed Optimization for Power Systems.
- Author
-
Safdarian, Farnaz, Kargarian, Amin, and Hasan, Fouad
- Subjects
MATHEMATICAL optimization ,DISTRIBUTED computing ,ELECTRICITY pricing ,ALGORITHMS ,DISTRIBUTED algorithms ,CLASSIFICATION algorithms ,GRID computing - Abstract
Temporal decomposition is a potential approach to relieve the computation cost of power system multi-interval scheduling problems, such as economic dispatch. In this form of decomposition, the considered scheduling horizon is partitioned into several subhorizons. A subproblem is formulated for each subhorizon, and a distributed optimization algorithm strategy is used to coordinate subproblems. The main existing challenge is decomposing the scheduling horizon to gain the most time saving from distributed computing. This paper serves as an extension to our previous work and presents a machine learning-aided temporal decomposition strategy to partition a scheduling horizon optimally. We have found that the load profile, known before solving economic dispatch, significantly affects the best number of subhorizons. We have used load profiles as inputs to a learner whose goal is to assign a temporal decomposition class to each load profile. Possible decomposition classes are divisors of the considered scheduling horizon. Thus, the proposed learning procedure is a multiclass classification. We have selected Extreme Gradient Boosting that is a tree-based classification learner. Simulation results using real-world load profiles show the promising performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
10. Robust Optimization Over Time by Learning Problem Space Characteristics.
- Author
-
Yazdani, Danial, Nguyen, Trung Thanh, and Branke, Jurgen
- Subjects
ROBUST optimization ,PARTICLE swarm optimization ,MATHEMATICAL optimization ,FINITE element method ,ALGORITHMS - Abstract
Robust optimization over time is a new way to tackle dynamic optimization problems where the goal is to find solutions that remain acceptable over an extended period of time. The state-of-the-art methods in this domain try to identify robust solutions based on their future predicted fitness values. However, predicting future fitness values is difficult and error prone. In this paper, we propose a new framework based on a multipopulation method in which subpopulations are responsible for tracking peaks and also gathering characteristic information about them. When the quality of the current robust solution falls below the acceptance threshold, the algorithm chooses the next robust solution based on the collected information. We propose four different strategies to select the next solution. The experimental results on benchmark problems show that our newly proposed methods perform significantly better than existing algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
11. A Q-Learning Based Energy Threshold Optimization Algorithm in LAA Networks.
- Author
-
Pei, Errong, Zhou, Lineng, Deng, Bingguang, Lu, Xun, Li, Yun, and Zhang, Zhizhong
- Subjects
THRESHOLD energy ,MATHEMATICAL optimization ,MULTICASTING (Computer networks) ,REWARD (Psychology) ,REINFORCEMENT learning ,ALGORITHMS - Abstract
The energy detection technology is recommended in the licensed assisted access (LAA) scheme by 3GPP because of its simplicity and low cost. However, due to its inherent limitation, there may exist imperfect channel detection, which can lead to the decrease of the channel utilization efficiency and the deterioration of fairness. The imperfect detection can generally be represented by the detection probability and false alarm probability, which depend on detection time, signal to noise ration (SNR), sampling rate and energy threshold. However, among the parameters, only the energy threshold can be dominated by LAA small base stations (SBSs) in the LAA scheme. Therefore, the energy threshold should be dynamically adjusted in the changeable channel environment such that the detection accuracy can improved as high as possible. Consider the fact that the optimization theory cannot be used to optimize the energy threshold since the expressions of performance indexes about the energy threshold are extremely complex, a Q-learning based energy threshold optimization algorithm (QLET) is thus proposed in the paper, where LAA SBSs act as the agent, the energy threshold is defined as the agent action, the different combinations of fairness and throughput are defined as the agent states, and the fairness and the reward function are also redefined. In order to ensure the smooth implementation of the proposed QLET algorithm, the information exchange mechanism, where the sending-confirmation mechanism and 1- persistent CSMA are used, is also proposed. Based on the proposed QL framework, the agent can learn the optimal energy threshold by repeatedly interacting with the environment, which enables the coexistence system to obtain the best coexistence performance. A large number of simulation results show that the proposed QLET is superior to the traditional fixed energy threshold scheme (FET) in terms of the fairness, WiFi collision probability and transmission delay, and that QLET is almost the same as FET in term of throughput. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
12. Reconfigurable Intelligent Surface Assisted Multiuser MISO Systems Exploiting Deep Reinforcement Learning.
- Author
-
Huang, Chongwen, Mo, Ronghong, and Yuen, Chau
- Subjects
REINFORCEMENT learning ,DEEP learning ,MULTIUSER computer systems ,ALGORITHMS ,SOFTWARE radio ,WIRELESS communications ,MATHEMATICAL optimization - Abstract
Recently, the reconfigurable intelligent surface (RIS), benefited from the breakthrough on the fabrication of programmable meta-material, has been speculated as one of the key enabling technologies for the future six generation (6G) wireless communication systems scaled up beyond massive multiple input multiple output (Massive-MIMO) technology to achieve smart radio environments. Employed as reflecting arrays, RIS is able to assist MIMO transmissions without the need of radio frequency chains resulting in considerable reduction in power consumption. In this paper, we investigate the joint design of transmit beamforming matrix at the base station and the phase shift matrix at the RIS, by leveraging recent advances in deep reinforcement learning (DRL). We first develop a DRL based algorithm, in which the joint design is obtained through trial-and-error interactions with the environment by observing predefined rewards, in the context of continuous state and action. Unlike the most reported works utilizing the alternating optimization techniques to alternatively obtain the transmit beamforming and phase shifts, the proposed DRL based algorithm obtains the joint design simultaneously as the output of the DRL neural network. Simulation results show that the proposed algorithm is not only able to learn from the environment and gradually improve its behavior, but also obtains the comparable performance compared with two state-of-the-art benchmarks. It is also observed that, appropriate neural network parameter settings will improve significantly the performance and convergence rate of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
13. Topology Adaptive Sum Rate Maximization in the Downlink of Dynamic Wireless Networks.
- Author
-
Sugathapala, Inosha, Hanif, Muhammad Fainan, Lorenzo, Beatriz, Glisic, Savo, Juntti, Markku, and Tran, Le-Nam
- Subjects
ADAPTIVE routing (Computer network management) ,QUALITY of service ,MATHEMATICAL optimization ,ALGORITHMS ,WIRELESS communications - Abstract
Dynamic network architectures (DNAs) have been developed under the assumption that some terminals can be converted into temporary access points (APs) anytime when connected to the Internet. In this paper, we consider the problem of assigning a group of users to a set of potential APs with the aim to maximize the downlink system throughput of DNA networks, subject to total transmit power and users’ quality of service (QoS) constraints. In our first method, we relax the integer optimization variables to be continuous. The resulting non-convex continuous optimization problem is solved using successive convex approximation framework to arrive at a sequence of second-order cone programs (SOCPs). In the next method, the selection process is viewed as finding a sparsity constrained solution to our problem of sum rate maximization. It is demonstrated in numerical results that while the first approach has better data rates for dense networks, the sparsity oriented method has a superior speed of convergence. Moreover, for the scenarios considered, in addition to comprehensively outperforming some well-known approaches, our algorithms yield data rates close to those obtained by branch and bound method. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
14. Decentralized Implementation of Unit Commitment With Analytical Target Cascading: A Parallel Approach.
- Author
-
Kargarian, Amin, Mehrtash, Mahdi, and Falahati, Bamdad
- Subjects
ELECTRIC power systems ,ALGORITHMS ,COMMUNICATION ,MATHEMATICAL optimization ,NUMERICAL analysis - Abstract
This paper presents a decentralized solution algorithm for network-constrained unit commitment (NCUC) in multiregional power systems. The proposed algorithm is based on our previous work in which a local NCUC was formulated for each control entity (i.e., region) and an analytical target cascading (ATC) based distributed but partially parallelized algorithm requiring a central coordinator was presented. The primary objective of this paper is to present a decentralized approach that relaxes the need for any form of central coordinator in ATC and allows fully parallelized solutions of the local NCUCs. To achieve this objective, we formulate a bilevel optimization problem for each control entity. While the upper level solves the NCUC problem of the control entity, the lower level seeks to coordinate the control entity with its neighboring regions. The lower level is a convex optimization, which can be further replaced in the upper level problem by the Karush–Kuhn–Tucker conditions. The control entities communicate directly with each other and synchronously solve their local NCUCs. Having no need for any form of central coordinator, the proposed algorithm is potentially less vulnerable to cyber-attacks and communication failures than the distributed methods utilizing a coordinator. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
15. Zoomless Maps: External Labeling Methods for the Interactive Exploration of Dense Point Sets at a Fixed Map Scale.
- Author
-
Gedicke, Sven, Bonerath, Annika, Niedermann, Benjamin, and Haunert, Jan-Henrik
- Subjects
POINT set theory ,LABELS ,FEATURE selection ,MATHEMATICAL optimization ,CARTOGRAPHY - Abstract
Visualizing spatial data on small-screen devices such as smartphones and smartwatches poses new challenges in computational cartography. The current interfaces for map exploration require their users to zoom in and out frequently. Indeed, zooming and panning are tools suitable for choosing the map extent corresponding to an area of interest. They are not as suitable, however, for resolving the graphical clutter caused by a high feature density since zooming in to a large map scale leads to a loss of context. Therefore, in this paper, we present new external labeling methods that allow a user to navigate through dense sets of points of interest while keeping the current map extent fixed. We provide a unified model, in which labels are placed at the boundary of the map and visually associated with the corresponding features via connecting lines, which are called leaders. Since the screen space is limited, labeling all features at the same time is impractical. Therefore, at any time, we label a subset of the features. We offer interaction techniques to change the current selection of features systematically and, thus, give the user access to all features. We distinguish three methods, which allow the user either to slide the labels along the bottom side of the map or to browse the labels based on pages or stacks. We present a generic algorithmic framework that provides us with the possibility of expressing the different variants of interaction techniques as optimization problems in a unified way. We propose both exact algorithms and fast and simple heuristics that solve the optimization problems taking into account different criteria such as the ranking of the labels, the total leader length as well as the distance between leaders. In experiments on real-world data we evaluate these algorithms and discuss the three variants with respect to their strengths and weaknesses proving the flexibility of the presented algorithmic framework. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
16. Binary MIMO Detection via Homotopy Optimization and Its Deep Adaptation.
- Author
-
Shao, Mingjie and Ma, Wing-Kin
- Subjects
MIMO systems ,COMPUTATIONAL complexity ,MATHEMATICAL optimization ,ENERGY consumption ,ALGORITHMS - Abstract
In this paper we consider maximum-likelihood (ML) MIMO detection under one-bit quantized observations and binary symbol constellations. This problem is motivated by the recent interest in adopting coarse quantization in massive MIMO systems—as an effective way to scale down the hardware complexity and energy consumption. Classical MIMO detection techniques consider unquantized observations, and many of them are not applicable to the one-bit MIMO case. We develop a new non-convex optimization algorithm for the one-bit ML MIMO detection problem, using a strategy called homotopy optimization. The idea is to transform the ML problem into a sequence of approximate problems, from easy (convex) to hard (close to ML), and with each problem being a gradual modification of its previous. Then, our attempt is to iteratively trace the solution path of these approximate problems. This homotopy algorithm is well suited to the application of deep unfolding, a recently popular approach for turning certain model-based algorithms into data-driven, and performance enhanced, ones. While our initial focus is on one-bit MIMO detection, the proposed technique also applies naturally to the classical unquantized MIMO detection. We performed extensive simulations and show that the proposed homotopy algorithms, both non-deep and deep, have satisfactory bit-error probability performance compared to many state-of-the-art algorithms. Also, the deep homotopy algorithm has attractively low computational complexity. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
17. Compressed Gradient Methods With Hessian-Aided Error Compensation.
- Author
-
Khirirat, Sarit, Magnusson, Sindri, and Johansson, Mikael
- Subjects
MATHEMATICAL optimization ,BIG data ,MACHINE learning ,APPROXIMATION algorithms ,ALGORITHMS ,HESSIAN matrices - Abstract
The emergence of big data has caused a dramatic shift in the operating regime for optimization algorithms. The performance bottleneck, which used to be computations, is now often communications. Several gradient compression techniques have been proposed to reduce the communication load at the price of a loss in solution accuracy. Recently, it has been shown how compression errors can be compensated for in the optimization algorithm to improve the solution accuracy. Even though convergence guarantees for error-compensated algorithms have been established, there is very limited theoretical support for quantifying the observed improvements in solution accuracy. In this paper, we show that Hessian-aided error compensation, unlike other existing schemes, avoids accumulation of compression errors on quadratic problems. We also present strong convergence guarantees of Hessian-based error compensation for stochastic gradient descent. Our numerical experiments highlight the benefits of Hessian-based error compensation, and demonstrate that similar convergence improvements are attained when only a diagonal Hessian approximation is used. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
18. A Method for Estimating the Probability of Extremely Rare Accidents in Complex Systems.
- Author
-
Romani de Oliveira, Italo and Musiak, Jeffery
- Subjects
PARAMETER identification ,MATHEMATICAL optimization ,PROBABILITY theory ,ACCIDENTS ,STOCHASTIC processes ,NEEDS assessment - Abstract
Estimating the probability of failures or accidents with aerospace systems is often necessary when new concepts or designs are introduced, as it is being done for autonomous aircraft. If the design is safe, as it is supposed to be, accident cases are hard to find. Such analysis needs some variance reduction technique and several algorithms exist for that; however, specific model features may cause difficulties in practice, such as the case of system models where independent agents have to autonomously accomplish missions within finite time, and likely with the presence of human agents. For handling these scenarios, this paper presents a novel estimation approach, based on the combination of the well-established variation reduction technique of interacting particles system with the long-standing optimization algorithm denominated DIviding RECTangles. When combined, these two techniques yield statistically significant results for extremely low probabilities. In addition, this novel approach allows the identification of intermediate events and simplifies the evaluation of sensitivity of the estimated probabilities to certain system parameters. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
19. Sparsity Optimization Method for Slow-Moving Landslides Detection in Satellite Image Time-Series.
- Author
-
Pham, Mai Quyen, Lacroix, Pascal, and Doin, Marie Pierre
- Subjects
LANDSLIDES ,TIME series analysis ,MATHEMATICAL optimization ,LANDSLIDE prediction ,ALGORITHMS ,BEES algorithm - Abstract
This paper presents a new method based on recent optimization technique to detect slow-moving landslides (<150m/year) in time series of displacement field generated by satellite images. Sparse optimization is applied simultaneously on the 3-D data set in space as well as in time. The proposed method takes into account the distinctive signal physical properties in space and time, by enforcing a sparse representation by blocks in space, but a continuing and monotonous representation in time of the landslides. As a result, we show that a mixed $\ell _{1,2}$ -norm is the most suitable norm for this detection problem, compared to pure $\ell _{1}$ -norm or $\ell _{2}$ -norm. Moreover, an outlier estimation step is included that sets apart the Gaussian noise from locally sparse processing errors in the data. The performance of this approach is tested by applying it both on synthetic data and on a time series of displacements fields over 16 dates in the Colca Valley, Peru. This detection presents commission and omission errors for landslides of 29% and 14%, respectively, using a medium resolution (10 m) data set of optical satellite images. It detects all important landslides, already known from field investigations. Moreover, it also points out other smaller or unknown landslides, increasing the existing slow-moving landslide inventory by +50%. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
20. Adaptive Synthesis for Resonator-Coupled Filters Based on Particle Swarm Optimization.
- Author
-
Luo, Xun, Yang, Bingzheng, and Qian, Huizhen Jenny
- Subjects
PARTICLE swarm optimization ,BANDPASS filters ,MATHEMATICAL optimization ,SIMULATION methods & models ,BANDWIDTHS ,ALGORITHMS - Abstract
In this paper, an adaptive synthesis using the particle swarm optimization (PSO) for implementations of resonator-coupled filters is proposed. The coupling matrix of in-band filtering response is achieved and optimized by the PSO-based synthesis. Meanwhile, the stopband coupling matrix of the filter is predicted based on the combination of extra resonant nodes representing stopband spurious and parasitic effect of input/output ports. In addition, an enhanced accurate prediction of filter performance is calculated by the proposed approach, considering the practical fabrication tolerance on filter design. To verify principles mentioned earlier, various resonator-coupled filters are implemented. The calculation, EM-simulation, and measurement of filters show good agreements in both passband and stopband. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
21. Multiproblem Surrogates: Transfer Evolutionary Multiobjective Optimization of Computationally Expensive Problems.
- Author
-
Min, Alan Tan Wei, Ong, Yew-Soon, Gupta, Abhishek, and Goh, Chi-Keong
- Subjects
EVOLUTIONARY algorithms ,HEAT transfer ,ALGORITHMS ,MATHEMATICAL optimization ,GENETIC algorithms - Abstract
In most real-world settings, designs are often gradually adapted and improved over time. Consequently, there exists knowledge from distinct (but possibly related) design exercises, which have either been previously completed or are currently in-progress, that may be leveraged to enhance the optimization performance of a particular target optimization task of interest. Further, it is observed that modern day design cycles are typically distributed in nature, and consist of multiple teams working on associated ideas in tandem. In such environments, vast amounts of related information can become available at various stages of the search process corresponding to some ongoing target optimization exercise. Successfully exploiting this knowledge is expected to be of significant value in many practical settings, where solving an optimization problem from scratch may be exorbitantly costly or time consuming. Accordingly, in this paper, we propose an adaptive knowledge reuse framework for surrogate-assisted multiobjective optimization of computationally expensive problems, based on the novel idea of multiproblem surrogates. This idea provides the capability to acquire and spontaneously transfer learned models across problems, facilitating efficient global optimization. The efficacy of our proposition is demonstrated on a series of synthetic benchmark functions, as well as two practical case studies. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
22. Tensor Completion From One-Bit Observations.
- Author
-
Li, Baohua, Zhang, Xiaoning, Li, Xiaoli, and Lu, Huchuan
- Subjects
TENSOR algebra ,ARTIFICIAL intelligence ,MATHEMATICAL optimization ,ALGORITHMS ,ARTIFICIAL neural networks - Abstract
The tensor completion issues have obtained a great deal of attention in the past few years. However, the data fidelity part minimizes a squared loss function, which may be inappropriate for the case of noisy one-bit observations. In this paper, we alleviate the mentioned difficulty by drawing on the experience of matrix scenarios. Based on the convex relation to $\ell _{1}$ norm of the tensor multi-rank, we propose a novel optimization model trying to recover the underlying tensor in case of one-bit observations. The feasibility of this model is proved by theoretical derivations. Furthermore, an alternating direction method of multipliers based algorithm is designed to find the solution. The numerical experiments demonstrate the effectiveness of our method. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
23. Acceleration of Gradient-Based Algorithms for Array Antenna Synthesis With Far-Field or Near-Field Constraints.
- Author
-
Prado, Daniel R., Vaquero, Alvaro F., Arrebola, Manuel, Pino, Marcos R., and Las-Heras, Fernando
- Subjects
FRAUNHOFER region (Electromagnetism) ,ALGORITHMS ,MATHEMATICAL optimization ,FINITE element method ,ANTENNA arrays - Abstract
This paper presents a technique for the acceleration of gradient-based algorithms that employ finite differences in the calculation of the gradient for the optimization of array antennas. It is based on differential contributions, which takes advantage of the fact that when an array is optimized, each element is analyzed independently of the rest. Thus, the computation of the gradient of the cost function, which is typically the most time-consuming operation of the algorithm, can be accelerated. A time cost study is presented and the technique is implemented, as an example, in the generalized intersection approach algorithm for array optimization in near and far fields. Several syntheses are performed to assess the improvement of this technique. In the far field, it is compared with periodic and aperiodic arrays using different approaches for the computation of the gradient, including the analytic derivative. A reflectarray is also optimized in the near field with the goal of improving its quiet zone. The technique of differential contributions shows the important reductions in the time per iteration in all three syntheses, especially in that of aperiodic arrays and near-field optimization, where the time saved in the evaluation of the gradient is greater than 99%. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
24. Robust Energy and Reserve Scheduling Considering Bulk Energy Storage Units and Wind Uncertainty.
- Author
-
Cobos, Noemi G., Arroyo, Jose M., Alguacil, Natalia, and Wang, Jianhui
- Subjects
ENERGY storage ,MATHEMATICAL optimization ,ALGORITHMS ,RENEWABLE energy sources ,ELECTRIC power distribution - Abstract
In the restructured power industry, bulk energy storage may play a crucial role to provide the flexibility required by system operators to cater for the unprecedented levels of uncertainty. Within the context of co-optimized electricity markets for energy and reserves under wind uncertainty, this paper addresses the incorporation of bulk energy storage units in day-ahead network-constrained energy and reserve scheduling. A novel two-stage robust optimization approach is presented whereby the nonconvex and time-coupled operation of storage devices is precisely modeled while accounting for the anticipativity of the two-stage setting. The resulting robust counterpart is cast as a mixed-integer trilevel program with lower-level binary variables. In order to address the nonconvexity of the recourse problem, this paper proposes the application of an exact nested column-and-constraint generation algorithm. Numerical results illustrate the effective performance of the proposed approach. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
25. Pilot-Efficient Scheduling for Large-Scale Antenna Aided Massive Machine-Type Communications: A Cross-Layer Approach.
- Author
-
Xie, Zhanyuan and Chen, Wei
- Subjects
CHANNEL estimation ,MATHEMATICAL optimization ,ANTENNAS (Electronics) ,SCHEDULING ,COMPUTER scheduling ,ALGORITHMS - Abstract
Large-Scale Antenna System (LSAS) has played an important role in the emerging fifth-generation mobile systems (5G) due to its potential for excellent spectral efficiency. However, it may cause a mass of pilot overhead that is not conducive to the application of LSAS in massive Machine-Type Communications (mMTC), one of three typical traffic modes of 5G. In this paper, we present a pilot-efficient scheduling strategy for mMTC systems, in which the Base Stations (BS) are equipped with large-scale antennas, from a cross-layer perspective. Our scheme can not only schedule the massive devices to access the spectrum, but also allocate the BS’ power without the need for much pilot overhead. More particularly, the users allowed to access the spectrum can be selected based on their queue state information without any channel estimations, while the power allocation only needs the channel estimations for scheduled users. We shall show the optimality of the presented policy based on the Lyapunov optimization theory. To solve the Lyapunov optimization problem, we present a low complexity two-layer iteration algorithm for more practical purposes. Simulation results demonstrate the substantial gain of our presented method over existing scheduling protocols of massive MIMO. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
26. SDP-IGD: An Iterative Power Allocation Technique for Cluster-Based Multihop Vehicular Communications.
- Author
-
Alam, Md Zahangir, Adhicandra, Iwan, Khan, Komal S., and Jamalipour, Abbas
- Subjects
LAGRANGE multiplier ,MATHEMATICAL optimization ,ALGORITHMS ,SIGNAL detection ,SPREAD spectrum communications ,BANDWIDTH allocation - Abstract
This paper addresses the formulation of power allocation for cluster based multihop vehicular relaying communications in order to improve the network quality-of-services (QoS). The cluster-to-cluster (C2C) channel is completely depend on the power gain of vehicle-to-vehicle (V2V) channel that increases the difficulties of the power allocation problem. To meet this goal, we have derived a global channel obtained by joint V2V and C2C cooperation. The most challenging aspect is however the joint V2V and C2C power allocation of the global channel due to the association of its multi-variables objective function. To solve this problem, we apply an alternative optimization technique to make the global problem into a series of sub-problems. We then apply a semi-definite programming (SDP)-based iterative gradient descent (SDP-IGD) power allocation to assign power in each relay. The SDP-IGD power allocation algorithm has been extended from Lagrange Multiplier (LM) that provides better performance than separate LM technique. The minimum mean-square error (MMSE)-decision feedback equalizer (MMSE-DFE) is designed at the receiver to improve the signal detection capability under exact channel state information (CSI) in all forward-and-backward links. Finally, simulation results confirm that our proposed solution performs significantly superior compared to other solutions found in the literature. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
27. Guaranteed Matrix Completion via Non-Convex Factorization.
- Author
-
Sun, Ruoyu and Luo, Zhi-Quan
- Subjects
MATRICES (Mathematics) ,FACTORIZATION ,MATHEMATICAL optimization ,ALGORITHMS ,RESAMPLING (Statistics) - Abstract
Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization, even with huge size, can be solved very efficiently through the standard optimization algorithms in practice. However, due to the non-convexity caused by the factorization model, there is a limited theoretical understanding of whether these algorithms will generate a good solution. In this paper, we establish a theoretical guarantee for the factorization-based formulation to correctly recover the underlying low-rank matrix. In particular, we show that under similar conditions to those in previous works, many standard optimization algorithms converge to the global optima of a factorization-based formulation and recover the true low-rank matrix. We study the local geometry of a properly regularized objective and prove that any stationary point in a certain local region is globally optimal. A major difference of this paper from the existing results is that we do not need resampling (i.e., using independent samples at each iteration) in either the algorithm or its analysis. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
28. A Many-Objective Optimization Based Intelligent Intrusion Detection Algorithm for Enhancing Security of Vehicular Networks in 6G.
- Author
-
Zhang, Zhixia, Cao, Yang, Cui, Zhihua, Zhang, Wensheng, and Chen, Jinjun
- Subjects
COMPUTER network security ,MACHINE learning ,ALGORITHMS ,INTERNET of things ,MATHEMATICAL optimization ,INTELLIGENT transportation systems - Abstract
With accelerated ensemble of the Internet of Things technology and automotive industry, vehicular network has been established as powerful tools. However, it is a significant challenge for dynamic and heterogeneous vehicular network to meet high requirements of the sixth-generation (6G) network such as high reliability and high security. To address this challenge, we design a novel weight-based ensemble machine learning algorithm (WBELA) to identify abnormal messages of vehicular Controller Area Network (CAN) bus network. Then, we establish a model based on many-objective optimization for intrusion detection of CAN bus network. To support this model, a many-objective optimization algorithm based on balance convergence and diversity (MaOEA-BCD) is designed. Open-source CAN bus message data sets and tamper attack scenarios are used to evaluate the effectiveness of proposed algorithm for different ID data frames. Experimental results revealed that proposed methods significantly enhance precision, reduce the false positive rate and have better performance than other methods so as to enhance security of vehicular networks in 6G. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
29. Benchmarking Feature-Based Algorithm Selection Systems for Black-Box Numerical Optimization.
- Author
-
Tanabe, Ryoji
- Subjects
ALGORITHMS ,BENCHMARKING (Management) ,MACHINE learning ,MATHEMATICAL optimization - Abstract
Feature-based algorithm selection aims to automatically find the best one from a portfolio of optimization algorithms on an unseen problem based on its landscape features. Feature-based algorithm selection has recently received attention in the research field of black-box numerical optimization. However, there is still room for the analysis of algorithm selection for black-box optimization. Most previous studies have focused only on whether an algorithm selection system can outperform the single-best solver (SBS) in a portfolio. In addition, a benchmarking methodology for algorithm selection systems has not been well investigated in the literature. In this context, this article analyzes algorithm selection systems on the 24 noiseless black-box optimization benchmarking functions. First, we demonstrate that the first successful performance measure is more reliable than the expected runtime measure for benchmarking algorithm selection systems. Then, we examine the influence of randomness on the performance of algorithm selection systems. We also show that the performance of algorithm selection systems can be significantly improved by using sequential least squares programming as a presolver. We point out that the difficulty of outperforming the SBS depends on algorithm portfolios, cross-validation methods, and dimensions. Finally, we demonstrate that the effectiveness of algorithm portfolios depends on various factors. These findings provide fundamental insights for algorithm selection for black-box optimization. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
30. Segmentation Over Detection via Optimal Sparse Reconstructions.
- Author
-
Xia, Wei, Domokos, Csaba, Xiong, Junjun, Cheong, Loong Fah, and Yan, Shuicheng
- Subjects
IMAGE segmentation ,OBJECT recognition (Computer vision) ,IMAGE reconstruction ,SPARSE approximations ,ALGORITHMS ,MATHEMATICAL optimization - Abstract
This paper addresses the problem of semantic segmentation, where the possible class labels are from a predefined set. We exploit top-down guidance, i.e., the coarse localization of the objects and their class labels provided by object detectors. For each detected bounding box, figure–ground segmentation is performed and the final result is achieved by merging the figure–ground segmentations. The main idea of the proposed approach, which is presented in our preliminary work, is to reformulate the figure–ground segmentation problem as sparse reconstruction pursuing the object mask in a nonparametric manner. The latent segmentation mask should be coherent subject to sparse error caused by intra-category diversity; thus, the object mask is inferred by making use of sparse representations over the training set. To handle local spatial deformations, local patch-level masks are also considered and inferred by sparse representations over the spatially nearby patches. The sparse reconstruction coefficients and the latent mask are alternately optimized by applying the Lasso algorithm and the accelerated proximal gradient method. The proposed formulation results in a convex optimization problem; thus, the global optimal solution is achieved. In this paper, we provide theoretical analysis of the convergence and optimality. We also give an extended numerical analysis of the proposed algorithm and a comprehensive comparison with the related semantic segmentation methods on the challenging PASCAL visual object class object segmentation datasets and the Weizmann horse dataset. The experimental results demonstrate that the proposed algorithm achieves a competitive performance when compared with the state of the arts. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
31. Hybridization Algorithm of Fireworks Optimization and Generating Set Search for Optimal Design of IPMSM.
- Author
-
Kim, Dae-Woo, Park, Gyeong-Jae, Lee, Ji-Han, Kim, Jong-Wook, Kim, Yong-Jae, and Jung, Sang-Yong
- Subjects
ALGORITHMS ,SYNCHRONOUS electric motors ,MATHEMATICAL optimization ,OPTIMAL designs (Statistics) ,MATHEMATICAL models - Abstract
In this paper, a novel algorithm “firework optimization” (FO) is introduced, as well as its hybridization with generating set search (GSS). FO is an exploration algorithm, which intends to explore a vast region within the search space in order to determine regions that may contain a regional optimum. As the regions with potential are defined, GSS, the exploitation algorithm is applied to determine whether regions determined by FO contain a local or a global optimum. The validity of FO and GSS hybridization algorithm is verified using Branin and Six-Hump Camel test functions, and the hybridization algorithm is applied to an interior permanent magnet synchronous motor, in order to minimize torque ripple. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
32. An On-Line Energy Management Strategy Based on Trip Condition Prediction for Commuter Plug-In Hybrid Electric Vehicles.
- Author
-
Liu, Jichao, Chen, Yangzhou, Zhan, Jingyuan, and Shang, Fei
- Subjects
HYBRID electric vehicles ,ENERGY management ,MATHEMATICAL optimization ,ALGORITHMS ,COMMUTERS ,PREDICTION models ,INTERNET ,ENERGY consumption - Abstract
This paper presents an on-line energy management strategy (EMS) based on trip condition prediction for commuter plug-in hybrid electric vehicles (P-HEVs). The purpose is to provide an on-line predictive control approach to minimize fuel consumption. Two pivotal contributions are provided to realize the purpose. First of all, we establish the trip condition prediction model by using back propagation neural network, to obtain the real-time vehicle-speed trajectory on-line. Particularly, both the genetic algorithm and particle swarm optimization algorithm are applied to improve the prediction accuracy of the trip condition prediction model. Next, to obtain an applicable EMS in real time, we propose a dynamic programming-based predictive control strategy. Finally, a simulation study is conducted for applying the proposed strategy to a practical trip path in the Beijing road network. The results show that the designed trip condition prediction model can effectively realize the on-line vehicle-speed prediction, and the prediction accuracy is more than 93%. In addition, compared to the offline global optimization EMS, although the proposed strategy makes the fuel consumption grow less than 5.2%, it can be implemented in real time. Moreover, compared with the existing real-time EMSs, it can further reduce the fuel consumption and emissions. It shows that the proposed EMS can provide an effective solution for commuter P-HEVs applying it on-line. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
33. Reconfiguration Algorithm to Reduce Power Losses in Offshore HVDC Transmission Lines.
- Author
-
Sanz, Ines, Moranchel, Miguel, Moriano, Javier, Rodriguez, Francisco Javier, and Fernandez, Susel
- Subjects
OFFSHORE wind power plants ,ELECTRIC lines ,PARTICLE swarm optimization ,MATHEMATICAL optimization ,DIRECT currents ,ALGORITHMS - Abstract
The race to increase the efficiency and reduce the power losses in transmission systems has resulted in the substantial growth of high-voltage direct current (HVDC) transmission systems. Moreover, the interconnection of these transmission systems significantly increases their reliability. However, the control of these meshed grids is a key problem that usually is managed through the control of the VSCs in those grids, but the control of the VSC can be complemented with a reconfiguration algorithm. This paper proposes the use of the particle swarm optimization algorithm, in order to reconfigure meshed HVDC transmission systems and reduce losses. The proposed algorithm has been tested in the CIGRE benchmark grid, which comprises of several offshore wind farms that generate energy sent to the grid through several HVDC transmission lines. The results show that as the energy generation changes due to wind changes, the grid topology must be reconfigured in order to achieve the maximum efficiency. Doing this reconfiguration, power savings around 18–19% could be achieved. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
34. Performance Evaluation of Start-Up Decisions of Rapid-Start Units for AGC.
- Author
-
Saboya Bautista, Inmaculada, Egido, Ignacio, and Lobato Miguelez, Enrique
- Subjects
LINEAR programming ,INTEGERS ,ALGORITHMS ,INTEGER programming ,MATHEMATICAL optimization - Abstract
Generating units, participating in the secondary frequency control of a control area, are usually spinning units already connected to the network and operating outside their range of optimal performance. This paper deals with an alternative method of providing secondary frequency control called Rapid-Start (RS). It consists in assigning a regulation band to several off-line units (RS units) which are capable of being started and connected rapidly, therefore allowing the online units to operate closer to their nominal power. As RS operation may have economic benefits, an appropriate algorithm to start up an RS unit needs to be developed. This paper proposes a methodology to evaluate, compare, and choose the most appropriate RS algorithm among the ones developed for a certain AGC control area. An optimization model provides a reference by determining the hypothetically ideal start-ups and shut-downs of RS units. In addition, the definition of performance indexes to evaluate, compare, and choose the different RS algorithms is proposed. The proposed methodology is illustrated for a secondary frequency control zone within the Spanish power system by using real data signals. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
35. DG2: A Faster and More Accurate Differential Grouping for Large-Scale Black-Box Optimization.
- Author
-
Omidvar, Mohammad Nabi, Yang, Ming, Mei, Yi, Li, Xiaodong, and Yao, Xin
- Subjects
MATHEMATICAL optimization ,ALGORITHMS ,COMPUTER programming ,MATHEMATICS ,OVERLAPPING generations model (Economics) - Abstract
Identification of variable interaction is essential for an efficient implementation of a divide-and-conquer algorithm for large-scale black-box optimization. In this paper, we propose an improved variant of the differential grouping (DG) algorithm, which has a better efficiency and grouping accuracy. The proposed algorithm, DG2, finds a reliable threshold value by estimating the magnitude of roundoff errors. With respect to efficiency, DG2 reuses the sample points that are generated for detecting interactions and saves up to half of the computational resources on fully separable functions. We mathematically show that the new sampling technique achieves the lower bound with respect to the number of function evaluations. Unlike its predecessor, DG2 checks all possible pairs of variables for interactions and has the capacity to identify overlapping components of an objective function. On the accuracy aspect, DG2 outperforms the state-of-the-art decomposition methods on the latest large-scale continuous optimization benchmark suites. DG2 also performs reliably in the presence of imbalance among contribution of components in an objective function. Another major advantage of DG2 is the automatic calculation of its threshold parameter ( $\epsilon $ ), which makes it parameter-free. Finally, the experimental results show that when DG2 is used within a cooperative co-evolutionary framework, it can generate competitive results as compared to several state-of-the-art algorithms. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
36. Multi-Objective Optimization for Distributed MIMO Networks.
- Author
-
Li, Zan, Gong, Shiqi, Xing, Chengwen, Fei, Zesong, and Yan, Xinge
- Subjects
MIMO systems ,ENERGY harvesting ,RADIO transmitter-receivers ,ALGORITHMS ,MATHEMATICAL optimization - Abstract
In this paper, we investigate the linear transceiver optimization for multiple-inputmultiple-output (MIMO) interference networks, where multiple pairs of multi-antenna source and destination nodes communicate simultaneously. Different from most of existing works, we jointly consider three critical issues of the linear transceiver optimization for MIMO interference networks based on multi-objective optimization theory, i.e., signal transmission, energy and security. Specifically, using the modified weighted Tchebycheff method, we investigate three kinds of multi-objective optimization problems (MOOPs): 1) sum mean square error minimization and harvested energy maximization; 2) transmit power minimization and energy harvesting efficiency maximization; 3) transmit power minimization, energy harvesting efficiency maximization, and physical layer security. Based on the Charnes–Cooper transformation and penalty function method, the formulated MOOPs are transformed into convex optimization problems and thus can be effectively solved. The resulting Pareto optimal solutions set reveals the complicated but important relationships among these involved single objective optimization problems, which are usually individually investigated in the literature. Finally, numerical simulation results demonstrate the performance advantages of the proposed algorithm and corroborate the theoretical analysis. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
37. Distributed Algorithms for Robust Convex Optimization via the Scenario Approach.
- Author
-
You, Keyou, Tempo, Roberto, and Xie, Pei
- Subjects
ALGORITHMS ,MATHEMATICAL optimization ,ROBUST convex optimization ,MATHEMATICAL analysis ,GEOMETRIC vertices - Abstract
This paper proposes distributed algorithms to solve robust convex optimization (RCO) when the constraints are affected by nonlinear uncertainty. We adopt a scenario approach by randomly sampling the uncertainty set. To facilitate the computational task, instead of using a single centralized processor to obtain a “global solution” of the scenario problem (SP), we resort to multiple interconnected processors that are distributed among different nodes of a network to simultaneously solve the SP. Then, we propose a primal-dual subgradient algorithm and a random projection algorithm to distributedly solve the SP over undirected and directed graphs, respectively. Both algorithms are given in an explicit recursive form with simple iterations, which are especially suited for processors with limited computational capability. We show that, if the underlying graph is strongly connected, each node asymptotically computes a common optimal solution to the SP with a convergence rate $O(1/(\sum _{t=1}^k\zeta ^t))$ , where $\lbrace \zeta ^t\rbrace$ is a sequence of appropriately decreasing stepsizes. That is, the RCO is effectively solved in a distributed way. The relations with the existing literature on robust convex programs are thoroughly discussed and an example of robust system identification is included to validate the effectiveness of our distributed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
38. Distributed Projection Subgradient Algorithm Over Time-Varying General Unbalanced Directed Graphs.
- Author
-
Li, Huaqing, Lu, Qingguo, and Huang, Tingwen
- Subjects
GRAPHIC methods ,ALGORITHMS ,GEOMETRIC vertices ,MATHEMATICAL optimization ,NUMERICAL analysis - Abstract
This paper is concerned with a general class of distributed constrained optimization problems over a multiagent network, where the global objective function is represented by the sum of all local objective functions. Each agent in the network only knows its own local objective function, and is restricted to a global nonempty closed convex set. We discuss the scenario where the communication of the whole multiagent network is expressed as a sequence of time-varying general unbalanced directed graphs. The directed graphs are required to be uniformly jointly strongly connected and the weight matrices are only row-stochastic. To collaboratively deal with the optimization problems, existing distributed methods mostly require the communication graph to be fixed or balanced, which is impractical and hardly inevitable. In contrast, we propose a new distributed projection subgradient algorithm which is applicable to the time-varying general unbalanced directed graphs and does not need each agent to know its in-neighbors’ out-degree. When the objective functions are convex and Lipschitz continuous, it is proved that the proposed algorithm exactly converges to the optimal solution. Simulation results on a numerical experiment are shown to substantiate feasibility of the proposed algorithm and correctness of the theoretical findings. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
39. Low-Rank Modifications of Riccati Factorizations for Model Predictive Control.
- Author
-
Nielsen, Isak and Axehill, Daniel
- Subjects
PREDICTIVE control systems ,RICCATI equation ,LOW-rank matrices ,MATHEMATICAL optimization ,ALGORITHMS ,MATHEMATICAL models - Abstract
In model predictive control (
MPC ), the control input is computed by solving a constrained finite-time optimal control (CFTOC ) problem at each sample in the control loop. The main computational effort when solving theCFTOC problem using an active-set (AS ) method is often spent on computing the search directions, which inMPC corresponds to solving unconstrained finite-time optimal control (UFTOC ) problems. This is commonly performed using Riccati recursions or generic sparsity exploiting algorithms. In this paper, the focus is efficient search direction computations forAS type methods. The system of equations to be solved at eachAS iteration is changed only by a low-rank modification of the previous one, and exploiting this structured change is important for the performance ofAS -type solvers. In this paper, theory for how to exploit these low-rank changes by modifying the Riccati factorization betweenAS iterations in a structured way is presented. A numerical evaluation of the proposed algorithm shows that the computation time can be significantly reduced by modifying, instead of re-computing, the Riccati factorization. This speedup can be important forAS -type solvers used for linear, nonlinear, and hybridMPC . [ABSTRACT FROM PUBLISHER]- Published
- 2018
- Full Text
- View/download PDF
40. A Novel Method to Compute the Structured Distance to Instability for Combined Uncertainties on Delays and System Matrices.
- Author
-
Borgioli, Francesco and Michiels, Wim
- Subjects
MATRICES (Mathematics) ,ALGORITHMS ,MATHEMATICAL optimization ,DISTANCES ,MATRIX inequalities - Abstract
This paper presents a novel method to compute the distance to instability for linear time-invariant delay systems with multiple delays, subjected to combined uncertainties on the system matrices and the delay parameters. The method is able to fully exploit structure and possible interdependencies between the uncertainties affecting the coefficient matrices, the property that realistic perturbations are real valued, and the structure of the delay equation. The resulting algorithm relies on a characterization in terms of the pseudospectral abscissa and on techniques from optimization over manifolds of matrices. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
41. Push-Sum on Random Graphs: Almost Sure Convergence and Convergence Rate.
- Author
-
Rezaienia, Pouya, Gharesifard, Bahman, Linder, Tamas, and Touri, Behrouz
- Subjects
ALGORITHMS ,DIRECTED graphs ,HEURISTIC algorithms ,TELECOMMUNICATION systems ,MATHEMATICAL optimization ,RANDOM graphs - Abstract
In this paper, we study the problem of achieving average consensus over a random time-varying sequence of directed graphs by extending the class of so-called push-sum algorithms to such random scenarios. Provided that an ergodicity notion, which we term the directed infinite flow property, holds and the auxiliary states of agents are uniformly bounded away from zero infinitely often, we prove the almost sure convergence of the evolutions of this class of algorithms to the average of initial states. Moreover, for a random sequence of graphs generated using a so-called time-varying $B$ -irreducible probability matrix, we establish convergence rates for the proposed push-sum algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
42. NSGA-II+FEM Based Loss Optimization of Three-Phase Transformer.
- Author
-
Mohammed, Mohammed Sami and Vural, Revna Acar
- Subjects
MATHEMATICAL optimization ,ELECTRIC transformers ,PARAMETERS (Statistics) ,ALGORITHMS ,TOPOLOGY - Abstract
In order to obtain a good optimization method for the electrical transformer design with optimal selection of parameters, performance evaluation of three evolutionary algorithms (EAs), namely, genetic algorithm (GA), differential evolution algorithm, and nondominated sorting GA (NSGA-II), is carried out. The aim of this paper is to optimize parameters of transformer design (core thicknesses, primary-turn number, secondary-turn number, primary conductor area, and secondary conductor area) for minimization of total power losses (no-load losses and load losses) in three-phase transformer topology while maintaining high efficiency and low cost. The method used for this optimization scheme combines the finite-element method (FEM) and EAs to provide an accurate selection of parameters together with the optimized magnetic flux density and decreased loss. Experimental results show that NSGA-II+FEM model successfully provides a global feasible solution by minimizing total loss and related cost while improving the efficiency of three-phase transformer, rendering it suitable for application in the design environment of industrial transformers. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
43. Sharp Oracle Inequalities for Stationary Points of Nonconvex Penalized M-Estimators.
- Author
-
Elsener, Andreas and van de Geer, Sara
- Subjects
PROBABILITY theory ,ALGORITHMS ,MATHEMATICAL optimization ,NUMERICAL analysis ,NANOPARTICLES - Abstract
Many statistical estimation procedures lead to nonconvex optimization problems. Algorithms to solve these problems are often guaranteed to output a stationary point of the optimization problem. Oracle inequalities are an important theoretical instrument to assess the statistical performance of an estimator. Oracle results have focused on the theoretical properties of the uncomputable (global) minimum or maximum. In this paper, a general framework used for convex optimization problems to derive oracle inequalities for stationary points is extended. A main new ingredient of these oracle inequalities is that they are sharp: they show closeness to the best approximation within the model plus a remainder term. We apply this framework to different estimation problems. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
44. Threshold-Guided Design and Optimization for Harris Corner Detector Architecture.
- Author
-
Jasani, Bhavan A., Lam, Siew-Kei, Meher, Pramod Kumar, and Wu, Meiqing
- Subjects
COMPUTER vision ,EDGE detection (Image processing) ,ALGORITHMS ,MATHEMATICAL optimization ,EMBEDDED computer systems ,REAL-time computing - Abstract
High-speed corner detection is an essential step in many real-time computer vision applications, e.g., object recognition, motion analysis, and stereo matching. Hardware implementation of corner detection algorithms, such as the Harris corner detector (HCD) has become a viable solution for meeting real-time requirements of the applications. A major challenge lies in the design of power, energy and area efficient architectures that can be deployed in tightly constrained embedded systems while still meeting real-time requirements. In this paper, we proposed a bit-width optimization strategy for designing hardware-efficient HCD that exploits the thresholding step in the algorithm to determine interest points from the corner responses. The proposed strategy relies on the threshold as a guide to truncate the bit-widths of the operators at various stages of the HCD pipeline with only marginal loss of accuracy. Synthesis results based on 65-nm CMOS technology show that the proposed strategy leads to power-delay reduction of 35.2%, and area reduction of 35.4% over the baseline implementation. In addition, through careful retiming, the proposed implementation achieves over 2.2 times increase in maximum frequency while achieving an area reduction of 35.1% and power-delay reduction of 35.7% over the baseline implementation. Finally, we performed repeatability tests to show that the optimized HCD architecture achieves comparable accuracy with the baseline implementation (average decrease of repeatability is less than 0.6%). [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
45. Surrogate-Assisted Autoencoder-Embedded Evolutionary Optimization Algorithm to Solve High-Dimensional Expensive Problems.
- Author
-
Cui, Meiji, Li, Li, Zhou, Mengchu, and Abusorrah, Abdullah
- Subjects
MATHEMATICAL optimization ,ALGORITHMS - Abstract
Surrogate-assisted evolutionary algorithms (EAs) have been intensively used to solve computationally expensive problems with some success. However, traditional EAs are not suitable to deal with high-dimensional expensive problems (HEPs) with high-dimensional search space even if their fitness evaluations are assisted by surrogate models. The recently proposed autoencoder-embedded evolutionary optimization (AEO) framework is highly appropriate to deal with high-dimensional problems. This work aims to incorporate surrogate models into it to further boost its performance, thus resulting in surrogate-assisted AEO (SAEO). It proposes a novel model management strategy that can guarantee reasonable amounts of re-evaluations; hence, the accuracy of surrogate models can be enhanced via being updated with new evaluated samples. Moreover, to ensure enough data samples before constructing surrogates, a problem-dimensionality-dependent activation condition is developed for incorporating surrogates into the SAEO framework. SAEO is tested on seven commonly used benchmark functions and compared with state-of-the-art algorithms for HEPs. The experimental results show that SAEO can further enhance the performance of AEO on most cases and SAEO performs significantly better than other algorithms. Therefore, SAEO has great potential to deal with HEPs. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
46. Fast Fuzzy Clustering Based on Anchor Graph.
- Author
-
Nie, Feiping, Liu, Chaodie, Wang, Rong, Wang, Zhen, and Li, Xuelong
- Subjects
QUADRATIC programming ,FUZZY graphs ,FUZZY algorithms ,MATHEMATICAL optimization ,ANCHORS ,ALGORITHMS ,PRIOR learning - Abstract
Fuzzy clustering is one of the most popular clustering approaches and has attracted considerable attention in many fields. However, high computational cost has become a bottleneck which limits its applications in large-scale problems. Moreover, most fuzzy clustering algorithms are sensitive to noise. To address these issues, a novel fuzzy clustering algorithm, called fast fuzzy clustering based on anchor graph (FFCAG), is proposed. The FFCAG algorithm integrates anchor-based similarity graph construction and membership matrix learning into a unified framework, such that the prior knowledge of anchors can be further utilized to improve clustering performance. Specifically, FFCAG first constructs an anchor-based similarity graph with a parameter-free neighbor assignment strategy. Then, it designs a quadratic programming model to learn the membership matrix of anchors, which is very different from traditional fuzzy clustering algorithms. More importantly, a novel balanced regularization term is introduced into the objective function to produce more accurate clustering results. Finally, we adopt an alternating optimization algorithm with guaranteed convergence to solve the proposed method. Experimental results performed on synthetic and real-world datasets demonstrate the proposed FFCAG can significantly reduce the computational time with comparable, even superior, clustering performance, compared with state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
47. Optimal Thrust Allocation for Semisubmersible Oil Rig Platforms Using Improved Harmony Search Algorithm.
- Author
-
Yadav, Parikshit, Kumar, Rajesh, Panda, Sanjib Kumar, and Chang, C. S.
- Subjects
OIL well drilling rigs ,ALGORITHMS ,ANCHORAGE of semi-submersible offshore structures ,THRUST ,MATHEMATICAL optimization - Abstract
Deep-water offshore drilling vessels, such as a semisubmersible drilling rig, use the dynamic positioning (DP) system and the thruster-assisted position-mooring system for maintaining a stationary position. In the DP system, the thrust allocator is used to distribute the desired generalized forces computed by the motion controller among the thrusters. However, to ensure safe operation of the vessel despite the thruster failure, the vessel is equipped with redundant thruster configuration and, therefore, is overactuated. For overactuated vessels, the choice of a particular solution for thrust allocation is found using some kind of optimization process. In this paper, the thrust allocator tries to minimize the power consumption and takes forbidden/spoil zones into account. The formulated thrust allocation problem becomes nonconvex due to thrust direction constraints on azimuth thrusters. The conventional methods get trapped in local minima and fail to find the optimum solution for the formulated nonconvex thrust allocation problem. In this paper, an improved harmony search (IHS) algorithm for solving the nonconvex thrust allocation problem is proposed. IHS is a variant of the harmony search (HS) algorithm. The HS algorithm is a music-based meta-heuristic optimization method, which is analogous with the music improvisation process where a musician continues to polish the pitches to obtain better harmony. Obtained numerical results show that the IHS algorithm has better convergence property when compared to the HS algorithm and the genetic algorithm (GA). Moreover, the power consumption for thrust allocation using the IHS algorithm is lower when compared with HS, GA, and Mincon (sequential quadratic programming) algorithms. The percentage savings in total power consumption for thruster allocation as compared to the Mincon algorithm for GA, HS, and IHS methods are 44.96%, 48.39%, and 51.58%, respectively. [ABSTRACT FROM PUBLISHER]
- Published
- 2014
- Full Text
- View/download PDF
48. Successive Interference Mitigation in Multiuser MIMO Channels.
- Author
-
Che, Enlong, Tuan, Hoang Duong, Minh Tam Tam, Ho Huu, and Nguyen, Ha H.
- Subjects
MIMO systems ,MATHEMATICAL optimization ,SIMULATION methods & models ,ALGORITHMS ,MATHEMATICS - Abstract
Motivated by the work of Dahrouj and Yu in applying the Han-Kobayashi transmission strategy for mitigating the intercell interference in a multi-cell multi-user multiple-input single-output interference network (MISO IN), this paper considers splitting messages into private and common parts in a multi-cell multi-user MIMO IN. Specifically, the covariances of the private messages and common messages are designed to optimize either the sum rate or the minimal rate. The common messages and private messages are decoded in sequence using successive decoding. This paper shows how these difficult optimization problems can be adequately solved by means of d.c. (
d ifference ofc oncave functions) optimization over a simple convex set. Numerical and simulation results also reveal the great advantage of our proposed solutions for various types of INs. In particular, the proposed solutions are shown to outperform the algorithm developed by Dahrouj and Yu for the simpler case of the MISO IN. [ABSTRACT FROM PUBLISHER]- Published
- 2015
- Full Text
- View/download PDF
49. Quantile-Based Simulation Optimization With Inequality Constraints: Methodology and Applications.
- Author
-
Chang, Kuo-Hao and Lu, Hou-Kuen
- Subjects
COMPUTER simulation ,ALGORITHMS ,STOCHASTIC processes ,AUTOMATION ,MATHEMATICAL optimization - Abstract
Many automation or manufacturing systems are too complex to be modeled by analytical approaches and can only resort to fast-running simulation. Stochastic Nelder–Mead simplex method (SNM) is a newly developed methodology for simulation optimization with expected-value-based objective functions. Quantile, as an important alternative to the usual expected value, provides additional information about the distribution of system performance. In particular, it is useful in describing the tail behavior of the distribution. In this paper, we exploit the structure of SNM and extend it to solve simulation optimization problems with quantile-based objective functions and inequality constraints. The proposed method, called SNM-QC, utilizes the same search strategy as SNM but further incorporates effective quantile estimation techniques and penalty function approaches to solve the problem. We prove that SNM-QC has the desirable global convergence guarantee, i.e., the algorithm is guaranteed to converge to the true optima with probability one. One advantage of SNM-QC is that it is a direct search method that determines the moving direction simply by comparing a set of solutions rather than estimating gradient, thus it can handle many practical problems where gradient does not exist or is difficult to estimate. An extensive numerical study shows that the performance of SNM-QC is promising compared to the existing heuristics. Two illustrative applications are provided in the end to demonstrate the viability of SNM-QC in practical settings. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
50. A Novel Multimodal Optimization Algorithm for the Design of Electromagnetic Machines.
- Author
-
Yoo, Chung-Hee, Lim, Dong-Kuk, and Jung, Hyun-Kyo
- Subjects
MATHEMATICAL optimization ,ALGORITHMS ,MAGNETO-electric machines ,ELECTRIC machinery -- Design & construction ,COMPUTATIONAL electromagnetics ,PERMANENT magnet motors - Abstract
The design of an electromagnetic machine is a nonlinear, multivariable, and multimodal optimization problem that incurs a great deal of computation time when calculating electromagnetic fields. To overcome these problems effectively, this paper proposes a new evolutionary multimodal optimization algorithm based on the Big Bang–Big Crunch method and aided by a surrogate model using the theory of compressed sensing. Its efficiency is demonstrated by assessing the optimization results for test functions. Moreover, to evaluate the feasibility of its application to an electromagnetic problem, an interior permanent magnet motor is designed using the proposed algorithm. The obtained results confirm that the proposed method has the ability to search for multiple optimal solutions with a good computational efficiency by reducing the number of fitness function evaluations during the optimization process. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.