Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization problems”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,297 records · Page 72

Toward cities without slums: Topology and the spatial evolution of neighborhoods

The world is urbanizing quickly with nearly 4 billion people presently living in urban areas, about 1 billion of them in slums. Achieving sustainable development from rapid urbanization relies critically on creating cities without slums. We show that it is possible to diagnose systematically the central physical problem of slums—the lack of spatial accesses and related services—using a topological analysis of neighborhood maps and resolved by finding solutions to a sequence of constrained optimization problems. We set up the problem by showing that the built environment of any city can be decomposed into two types of networked spaces—accesses and places—and prove that these spaces display universal topological characteristics. We then show that while the neighborhoods of developed cities express the same common topology, urban slums fall into a different topological class. We demonstrate that it is always possible to find solutions that grow a street network in existing slums, providing universal accesses at minimal disruption and cost. We then show how elaborations of this procedure that include local preferences and reduce travel distances between places result from additional access construction. These methods are presently taking effect in neighborhoods in Cape Town (South Africa) and Mumbai (India), demonstrating their practical feasibility and emphasizing their role as a platform to enable communities and local governments to combine technical knowledge with local aspirations into contextually appropriate urban sustainable development solutions.

99 GENERAL AND MISCELLANEOUS↗

Efficient Algorithm for Locating and Sizing Series Compensation Devices in Large Transmission Grids: Model Implementation (PART 1)

