Results 31 to 40 of about 7,060 (144)
Transfer Learning Approaches in Bioprocess Engineering: Opportunities and Challenges
ABSTRACT Transfer learning (TL) has recently emerged as a promising approach to overcoming one of the key limitations of bioprocess engineering: data scarcity. By leveraging knowledge from one bioprocess to another, TL allows existing models and data sets to be reused efficiently, accelerating process development, improving prediction accuracy, and ...
Daniel Barón Díaz +3 more
wiley +1 more source
A Nonconvex Proximal Bundle Method for Nonsmooth Constrained Optimization
An implementable algorithm for solving nonsmooth nonconvex constrained optimization is proposed by combining bundle ideas, proximity control, and the exact penalty function.
Jie Shen, Fang-Fang Guo, Na Xu
doaj +1 more source
ABSTRACT We study the accuracy of a variety of parametric price duration‐based realized variance estimators constructed via various financial duration models and compare their forecasting performance with the performance of various nonparametric return‐based realized variance estimators.
Björn Schulte‐Tillmann +2 more
wiley +1 more source
A Simple and Efficient Algorithm for Nonlinear Model Predictive Control
We present PANOC, a new algorithm for solving optimal control problems arising in nonlinear model predictive control (NMPC). A usual approach to this type of problems is sequential quadratic programming (SQP), which requires the solution of a quadratic ...
Patrinos, Panagiotis +3 more
core +1 more source
Structural Feature Selection in Common Spatial Patterns Using Adaptive Sparse Group Lasso
ABSTRACT With the advancement of brain–computer interfaces (BCI), motor imagery (MI) electroencephalogram (EEG) decoding can greatly benefit from spatial filtering features derived from common spatial patterns (CSP). However, CSP‐based features often exhibit high redundancy and intersubject variability.
Yadi Wang +4 more
wiley +1 more source
The rank constrained nonconvex nonsmooth matrix optimization problem is an important and challenging issue. To solve it, we first design a penalty model in which the penalty term can be expressed as a sum of specific functions defined on smallest ...
Zhang Wenjuan +4 more
doaj +1 more source
R-algorithm for Solving Quadratic Programming Problems
Quadratic programming problems have a wide range of practical applications in various fields of science and engineering, particularly in financial modeling and pattern recognition, which underscores the relevance of studying methods for their efficient ...
Petro Stetsyuk +3 more
doaj +1 more source
Accelerated Method for Stochastic Composition Optimization with Nonsmooth Regularization
Stochastic composition optimization draws much attention recently and has been successful in many emerging applications of machine learning, statistical analysis, and reinforcement learning.
Gu, Bin +3 more
core +1 more source
ABSTRACT A formation inversion algorithm with real‐time performance and accuracy is crucial for natural gamma logging while drilling (LWD). However, traditional inversion algorithms are often limited by high computational resource consumption and insufficient accuracy.
Juntao Liu +4 more
wiley +1 more source
Abstract We propose the novel p‐branch‐and‐bound method for solving two‐stage stochastic programming problems whose deterministic equivalents are represented by non‐convex mixed‐integer quadratically constrained quadratic programming (MIQCQP) models. The precision of the solution generated by the p‐branch‐and‐bound method can be arbitrarily adjusted by
Nikita Belyak, Fabricio Oliveira
wiley +1 more source

