Results 21 to 30 of about 7,641,552 (201)

A Practical Tutorial on Physics-Informed Networks for Pharmacometrics and Quantitative Systems Pharmacology. [PDF]

open access: yesCPT Pharmacometrics Syst Pharmacol
ABSTRACT Inverse problems in pharmacometrics and quantitative systems pharmacology (QSP) often involve sparse, noisy data, limited measurable states, and complex dynamical systems. Traditional parameter estimation methods can struggle with ill‐posed problems, stiffness, discontinuities, and gray‐box scenarios where only part of the system dynamics is ...
Ahmadi Daryakenari N, Kohandel M.
europepmc   +2 more sources

A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem

open access: yesAbstract and Applied Analysis, 2014
This paper presents a global optimization algorithm for solving globally the generalized nonlinear multiplicative programming (MP) with a nonconvex constraint set.
Lin-Peng Yang   +2 more
doaj   +1 more source

Pooling problem: Alternate formulations and solution methods [PDF]

open access: yes, 2004
Copyright @ 2004 INFORMSThe pooling problem, which is fundamental to the petroleum industry, describes a situation in which products possessing different attribute qualities are mixed in a series of pools in such a way that the attribute qualities of the
Brimberg, J   +9 more
core   +1 more source

Combined Heat and Power Dynamic Economic Dispatch with Emission Limitations Using Hybrid DE-SQP Method

open access: yesAbstract and Applied Analysis, 2013
Combined heat and power dynamic economic emission dispatch (CHPDEED) problem is a complicated nonlinear constrained multiobjective optimization problem with nonconvex characteristics.
A. M. Elaiw, X. Xia, A. M. Shehata
doaj   +1 more source

Linear decomposition approach for a class of nonconvex programming problems

open access: yesJournal of Inequalities and Applications, 2017
This paper presents a linear decomposition approach for a class of nonconvex programming problems by dividing the input space into polynomially many grids.
Peiping Shen, Chunfeng Wang
doaj   +1 more source

Robust Adaptive Beamformer Based on Constant Modulus Penalty Criteria

open access: yesInternational Journal of Aerospace Engineering, 2023
In this study, a robust adaptive beamformer based on constant modulus (CM) criteria is developed to improve the robustness of the array beamforming, which is a reconstructing minimal optimization for solving the mismatch problem of weight vector caused ...
Chuanhui Hao, Bin Zhang, Xubao Sun
doaj   +1 more source

A Mixed-Integer Linear Programming Model for the Simultaneous Optimal Distribution Network Reconfiguration and Optimal Placement of Distributed Generation

open access: yesEnergies, 2022
Distributed generation (DG) aims to generate part of the required electrical energy on a small scale closer to the places of consumption. Integration of DG into an existing electric distribution network (EDN) has technical, economic, and environmental ...
Luis A. Gallego Pareja   +2 more
doaj   +1 more source

WITHDRAWN: Nonconvex optimization based on DC programming and DCA in the search of a global optimum of a nonconvex function

open access: yesJournal of the Egyptian Mathematical Society, 2015
This article has been withdrawn at the request of the author(s) and/or editor. The Publisher apologizes for any inconvenience this may cause. The full Elsevier Policy on Article Withdrawal can be found at http://www.elsevier.com/locate/withdrawalpolicy.
Leslous, Fadila   +3 more
openaire   +1 more source

An Enhanced SDR Based Global Algorithm for Nonconvex Complex Quadratic Programs With Signal Processing Applications

open access: yesIEEE Open Journal of Signal Processing, 2020
In this paper, we consider a class of nonconvex complex quadratic programming (CQP) problems, which find a broad spectrum of signal processing applications.
Cheng Lu, Ya-Feng Liu, Jing Zhou
doaj   +1 more source

An accelerating algorithm for globally solving nonconvex quadratic programming

open access: yesJournal of Inequalities and Applications, 2018
To globally solve a nonconvex quadratic programming problem, this paper presents an accelerating linearizing algorithm based on the framework of the branch-and-bound method. By utilizing a new linear relaxation approach, the initial quadratic programming
Li Ge, Sanyang Liu
doaj   +1 more source

Home - About - Disclaimer - Privacy