We explore optimization methods for planning the placement, sizing and operations of Flexible Alternating Current Transmission System (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to Series Compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l 1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of Linear Programs (LP) which are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop—a speed up that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically-sized networks that suffer congestion from a range of causes including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically-sized network.

25 ENERGY STORAGE↗

Dynamic Modeling, Trajectory Optimization, and Linear Control of Cable-Driven Parallel Robots for Automated Panelized Building Retrofits

The construction industry faces a growing need for automation to reduce costs, improve accuracy and productivity, and address labor shortages. One area that stands to benefit significantly from automation is panelized prefabricated building envelope retrofits, which can improve a building’s energy efficiency in heating and cooling interior spaces. In this paper, we propose using cable-driven parallel robots (CDPRs), which can effectively lift and handle large objects, to install these panels. However, implementing CDPRs presents significant challenges because of their nonlinear dynamics, complex trajectory planning, and precise control requirements. To tackle these challenges, this work focuses on a new application of established control and trajectory optimization theories in a CDPR simulation of a building envelope retrofit under real-world conditions. We first model the dynamics of CDPRs, highlighting the critical role of damping in system behavior. Building on this dynamic model, we formulate a trajectory optimization problem to generate feasible and efficient motion plans for the robot under operational and environmental constraints. Given the high precision required in the construction industry, accurately tracking the optimized trajectory is essential. However, challenges such as partial observability and external vibrations complicate this task. To address these issues, a Linear Quadratic Gaussian control framework is applied, enabling the robot to track the optimized trajectories with precision. Simulation results show that the proposed controller enables precise end effector positioning with errors under 4 mm, even in the presence of external wind disturbances. Through comprehensive simulations, our approach allows for an in-depth exploration of the system’s nonlinear dynamics, trajectory optimization, and control strategies under controlled yet highly realistic conditions. The results demonstrate the feasibility of CDPRs for automating panel installation and provide insights into their practical deployment.

CDPR↗

Tradeoff methods in multiobjective insensitive design of airplane control systems

The latest results of an ongoing study of computer-aided design of airplane control systems are given. Constrained minimization algorithms are used, with the design objectives in the constraint vector. The concept of Pareto optimiality is briefly reviewed. It is shown how an experienced designer can use it to find designs which are well-balanced in all objectives. Then the problem of finding designs which are insensitive to uncertainty in system parameters are discussed, introducing a probabilistic vector definition of sensitivity which is consistent with the deterministic Pareto optimal problem. Insensitivity is important in any practical design, but it is particularly important in the design of feedback control systems, since it is considered to be the most important distinctive property of feedback control. Methods of tradeoff between deterministic and stochastic-insensitive (SI) design are described, and tradeoff design results are presented for the example of the a Shuttle lateral stability augmentation system. This example is used because careful studies have been made of the uncertainty in Shuttle aerodynamics. Finally, since accurate statistics of uncertain parameters are usually not available, the effects of crude statistical models on SI designs are examined.

Schy, A. A.↗

Flight-test guidance for airbreathing hypersonic vehicles

A guidance solution for aerospace planes is given based on a family of energy-heading extremal solutions that can be used for feedback implementations. Test conditions are developed as steady-cruise solutions by means of energy-heading extremal solutions to a time/fuel-range flight-optimization problem. Feedback charts are derived that give control as a function of energy and heading-to-go, and the reduced-order model is compared to numerically optimized point-mass solutions for flight optimization. The energy-heading model is shown to provide feedback-control charts that yield fuel-efficient turn/acceleration maneuvers with significant weight-change as compared to the point-mass solutions. Such variables as Mach number, dynamic pressure, and lift are found to influence the solutions significantly.

Cliff, Eugene M.↗

Newton modified barrier method in constrained optimization

In this paper, we develop and investigate the Newton method for solving constrained (non-smooth) optimization problems. This approach is based on the modified barrier functions (MBF) theory and on the global converging step-size version of the Newton method for smooth unconstrained optimization. Due to the excellent properties of the MBF near primal-dual solution, the Newton modified barrier method (NMBM) has a better rate of convergence, better complexity bound, and is much more stable in the final stage of the computational process than the methods which are based on the classical barrier functions (CBF).

Polyak, R.↗

MESSENGER at Mercury: Early Orbital Operations

The MErcury Surface, Space ENvironment, GEochemistry, and Ranging (MESSENGER) spacecraft, launched in August 2004 under NASA's Discovery Program, was inserted into orbit about the planet Mercury in March 2011. MESSENGER's three flybys of Mercury in 2008-2009 marked the first spacecraft visits to the innermost planet since the Mariner 10 flybys in 1974-1975. The unprecedented orbital operations are yielding new insights into the nature and evolution of Mercury. The scientific questions that frame the MESSENGER mission led to the mission measurement objectives to be achieved by the seven payload instruments and the radio science experiment. Interweaving the full set of required orbital observations in a manner that maximizes the opportunity to satisfy all mission objectives and yet meet stringent spacecraft pointing and thermal constraints was a complex optimization problem that was solved with a software tool that simulates science observations and tracks progress toward meeting each objective. The final orbital observation plan, the outcome of that optimization process, meets all mission objectives. MESSENGER's Mercury Dual Imaging System is acquiring a global monochromatic image mosaic at better than 90% coverage and at least 250 m average resolution, a global color image mosaic at better than 90% coverage and at least 1 km average resolution, and global stereo imaging at better than 80% coverage and at least 250 m average resolution. Higher-resolution images are also being acquired of targeted areas. The elemental remote sensing instruments, including the Gamma-Ray and Neutron Spectrometer and the X-Ray Spectrometer, are being operated nearly continuously and will establish the average surface abundances of most major elements. The Visible and Infrared Spectrograph channel of MESSENGER's Mercury Atmospheric and Surface Composition Spectrometer is acquiring a global map of spectral reflectance from 300 to 1450 nm wavelength at a range of incidence and emission angles. Targeted areas have been selected for spectral coverage into the ultraviolet with the Ultraviolet and Visible Spectrometer (UVVS). MESSENGER's Mercury Laser Altimeter is acquiring topographic profiles when the slant range to Mercury's surface is less than 1800 km, encompassing latitudes from 20 deg. S to the north pole. Topography over the remainder of the southern hemisphere will be derived from stereo imaging, radio occultations, and limb profiles. MESSENGER's radio science experiment is determining Mercury's gravity field from Doppler signals acquired during frequent downlinks. MESSENGER's Magnetometer is measuring the vector magnetic field both within Mercury's magnetosphere and in Mercury's solar wind environment at an instrument sampling rate of up to 20 samples/s. The UVVS is determining the three-dimensional, time-dependent distribution of Mercury's exospheric neutral and ionic species via their emission lines. During each spacecraft orbit, the Energetic Particle Spectrometer measures energetic electrons and ions, and the Fast Imaging Plasma Spectrometer measures the energies and mass per charge of thermal plasma components, both within Mercury's magnetosphere and in Mercury's solar-wind environment. The primary mission observation sequence will continue for one Earth year, until March 2012. An extended mission, currently under discussion with NASA, would add a second year of orbital observations targeting a set of focused follow-on questions that build on observations to date and take advantage of the more active Sun expected during 2012-2013. MESSENGER's total primary mission cost, projected at $446 M in real-year dollars, is comparable to that of Mariner 10 after adjustment for inflation.

mercury↗

MESSENGER at Mercury: Early Orbital Operations

The MErcury Surface, Space ENvironment, GEochemistry, and Ranging (MESSENGER) spacecraft, launched in August 2004 under NASA's Discovery Program, was inserted into orbit about the planet Mercury in March 2011. MESSENGER's three flybys of Mercury in 2008-2009 marked the first spacecraft visits to the innermost planet since the Mariner 10 flybys in 1974-1975. The unprecedented orbital operations are yielding new insights into the nature and evolution of Mercury. The scientific questions that frame the MESSENGER mission led to the mission measurement objectives to be achieved by the seven payload instruments and the radio science experiment. Interweaving the full set of required orbital observations in a manner that maximizes the opportunity to satisfy all mission objectives and yet meet stringent spacecraft pointing and thermal constraints was a complex optimization problem that was solved with a software tool that simulates science observations and tracks progress toward meeting each objective. The final orbital observation plan, the outcome of that optimization process, meets all mission objectives. MESSENGER's Mercury Dual Imaging System is acquiring a global monochromatic image mosaic at better than 90%coverage and at least 250 m average resolution, a global color image mosaic at better than 90%coverage and at least 1 km average resolution, and global stereo imaging at better than 80%coverage and at least 250 m average resolution. Higher-resolution images are also being acquired of targeted areas. The elemental remote sensing instruments, including the Gamma-Ray and Neutron Spectrometer and the X-Ray Spectrometer, are being operated nearly continuously and will establish the average surface abundances of most major elements. The Visible and Infrared Spectrograph channel of MESSENGER's Mercury Atmospheric and Surface Composition Spectrometer is acquiring a global map of spectral reflectance from 300 to 1450 nm wavelength at a range of incidence and emission angles. Targeted areas have been selected for spectral coverage into the ultraviolet with the Ultraviolet and Visible Spectrometer (UVVS). MESSENGER's Mercury Laser Altimeter is acquiring topographic profiles when the slant range to Mercury's surface is less than 1800 km, encompassing latitudes from 201S to the north pole. Topography over the remainder of the southern hemisphere will be derived from stereo imaging, radio occultations, and limb profiles. MESSENGER's radio science experiment is determining Mercury's gravity field from Doppler signals acquired during frequent downlinks. MESSENGER's Magnetometer is measuring the vector magnetic field both within Mercury's magnetosphere and in Mercury's solar wind environment at an instrument sampling rate of up to 20 samples/s. The UVVS is determining the three-dimensional, time-dependent distribution of Mercury's exospheric neutral and ionic species via their emission lines. During each spacecraft orbit, the Energetic Particle Spectrometer measures energetic electrons and ions, and the Fast Imaging Plasma Spectrometer measures the energies and mass per charge of thermal plasma components, both within Mercury's magnetosphere and in Mercury's solar-wind environment. The primary mission observation sequence will continue for one Earth year, until March 2012. An extended mission, currently under discussion with NASA, would add a second year of orbital observations targeting a set of focused follow-on questions that build on observations to date and take advantage of the more active Sun expected during 2012-2013. MESSENGER's total primary mission cost, projected at $446 M in real-year dollars, is comparable to that of Mariner 10 after adjustment for inflation.

Planetary Science↗

Introducing the target-matrix paradigm for mesh optimization via node-movement.

A general-purpose algorithm for mesh optimization via node movement, known as the Target-Matrix Paradigm, is introduced. The algorithm is general purpose in that it can be applied to a wide variety of mesh and element types, and to various commonly recurring mesh optimization problems such as shape improvement, and to more unusual problems like boundary-layer preservation with sliver removal, high-order mesh improvement, and edge-length equalization. The algorithm can be considered to be a direct optimization method in which weights are automatically constructed to enable definitions of application-specific mesh quality. The high-level concepts of the paradigm have been implemented in the Mesquite mesh-improvement library, along with a number of concrete algorithms that address mesh quality issues such as those shown in the examples of the present paper.

99 GENERAL AND MISCELLANEOUS↗

Curved Finite Elements and Curve Approximation

The approximation of parameterized curves by segments of parabolas that pass through the endpoints of each curve segment arises naturally in all quadratic isoparametric transformations. While not as popular as cubics in curve design problems, the use of parabolas allows the introduction of a geometric measure of the discrepancy between given and approximating curves. The free parameters of the parabola may be used to optimize the fit, and constraints that prevent overspill and curve degeneracy are introduced. This leads to a constrained optimization problem in two varibles that can be solved quickly and reliably by a simple method that takes advantage of the special structure of the problem. For applications in the field of computer-aided design, the given curves are often cubic polynomials, and the coefficient may be calculated in closed form in terms of polynomial coefficients by using a symbolic machine language so that families of curves can be approximated with no further integration. For general curves, numerical quadrature may be used, as in the implementation where the Romberg quadrature is applied. The coefficient functions C sub 1 (gamma) and C sub 2 (gamma) are expanded as polynomials in gamma, so that for given A(s) and B(s) the integrations need only be done once. The method was used to find optimal constrained parabolic approximation to a wide variety of given curves.

Baart, M. L.↗

Empirical performance bounds for quantum approximate optimization

The quantum approximate optimization algorithm (QAOA) has been put forth as a method for near-term quantum computers to solve optimization problems. However, assessments of QAOA performance have mostly focused on small structured problem instances while performance on more general instances is less clear. Here, we numerically simulate QAOA pure state dynamics for every instance of MaxCut on non-isomorphic unweighted graphs with nine or fewer vertices with depth parameters p ≤ 3. We find the approximation ratios and optimized circuit parameters concentrate across graphs of a given size and empirically show increases in concentration as graph size increases. The parameter concentration leads to two median-angle heuristics that overcome difficulties in QAOA parameter optimization and obtain mean approximation ratios within 3% and 0.2% of the optimal. We also analyze the probability to measure an optimal solution and find increasing variations between graphs as depth increases, in stark contrast to the approximation ratios which concentrate as depth increases. Furthermore, the resulting benchmark data set gives empirical bounds for on-going experimental realizations and lays groundwork for theoretical extensions to greater problem sizes and depths where QAOA may prove important for practically relevant problems.

79 ASTRONOMY AND ASTROPHYSICS↗

A dual mesh method with adaptivity for stress-constrained topology optimization

This paper is concerned with the topological optimization of elastic structures, with the goal of minimizing the compliance and/or mass of the structure, subject to a stress constraint. It is well known that depending upon the geometry and the loading conditions, the stress field can exhibit singularities, if these singularities are not adequately resolved, the topological optimization process will be ineffective. For computational efficiency, adaptive mesh refinement is required to adequately resolve the stress field. This poses a challenge for the traditional Solid Isotropic Material with Penalization (SIMP) method that employs a one-to-one correspondence between the finite element mesh and the optimization design variables because as the mesh is refined, the optimization process must somehow be re-started with a new set of design variables. The proposed solution here is a dual mesh approach, one finite element mesh defines the material distribution, a second finite element mesh is used for the computation of the displacement and stress fields. This allows for stress-based adaptive mesh refinement without modifying the definition of the optimization design variables. A second benefit of this dual mesh approach is that there is no need to apply a filter to the design variables to enforce a length scale, instead the length scale is determined by the design mesh. This reduces the number of design variables and allows the designer to apply spatially varying length scale if desired. The efficacy of this dual mesh approach is established via several stress-constrained topology optimization problems.

36 MATERIALS SCIENCE↗

Learning-Accelerated ADMM for Distributed DC Optimal Power Flow

We suggest a novel data-driven method to accelerate the convergence of Alternating Direction Method of Multipliers (ADMM) for solving distributed DC optimal power flow (DC-OPF) where lines are shared between independent network partitions. Using previous observations of ADMM trajectories for a given system under varying load, the method trains a recurrent neural network (RNN) to predict the converged values of dual and consensus variables. Given a new realization of system load, a small number of initial ADMM iterations is taken as input to infer the converged values and directly inject them into the iteration. We empirically demonstrate that the online injection of these values into the ADMM iteration accelerates convergence by a significant factor for partitioned 14-, 118-and 2848-bus test systems under differing load scenarios. The proposed method has several advantages: it maintains the security of private decision variables inherent in consensus ADMM; inference is fast and so may be used in online settings; RNN-generated predictions can dramatically improve time to convergence but, by construction, can never result in infeasible ADMM subproblems; it can be easily integrated into existing software implementations. While we focus on the ADMM formulation of distributed DC-OPF in this paper, the ideas presented are naturally extended to other distributed optimization problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Topology Synthesis of Structures Using Parameter Relaxation and Geometric Refinement

Typically, structural topology optimization problems undergo relaxation of certain design parameters to allow the existence of intermediate variable optimum topologies. Relaxation permits the use of a variety of gradient-based search techniques and has been shown to guarantee the existence of optimal solutions and eliminate mesh dependencies. This Technical Publication (TP) will demonstrate the application of relaxation to a control point discretization of the design workspace for the structural topology optimization process. The control point parameterization with subdivision has been offered as an alternative to the traditional method of discretized finite element design domain. The principle of relaxation demonstrates the increased utility of the control point parameterization. One of the significant results of the relaxation process offered in this TP is that direct manufacturability of the optimized design will be maintained without the need for designer intervention or translation. In addition, it will be shown that relaxation of certain parameters may extend the range of problems that can be addressed; e.g., in permitting limited out-of-plane motion to be included in a path generation problem.

Hull, P. V.↗

A multi-objective optimization approach to optimal sensor location problem in $\mathrm{IGCC}$ power plants

Integrated Gasification Combined Cycle (IGCC) power plants provide a cleaner and more efficient way to obtain energy from coal. In order to operate an IGCC power plant in a safe and stable manner, several input and output process parameters need to be monitored. However, due to economic and operational constraints, it is infeasible to place sensors at every input and output process parameter location. Hence, it becomes important to select the most effective sensor locations which lead to maximum information gain about the plant conditions. Practical issues present in an IGCC power plant, such as harsh physical conditions and variability in process parameters, make the optimal sensor location problem an especially complicated one. Further, sensors can have multiple objectives and they can produce uncertainties due to measurement errors. Here this work considers hybrid hardware and virtual sensing for advanced power systems with multiple objectives. In order to solve this real world large scale problem, we use a novel algorithm called Better Optimization of Nonlinear Uncertain Systems (BONUS). BONUS works in probability distribution space and avoids sampling for each optimization and derivative calculations iterations. A new algorithm for multi-objective optimization is also developed specifically for problem. The result of this nonlinear stochastic multi-objective problem is the non-dominated, or Pareto set, which provides trade-offs between various objectives like observability, cost, and thermal efficiency. This is the first attempt at solving the problem of optimal sensor deployment in advanced power plants, with consideration of hybrid hardware and virtual sensing and incorporation of uncertainty with multiple objectives.

01 COAL, LIGNITE, AND PEAT↗

Machine learning-based ethylene concentration estimation, real-time optimization and feedback control of an experimental electrochemical reactor

With the increase in electricity supply from clean energy sources, electrochemical reduction of carbon dioxide (CO 2 ) has received increasing attention as an alternative source of carbon-based fuels. As CO 2 reduction is becoming a stronger alternative for the clean production of chemicals, the need to model, optimize and control the electrochemical reduction of the CO 2 process becomes inevitable. However, on one hand, a first-principles model to represent the electrochemical CO 2 reduction has not been fully developed yet because of the complexity of its reaction mechanism, which makes it challenging to define a precise state-space model for the control system. On the other hand, the unavailability of efficient concentration measurement sensors continues to challenge our ability to develop feedback control systems. Gas chromatography (GC) is the most common equipment for monitoring the gas product composition, but it requires a period of time to analyze the sample, which means that GC can provide only delayed measurements during the operation. Moreover, the electrochemical CO 2 reduction process is catalyzed by a fast-deactivating copper catalyst and undergoes a selectivity shift from the product-of-interest at the later stages of experiments, which can pose a challenge for conventional control methods. To this end, machine learning (ML) techniques provide a potential approach to overcome those difficulties due to their demonstrated ability to capture the dynamic behavior of a chemical process from data. Motivated by the above considerations, we propose a machine learning-based modeling methodology that integrates support vector regression and first-principles modeling to capture the dynamic behavior of an experimental electrochemical reactor; this model, together with limited gas chromatography measurements, is employed to predict the evolution of gas-phase ethylene concentration. The model prediction is directly used in a proportional-integral (PI) controller that manipulates the applied potential to regulate the gas-phase ethylene concentration at energy-optimal set-point values computed by a real-time process optimizer (RTO). Specifically, the RTO calculates the operation set-point by solving an optimization problem to maximize the economic benefit of the reactor. Finally, suitable compensation methods are introduced to further account for the experimental uncertainties and handle catalyst deactivation. The proposed modeling, optimization, and control approaches are the first demonstration of active control for a CO 2 electrolyzer and contribute to the automation and scale-up efforts for electrified manufacturing of fuels and chemicals starting from CO 2 .

42 ENGINEERING↗

Design optimization methods for high-performance research reactor core design

Typical objectives of high-performance research reactors include neutron scattering, materials irradiation, and isotope production. The creation of a core that optimizes these multiple objectives often presents a multidimensional (i.e., in design space), multiobjective optimization problem. The developed systematic approach discussed herein draws on response surface methodology to validate and leverage a surrogate model to serve in place of high-fidelity computational analyses. Optimization and design analysis methods leverage this surrogate model to provide a flexible tool for generating optimized designs and understanding the impact of design decisions on desired metrics. In applications to High Flux Isotope Reactor (HFIR) low-enriched uranium (LEU) core designs, neutronic, isotopic evolution, and thermal hydraulic analyses are used to generate key performance and safety metrics for assessing the feasibility and fitness of given designs. Three optimized designs that determine different desired metrics and constraints (e.g., key metric weighting and fabrication constraints) are presented, providing potential design options that satisfy the requirements for HFIR’s conversion from high enriched uranium to LEU fuel.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Augmenting subspace optimization methods with linear bandits

In this work, we consider the framework of methods for unconstrained minimization that are, in each iteration, restricted to a model that is only a valid approximation to the objective function on some affine subspace containing an incumbent point. These methods are of practical interest in computational settings where derivative information is either expensive or impossible to obtain. Recent attention has been paid in the literature to employing randomized matrix sketching for generating the affine subspaces within this framework. We consider a relatively straightforward, deterministic augmentation of such a generic subspace optimization method. In particular, we consider a sequential optimization framework where actions consist of one-dimensional linear subspaces and rewards consist of (approximations to) the magnitudes of directional derivatives computed in the direction of the action subspace. Reward maximization in this context is consistent with maximizing lower bounds on descent guaranteed by first-order Taylor models. This sequential optimization problem can be analysed through the lens of dynamic regret. We modify an existing linear upper confidence bound (UCB) bandit method and prove sublinear dynamic regret in the subspace optimization setting. We demonstrate the efficacy of employing this linear UCB method in a setting where forward-mode algorithmic differentiation can provide directional derivatives in arbitrary directions and in a derivative-free setting. For the derivative-free setting, we propose SS-POUNDers, an extension of the derivative-free optimization method POUNDers that employs the linear UCB mechanism to identify promising subspaces. Our numerical experiments suggest a preference, in either computational setting, for employing a linear UCB mechanism within a subspace optimization method.

97 MATHEMATICS AND COMPUTING↗