Efficient Optimization Algorithm Research Articles

GREAT: A scientific software platform for satellite geodesy and multi-source fusion navigation

The software platform named GNSS + REsearch, Application and Teaching (GREAT) has been designed and developed by Wuhan University for satellite geodesy and multi-source fusion navigation. GREAT is a comprehensive software platform based on C++ language, with modular structure, cross-platform capabilities and efficient performance. The software mainly focuses on space geodetic data processing, precise positioning and orbit determination, and multi-source fusion navigation. With the integration of multiple space geodetic techniques at observation level, GREAT can achieve the determination of global geodetic parameters. Meanwhile, GREAT can also achieve real-time precise orbit and clock determination by processing GNSS data from globally distributed stations, and the accuracies are about 3–6 cm for orbit and 0.1–0.4 ns for clock. Based on high-precision orbit and clock products, centimeter-level onboard positioning accuracies can be achieved with PPP-RTK in open-sky scenarios. Furthermore, centimeter-level multi-source fusion navigation can be achieved in urban scenarios though the integrated system of PPP-RTK/MEMS/VIS/LiDAR. Additionally, efficiency optimization algorithms such as parallel computing are applied to enable the software to handle the data-intensive and calculation-intensive situations.

Heuristic algorithms for design of integrated monitoring of geologic carbon storage sites

Designs for Risk Evaluation and Management (DREAM) is a tool developed under the National Risk Assessment Partnership (NRAP) to enhance geologic carbon storage safety and efficiency. Using potential leakage scenarios generated externally by the users preferred history-matching approach, DREAM constructs ideal combinations of sensor locations in the right place at the right time to detect as many leaks as possible, detect them as early as possible, and minimize cost. This user-friendly tool, developed in Java, features a window-based GUI for input and a 3D visualization tool for viewing the domain space and optimized monitoring plans. DREAM's latest version accommodates real-world usage by allowing for joint optimization of wellbore point sensor placements and surface geophysics survey geometries, and by using more efficient multi-objective optimization algorithms. In an example shown here, these two improvements combined allow us to support containment assurance and go from detecting 80–90 % of the potential CO2 leakage to +99.7 %, a step-change improvement that can make the deciding difference in whether a site is suitable for geologic carbon storage. Though developed for geologic carbon storage, this tool would be equally applicable in many surface or offshore environmental monitoring projects.

An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation

An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation

A numerical model simulating cyclic behavior of high-strength steel

High-strength steel (HSS) can effectively and economically design structural members that withstand large forces induced by extreme events such as earthquakes. To evaluate the seismic performance of HSS members and structures using nonlinear finite element (FE) analyses, using an accurate material model is important, which can simulate the inelastic cyclic behavior of the HSS. The peculiar material behavior of HSS needs to be considered in the model. This study used a combined hardening model to construct the material model. The configuration of the model and the constituent model parameter values are determined to precisely simulate the low-cycle fatigue (LCF) behavior of HSS. An efficient particle swarm optimization (PSO) algorithm is used to determine parameter values with LCF test data of 54 individual HSS coupons. In additions, to conveniently determine the model parameter values with only monotonic tensile test data instead of conducting expensive LCT tests, empirical equations are proposed. It is shown that the LCF curves of HSS can be accurately simulated using the constructed material model with the proposed equations.

ETE-SRSP: An Enhanced Optimization of Tramp Ship Routing and Scheduling

In the contemporary tramp shipping industry, route optimization and scheduling are directly linked to enhancements in operations, economics, and the environment, making them key factors for the effective management of maritime transportation. To enhance effective ship-to-cargo matching and the refinement of maritime transportation itineraries, this paper introduces a time efficiency and carbon dioxide emission multi-objective optimization algorithm named ETE-SRSP (efficiency–time–emission multi-optimization algorithm). ETE-SRSP incorporates several factors, including the initial positions of ships, time windows for loading and unloading operations, and varying sailing speeds. Within the ETE-SRSP framework, pioneering an approach that integrates ballast and laden sailing velocities as decisional parameters, it employs a multi-objective optimization technique to investigate the intricate interplay between temporal efficiency and carbon dioxide emissions. Additionally, the model’s proficiency in mitigating emissions and managing costs is clearly demonstrated through the optimization of these objectives, thereby offering a robust framework for decision support. The experimental results show that the optimal sailing speeds derived from the ETE-SRSP, under typical time-weight scenarios, can achieve an optimal balance between emission reduction and cost control. In summary, this study underscores the optimization strategy’s potential to effectively address the maritime sector’s need for economic growth and ecological conservation, showcasing its practical value in the industry.

