A new filter QP-free method for the nonlinear inequality constrained optimization problem.
Ontology highlight
ABSTRACT:
SUBMITTER: Shang Y
PROVIDER: S-EPMC6208610 | biostudies-other | 2018
REPOSITORIES: biostudies-other
Similar Datasets
Project description:A method for fitting sedimentation velocity experiments using whole boundary Lamm equation solutions is presented. The method, termed parametrically constrained spectrum analysis (PCSA), provides an optimized approach for simultaneously modeling heterogeneity in size and anisotropy of macromolecular mixtures. The solutions produced by PCSA are particularly useful for modeling polymerizing systems, where a single-valued relationship exists between the molar mass of the growing polymer chain and its corresponding anisotropy. The PCSA uses functional constraints to identify this relationship, and unlike other multidimensional grid methods, assures that only a single molar mass can be associated with a given anisotropy measurement. A description of the PCSA algorithm is presented, as well as several experimental and simulated examples that illustrate its utility and capabilities. The performance advantages of the PCSA method in comparison to other methods are documented. The method has been added to the UltraScan-III software suite, which is available for free download from http://www.ultrascan.uthscsa.edu.
| S-EPMC4008825 | biostudies-literature
Project description:In quantitative proteomics applications, the use of isobaric labels is a very popular concept as they allow for multiplexing, such that peptides from multiple biological samples are quantified simultaneously in one mass spectrometry experiment. Although this multiplexing allows that peptide intensities are affected by the same amount of instrument variability, systematic effects during sample preparation can also introduce a bias in the quantitation measurements. Therefore, normalization methods are required to remove this systematic error. At present, a few dedicated normalization methods for isobaric labeled data are at hand. Most of these normalization methods include a framework for statistical data analysis and rely on ANOVA or linear mixed models. However, for swift quality control of the samples or data visualization a simple normalization technique is sufficient. To this aim, we present a new and easy-to-use data-driven normalization method, named CONSTANd. The CONSTANd method employs constrained optimization and prior information about the labeling strategy to normalize the peptide intensities. Further, it allows maintaining the connection to any biological effect while reducing the systematic and technical errors. As a result, peptides can not only be compared directly within a multiplexed experiment, but are also comparable between other isobaric labeled datasets from multiple experimental designs that are normalized by the CONSTANd method, without the need to include a reference sample in every experimental setup. The latter property is especially useful when more than six, eight or ten (TMT/iTRAQ) biological samples are required to detect differential peptides with sufficient statistical power and to optimally make use of the multiplexing capacity of isobaric labels.
| S-EPMC4974351 | biostudies-literature
Project description:Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable. Nature-inspired metaheuristics are appropriate for solving such problems; however, literature review shows that there are very few applications of nature-inspired metaheuristics to portfolio optimization problem. This is especially true for swarm intelligence algorithms which represent the newer branch of nature-inspired algorithms. No application of any swarm intelligence metaheuristics to cardinality constrained mean-variance (CCMV) portfolio problem with entropy constraint was found in the literature. This paper introduces modified firefly algorithm (FA) for the CCMV portfolio model with entropy constraint. Firefly algorithm is one of the latest, very successful swarm intelligence algorithm; however, it exhibits some deficiencies when applied to constrained problems. To overcome lack of exploration power during early iterations, we modified the algorithm and tested it on standard portfolio benchmark data sets used in the literature. Our proposed modified firefly algorithm proved to be better than other state-of-the-art algorithms, while introduction of entropy diversity constraint further improved results.
| S-EPMC4060745 | biostudies-other
Project description:BackgroundWhen outliers are present, the least squares method of nonlinear regression performs poorly. The main purpose of this paper is to provide a robust alternative technique to the Ordinary Least Squares nonlinear regression method. This new robust nonlinear regression method can provide accurate parameter estimates when outliers and/or influential observations are present.MethodReal and simulated data for drug concentration and tumor size-metastasis are used to assess the performance of this new estimator. Monte Carlo simulations are performed to evaluate the robustness of our new method in comparison with the Ordinary Least Squares method.ResultsIn simulated data with outliers, this new estimator of regression parameters seems to outperform the Ordinary Least Squares with respect to bias, mean squared errors, and mean estimated parameters. Two algorithms have been proposed. Additionally and for the sake of computational ease and illustration, a Mathematica program has been provided in the Appendix.ConclusionThe accuracy of our robust technique is superior to that of the Ordinary Least Squares. The robustness and simplicity of computations make this new technique more appropriate and useful tool for the analysis of nonlinear regressions.
| S-EPMC4501042 | biostudies-literature
Project description:Portfolio optimization is one of the most important issues in financial markets. In this regard, the more realistic are assumptions and conditions of modelling to portfolio optimization into financial markets, the more reliable results will be obtained. This paper studies the knapsack-based portfolio optimization problem that involves discrete variables. This model has two very important features; achieving the optimal number of shares as an integer and with masterly efficiency in portfolio optimization for high priced stocks. These features have added some real aspects of financial markets to the model and distinguish them from other previous models. Our contribution is that we present an algorithm based on dynamic programming to solve the portfolio selection model based on the knapsack problem, which is in contrast to the existing literature. Then, to show the applicability and validity of the proposed dynamic programming algorithm, two case studies of the US stock exchange are analyzed.
| S-EPMC9333297 | biostudies-literature
Project description:A new topology optimization method called the Proportional Topology Optimization (PTO) is presented. As a non-sensitivity method, PTO is simple to understand, easy to implement, and is also efficient and accurate at the same time. It is implemented into two MATLAB programs to solve the stress constrained and minimum compliance problems. Descriptions of the algorithm and computer programs are provided in detail. The method is applied to solve three numerical examples for both types of problems. The method shows comparable efficiency and accuracy with an existing optimality criteria method which computes sensitivities. Also, the PTO stress constrained algorithm and minimum compliance algorithm are compared by feeding output from one algorithm to the other in an alternative manner, where the former yields lower maximum stress and volume fraction but higher compliance compared to the latter. Advantages and disadvantages of the proposed method and future works are discussed. The computer programs are self-contained and publicly shared in the website www.ptomethod.org.
| S-EPMC4683013 | biostudies-literature
Project description:Fitting 3D morphable models (3DMMs) on faces is a well-studied problem, motivated by various industrial and research applications. 3DMMs express a 3D facial shape as a linear sum of basis functions. The resulting shape, however, is a plausible face only when the basis coefficients take values within limited intervals. Methods based on unconstrained optimization address this issue with a weighted ℓ 2 penalty on coefficients; however, determining the weight of this penalty is difficult, and the existence of a single weight that works universally is questionable. We propose a new formulation that does not require the tuning of any weight parameter. Specifically, we formulate 3DMM fitting as an inequality-constrained optimization problem, where the primary constraint is that basis coefficients should not exceed the interval that is learned when the 3DMM is constructed. We employ additional constraints to exploit sparse landmark detectors, by forcing the facial shape to be within the error bounds of a reliable detector. To enable operation "in-the-wild", we use a robust objective function, namely Gradient Correlation. Our approach performs comparably with deep learning (DL) methods on "in-the-wild" data that have inexact ground truth, and better than DL methods on more controlled data with exact ground truth. Since our formulation does not require any learning, it enjoys a versatility that allows it to operate with multiple frames of arbitrary sizes. This study's results encourage further research on 3DMM fitting with inequality-constrained optimization methods, which have been unexplored compared to unconstrained methods.
| S-EPMC7594629 | biostudies-literature
Project description:Controlled twisting of individual, double-stranded DNA molecules provides a unique method to investigate the enzymes that alter DNA topology. Such twisting requires a single DNA molecule to be torsionally constrained. This constraint is achieved by anchoring the opposite ends of the DNA to two separate surfaces via multiple bonds. The traditional protocol for making such DNA involves a three-way ligation followed by gel purification, a laborious process that often leads to low yield both in the amount of DNA and the fraction of molecules that is torsionally constrained. We developed a simple ligation-free procedure for making torsionally constrained DNA via polymerase chain reaction (PCR). This PCR protocol used two 'megaprimers', 400-base-pair long double-stranded DNA that were labelled with either biotin or digoxigenin. We obtained a relatively high yield of gel-purified DNA (?500 ng/100 µl of PCR reaction). The final construct in this PCR-based method contains only one labelled strand in contrast to the traditional construct in which both strands of the DNA are labelled. Nonetheless, we achieved a high yield (84%) of torsionally constrained DNA when measured using an optical-trap-based DNA-overstretching assay. This protocol significantly simplifies the application and adoption of torsionally constrained assays to a wide range of single-molecule systems.
| S-EPMC3799452 | biostudies-literature
Project description:Production of higher-fidelity digital elevation models is important; as such models are indispensable components of space data infrastructure. However, loss of terrain features is a constant problem for grid digital elevation models, although these models have already been defined in such a way that their distinct usage as data sources in terrain modeling processing is prohibited. Therefore, in this study, the novel concept-terrain semanteme is proposed to define local space terrain features, and a new process for generating grid digital elevation models based on this new concept is designed. A prototype system is programmed to test the proposed approach; the results indicate that terrain semanteme can be applied in the process of grid digital elevation model generation, and that usage of this new concept improves the digital elevation model fidelity. Moreover, the terrain semanteme technique can be applied for recovery of distorted digital elevation model regions containing terrain semantemes, with good recovery efficiency indicated by experiments.
| S-EPMC5991641 | biostudies-literature
Project description:Studying how the timing and amplitude of visual evoked responses (VERs) vary between visual areas is important for understanding visual processing but is complicated by difficulties in reliably estimating VERs in individual visual areas using noninvasive brain measurements. Retinotopy constrained source estimation (RCSE) addresses this challenge by using multiple, retinotopically mapped stimulus locations to simultaneously constrain estimates of VERs in visual areas V1, V2, and V3, taking advantage of the spatial precision of fMRI retinotopy and the temporal resolution of magnetoencephalography (MEG) or electroencephalography (EEG). Nonlinear optimization of dipole locations, guided by a group-constrained RCSE solution as a prior, improved the robustness of RCSE. This approach facilitated the analysis of differences in timing and amplitude of VERs between V1, V2, and V3, elicited by stimuli with varying luminance contrast in a sample of eight adult humans. The V1 peak response was 37% larger than that of V2 and 74% larger than that of V3, and also ~10-20 ms earlier. Normalized contrast response functions were nearly identical for the three areas. Results without dipole optimization, or with other nonlinear methods not constrained by prior estimates were similar but suffered from greater between-subject variability. The increased reliability of estimates offered by this approach may be particularly valuable when using a smaller number of stimulus locations, enabling a greater variety of stimulus and task manipulations.
| S-EPMC4586264 | biostudies-literature