Results 41 to 50 of about 682,989 (319)
Continuous black-box optimization with an Ising machine and random subspace coding
A black-box optimization algorithm such as Bayesian optimization finds the extremum of an unknown function by alternating the inference of the underlying function and optimization of an acquisition function.
Syun Izawa +4 more
doaj +1 more source
Matrix-Monotonic Optimization for MIMO Systems [PDF]
For MIMO systems, due to the deployment of multiple antennas at both the transmitter and the receiver, the design variables e.g., precoders, equalizers, training sequences, etc. are usually matrices.
Ma, Shaodan +2 more
core
Algorithms to Solve Unbounded Convex Vector Optimization Problems
This paper is concerned with solution algorithms for general convex vector optimization problems (CVOPs). So far, solution concepts and approximation algorithms for solving CVOPs exist only for bounded problems [Ararat et al. 2022, Doerfler et al. 2021, Loehne et al. 2014]. They provide a polyhedral inner and outer approximation of the upper image that
Andrea Wagner +4 more
openaire +5 more sources
MOFs and COFs in Electronics: Bridging the Gap between Intrinsic Properties and Measured Performance
Metal‐organic frameworks (MOFs) and covalent organic frameworks (COFs) hold promise for advanced electronics. However, discrepancies in reported electrical conductivities highlight the importance of measurement methodologies. This review explores intrinsic charge transport mechanisms and extrinsic factors influencing performance, and critically ...
Jonas F. Pöhls, R. Thomas Weitz
wiley +1 more source
Constraint Qualifications for Vector Optimization Problems in Real Topological Spaces
In this paper, we introduce a series of definitions of generalized affine functions for vector-valued functions by use of “linear set”. We prove that our generalized affine functions have some similar properties to generalized convex functions.
Renying Zeng
doaj +1 more source
Primal and Dual Approximation Algorithms for Convex Vector Optimization Problems
Two approximation algorithms for solving convex vector optimization problems (CVOPs) are provided. Both algorithms solve the CVOP and its geometric dual problem simultaneously. The first algorithm is an extension of Benson's outer approximation algorithm,
Löhne, Andreas +2 more
core +1 more source
Unleashing the Power of Machine Learning in Nanomedicine Formulation Development
A random forest machine learning model is able to make predictions on nanoparticle attributes of different nanomedicines (i.e. lipid nanoparticles, liposomes, or PLGA nanoparticles) based on microfluidic formulation parameters. Machine learning models are based on a database of nanoparticle formulations, and models are able to generate unique solutions
Thomas L. Moore +7 more
wiley +1 more source
Robust Multi-Criteria Traffic Network Equilibrium Problems with Path Capacity Constraints
With the progress of society and the diversification of transportation modes, people are faced with more and more complicated travel choices, and thus, multi-criteria route choosing optimization problems have drawn increased attention in recent years.
Xing-Xing Ma, Yang-Dong Xu
doaj +1 more source
A chiral photodetector capable of selectively distinguishing left‐ and right‐handed circularly polarized light is experimentally demonstrated. The device, which features a nanopatterned electrode inverse‐designed by a genetic algorithm within a metal–dielectric–metal nanocavity that incorporates a vacuum‐deposited small‐molecule multilayer, exhibits ...
Kyung Ryoul Park +3 more
wiley +1 more source
A Hybrid Search Model for Constrained Optimization
This paper proposes a hybrid model based on decomposition for constrained optimization problems. Firstly, a constrained optimization problem is transformed into a biobjective optimization problem.
Xiaoli Gao +3 more
doaj +1 more source