The Alternating Direction Method of Multipliers for Sufficient Dimension Reduction

The minimum average variance estimation (MAVE) method has proven to be an effective approach to sufficient dimension reduction. In this study, we apply the computationally efficient optimization algorithm named alternating direction method of multipliers (ADMM) to a particular approach (MAVE or minimum average variance estimation) to the problem of sufficient dimension reduction (SDR). Under some assumptions, we prove that the iterative sequence generated by ADMM converges to some point of the associated augmented Lagrangian function. Moreover, that point is stationary. It also presents some numerical simulations on synthetic data to demonstrate the computational efficiency of the algorithm.

Improve robustness of machine learning via efficient optimization and conformal prediction

AbstractThe advance of machine learning (ML) systems in real‐world scenarios usually expects safe deployment in high‐stake applications (e.g., medical diagnosis) for critical decision‐making process. To this end, provable robustness of ML is usually required to measure and understand how reliable the deployed ML system is and how trustworthy their predictions can be. Many studies have been done to enhance the robustness in recent years from different angles, such as variance‐regularized robust objective functions and conformal prediction (CP) for uncertainty quantification on testing data. Although these tools provably improve the robustness of ML model, there is still an inevitable gap to integrate them into an end‐to‐end deployment. For example, robust objectives usually require carefully designed optimization algorithms, while CP treats ML models as black boxes. This paper is a brief introduction to our recent research focusing on filling this gap. Specifically, for learning robust objectives, we designed sample‐efficient stochastic optimization algorithms that achieves the optimal (or faster compared to existing algorithms) convergence rates. Moreover, for CP‐based uncertainty quantification, we established a framework to analyze the expected prediction set size (smaller size means more efficiency) of CP methods in both standard and adversarial settings. This paper elaborates the key challenges and our exploration towards efficient algorithms with details of background methods, notions for robustness measure, concepts of algorithmic efficiency, our proposed algorithms and results. All of them further motivate our future research on risk‐aware ML that can be critical for AI–human collaborative systems. The future work mainly targets designing conformal robust objectives and their efficient optimization algorithms.

Dynamic optimization of die-less spinning process through autonomous modeling of time-varying forming law

Die-less spinning is a typical incremental forming technology with flexible processing parameters, including the roller path and loading parameters, whose forming law changes dynamically and easy-to-produce defects of excessive thinning and flange wrinkling. This brings a great challenge to the process design of die-less spinning. In this study, we proposed a novel dynamic optimization approach and system considering the time-varying forming law for the processing parameters in die-less spinning. The idea of proposed approach is that simulating the spinning process step by step through autonomous finite element modeling, real-time extracting and modeling the simulated spinning status at each forming step to capture the time-varying forming law, then gradually optimizing the processing parameters through efficient multi-objective optimization algorithm. By conducting the proposed dynamic optimization approach to the first spinning pass of die-less spinning, series of polynomial response surface models (PRSM) of wall thickness and flange wrinkling at various forming steps were developed to describe the time-varying forming law. On this basis, the roller path and matching loading parameters in each step were gradually optimized through a differential evolution algorithm with the multi-objective of minimizing wall thickness reduction, reducing flange wrinkling and maximizing forming efficiency. The optimized process produced better spun part than the traditional spinning process, presenting the wall thickness reduction ≤5 % and the flange wrinkling ≤2.5 mm. Furthermore, the time-varying influence of processing parameters on the wall thickness and flange wrinkling were elucidated based on the PRSM of spinning status at various forming steps.

Physics-informed deep learning and linear programming for efficient optimization of combined cycle power plants

Efficient operation of combined cycle power plants (CCPP) involves solving mixed-integer nonlinear optimization problems, constrained by thermodynamic differential equations, thermal constraints, and temporal dependencies between variables. The optimization problem aims to maximize profit for day-ahead operation by minimizing short-term and long-term costs, and accounting for volatility in ambient conditions and energy price. In operational terms, the challenge lies in developing an efficient and robust optimization algorithm capable of determining optimal values for thousands of temporal variables. It must also have the capacity to evaluate a multitude of scenarios encompassing various weather and market conditions. To address this challenge, this paper proposes a hybrid optimizer that utilizes deep learning models trained on historical operational data of a real CCPP, along with a surrogate physics-driven piecewise-linear model of CCPP, to determine the optimal values of thousands of control setpoints, with strong temporal co-dependencies, within a two-minute runtime required by industry constraints. A multi-resolution architecture is proposed to efficiently implement this optimizer. The algorithm sequentially solves the problem in coarse and fine resolutions to accelerate convergence. Final results are checked for feasibility using pre-trained deep learning models, ensuring accuracy and validity. The study shows that the proposed model provides comparable results to the exact solution while reducing computational costs, up to 95%. This research has practical implications for power plant system operators, as well as traders and dispatchers, enabling them to make optimal decisions for day-ahead contracting purposes and CCPP operation in a reasonable time, ultimately leading to more efficient and cost-effective power plant management. Furthermore, the methodology introduced in this work could potentially be extended to other industrial applications that require large-scale, complex optimizations, where the precise governing principles of a process can be approximated by piecewise-linear functions.

Dual-learning Multi-hop Nonnegative Matrix Factorization for community detection

As an important branch of network science, community detection has garnered significant attention. Among various community detection methods, nonnegative matrix factorization (NMF)-based community detection approaches have become a popular research topic. However, most NMF-based methods overlook the network’s multi-hop information, let alone the community detection results specific to each hop of the network. In this paper, we propose Dual-learning Multi-hop NMF (DL-MHNMF), a method that considers not only the multi-hop connectivity between two nodes but also factors in the shared results across multiple hops and the impact of differences in the specific results at each hop on the shared outcomes. An efficient iterative optimization algorithm with guaranteed theoretical convergence is proposed for solving DL-MHNMF. Methodologically, by iteratively removing the specific results during the optimization process of DL-MHNMF, we achieve enhanced detection accuracy, which is also verified by subsequent experiments. Specifically, we compare fourteen algorithms on eleven publicly available datasets, and experimental results show that our algorithm outperforms most state-of-the-art methods. The source code is availiable at https://github.com/bx20000827/DL-MHNMF.git.

A novel metaheuristic based on object-oriented programming concepts for engineering optimization

This paper presents a novel, robust, efficient, and simple optimization algorithm called the Object-Oriented Programming Optimization Algorithm (OOPOA) for tackling constrained and unconstrained optimization problems. The algorithm is inspired by the inheritance concept of Object-Oriented programming languages, where the features of a class are classified into three types according to inheritance probability: public, private, and protected. The object-oriented programming inheritance concept is implemented in the algorithm to update the population for the next generations. The proposed algorithm ensures exploitation by selecting the solution with the highest fitness to be inherited in each iteration. It ensures exploration by applying a mutation process that helps explore wide regions in the search space. The performance of this technique is demonstrated by solving 34 different optimization tasks, including 20 standard benchmark problems, ten IEEE Congress of Evolutionary Computation benchmark test functions, and four constrained real-world engineering design problems.

A Meta-DDPG Algorithm for Energy and Spectral Efficiency Optimization in STAR-RIS-Aided SWIPT

A Meta-DDPG Algorithm for Energy and Spectral Efficiency Optimization in STAR-RIS-Aided SWIPT

Comprehensive Multiview Representation Learning via Deep Autoencoder-Like Nonnegative Matrix Factorization.

Learning a comprehensive representation from multiview data is crucial in many real-world applications. Multiview representation learning (MRL) based on nonnegative matrix factorization (NMF) has been widely adopted by projecting high-dimensional space into a lower order dimensional space with great interpretability. However, most prior NMF-based MRL techniques are shallow models that ignore hierarchical information. Although deep matrix factorization (DMF)-based methods have been proposed recently, most of them only focus on the consistency of multiple views and have cumbersome clustering steps. To address the above issues, in this article, we propose a novel model termed deep autoencoder-like NMF for MRL (DANMF-MRL), which obtains the representation matrix through the deep encoding stage and decodes it back to the original data. In this way, through a DANMF-based framework, we can simultaneously consider the multiview consistency and complementarity, allowing for a more comprehensive representation. We further propose a one-step DANMF-MRL, which learns the latent representation and final clustering labels matrix in a unified framework. In this approach, the two steps can negotiate with each other to fully exploit the latent clustering structure, avoid previous tedious clustering steps, and achieve optimal clustering performance. Furthermore, two efficient iterative optimization algorithms are developed to solve the proposed models both with theoretical convergence analysis. Extensive experiments on five benchmark datasets demonstrate the superiority of our approaches against other state-of-the-art MRL methods.

Efficient mini-batch stochastic gradient descent with Centroidal Voronoi Tessellation for PDE-constrained optimization under uncertainty

The study of optimal control problems under uncertainty plays an important role in scientific numerical simulations. This class of optimization problems is frequently utilized in engineering, biology and finance. Although stochastic gradient descent is a well-known stochastic optimization technique for solving the approximate optimal control problem, it often exhibits a slow convergence rate due to the inherent variance in gradient approximation. To address this issue, we propose a more efficient stochastic optimization algorithm based on Centroidal Voronoi Tessellation sampling. This strategy reduces the error in gradient estimation compared to the conventional mini-batch stochastic gradient descent method. Our approach involves dividing the whole snapshot set into several Voronoi cells with low variance and extracting samples with good uniformity from each region to construct an unbiased estimation of the full gradient. Our method can economically and stably approximate numerical optimal control functions even with a fixed step size. Numerical results demonstrate that the proposed method is a reliable algorithm with great potential for applications in the field of optimization.

Multi-view and Multi-order Graph Clustering via Constrained [formula omitted]-norm

The graph-based multi-view clustering algorithms achieve decent clustering performance by consensus graph learning of the first-order graphs from different views. However, the first-order graphs are often sparse, lacking essential must-link information, which leads to suboptimal consensus graph. While high-order graphs can address this issue, a two-step strategy involving the selection of a fixed number of high-order graphs followed by their fusion may result in information loss or redundancy, restricting the exploration of high-order information. To address these challenges, we propose Multi-view and Multi-order Graph Clustering via Constrained l1,2-norm (MoMvGC), which mitigates the impact of graph sparsity on multi-view clustering. By innovatively designing constrained l1,2-norm, the model ingeniously integrates the selection of multi-order graphs and corresponding weight learning into a unified framework. Furthermore, MoMvGC not only enable sparse selection of multi-order graphs but also simultaneous selection of views. Afterwards, we design an efficient alternative optimization algorithm to solve the optimization problems in MoMvGC. The proposed model achieves state-of-the-art clustering performance on nine real-world datasets, with particularly notable improvements observed on the MSRC dataset, where the clustering accuracy is increased by 5.24% compared to the best baseline. Comprehensive experiments demonstrate the effectiveness and superiority of our model.

Manifold Peaks Nonnegative Matrix Factorization.

Nonnegative matrix factorization (NMF) has attracted increasing interest for its high interpretability in recent years. It is shown that the NMF is closely related to fuzzy k -means clustering, where the basis matrix represents the cluster centroids. However, most of the existing NMF-based clustering algorithms often have their decomposed centroids deviate away from the data manifold, which potentially undermines the clustering results, especially when the datasets lie on complicated geometric structures. In this article, we present a manifold peaks NMF (MPNMF) for data clustering. The proposed approach has the following advantages: 1) it selects a number of MPs to characterize the backbone of the data manifold; 2) it enforces the centroids to lie on the original data manifold, by restricting each centroid to be a conic combination of a small number of nearby MPs; 3) it generalizes the graph smoothness regularization to guide the local graph construction; and 4) it solves a general problem of quadratic regularized nonnegative least squares (NNLSs) with group l0 -norm constraint and further develops an efficient optimization algorithm to solve the objective function of the MPNMF. Extensive experiments on both synthetic and real-world datasets demonstrate the effectiveness of the proposed approach.

Review and experimental benchmarking of machine learning algorithms for efficient optimization of cold atom experiments

The generation of cold atom clouds is a complex process which involves the optimization of noisy data in high dimensional parameter spaces. Optimization can be challenging both in and especially outside of the lab due to lack of time, expertise, or access for lengthy manual optimization. In recent years, it was demonstrated that machine learning offers a solution since it can optimize high dimensional problems quickly, without knowledge of the experiment itself. In this paper we present results showing the benchmarking of nine different optimization techniques and implementations, alongside their ability to optimize a rubidium (Rb) cold atom experiment. The investigations are performed on a 3D 87Rb molasses with 10 and 18 adjustable parameters, respectively, where the atom number obtained by absorption imaging was chosen as the test problem. We further compare the best performing optimizers under different effective noise conditions by reducing the signal-to-noise ratio of the images via adapting the atomic vapor pressure in the 2D+ magneto-optical trap and the detection laser frequency stability.

A dynamic aggregation strategy enhanced efficient global optimization algorithm for solving high-dimensional turbomachinery design problems

ABSTRACT To address challenges effectively in turbomachinery design optimization involving high-dimensional ( d ≥ 30 ) expensive black-box problems, a dedicated Efficient Global Optimization (EGO) algorithm is proposed with dynamic aggregation. This specialized approach efficiently navigates optimization tasks with limited sample evaluations. Specifically, the Dynamic Aggregate Efficient Global Optimization (DA-EGO) algorithm decomposes the original high-dimensional design space into low-dimensional subspaces for efficient surrogate-based optimization search, and the optimal solutions of subspaces are combined as an elite-point for the global search. Most importantly, the subspace variables are updated in each iteration, according to the variable interaction analyses in the sub- and full-spaces. The perturbation method and the analysis of variance are used to detect variable interactions. After being validated on 21 benchmark functions ranging from 30 to 90 dimensions, the DA-EGO is used for the optimization of a transonic compressor rotor with 28 variables and a multi-stage compressor optimization with 60 variables. With the above, the effectiveness of the proposed algorithm is well demonstrated.

D2D Matching Techniques for Resource Allocation Management and Power Control Management in B5G/6G

The upcoming 6G network is expected to have a great integration of Device-to-Device (D2D) technology. One of the key advantages of D2D technology is its potential to minimize the load on cellular base stations, which can help extend the lifespan of cellular network infrastructure. D2D multicast communication can meet the growing demand for multimedia content in local area services by maximizing energy efficiency and device lifespan by reusing the same resources for the cellular network. In this paper, we investigate an efficient resource allocation scheme by using the One-To-Many Gale Shapley pairing algorithm (GSA) for efficient allocation and power optimization. We propose a joint optimization approach for D2MD clusters that considers the Signal-to-Interference Noise ratio and energy levels of devices' batteries. The problem is optimized, so it is divided into two convex sub-problems. In the first sub-problem, power allocation is performed for each candidate cluster-head (CH)and cellular user to maximize energy efficiency using the Dinkelbach matching algorithm. In the second sub-problem, the One-to-Many Gale Shapley matching algorithm is used to optimize resource allocation and cluster-head selection to select the Cluster Nodes (CRns) to form the cluster. Numerous investigations show that the suggested technique maintains QoS and minimal battery power requirements while increasing cluster-head longevity and energy efficiency (EE) in D2D applications.

Consensus Affinity Graph Learning via Structure Graph Fusion and Block Diagonal Representation for Multiview Clustering

Learning a robust affinity graph is fundamental to graph-based clustering methods. However, some existing affinity graph learning methods have encountered the following problems. First, the constructed affinity graphs cannot capture the intrinsic structure of data well. Second, when fusing all view-specific affinity graphs, most of them obtain a fusion graph by simply taking the average of multiple views, or directly learning a common graph from multiple views, without considering the discriminative property among diverse views. Third, the fusion graph does not maintain an explicit cluster structure. To alleviate these problems, the adaptive neighbor graph learning approach and the data self-expression approach are first integrated into a structure graph fusion framework to obtain a view-specific structure affinity graph to capture the local and global structures of data. Then, all the structural affinity graphs are weighted dynamically into a consensus affinity graph, which not only effectively incorporates the complementary affinity structure of important views but also has the capability of preserving the consensus affinity structure that is shared by all views. Finally, a k–block diagonal regularizer is introduced for the consensus affinity graph to encourage it to have an explicit cluster structure. An efficient optimization algorithm is developed to tackle the resultant optimization problem. Extensive experiments on benchmark datasets validate the superiority of the proposed method.