New mathematical programming models are proposed, developed and evaluated in this study for estimating missing precipitation data. These models use nonlinear and mixed integer nonlinear mathematical programming (MINLP...
详细信息
New mathematical programming models are proposed, developed and evaluated in this study for estimating missing precipitation data. These models use nonlinear and mixed integer nonlinear mathematical programming (MINLP) formulations with binary variables. They overcome the limitations associated with spatial interpolation methods relevant to the arbitrary selection of weighting parameters, the number of control points within a neighbourhood, and the size of the neighbourhood itself. The formulations are solved using genetic algorithms. Daily precipitation data obtained from 15 rain gauging stations in a temperate climatic region are used to test and derive conclusions about the efficacy of these methods. The developed methods are compared with some nave approaches, multiple linear regression, nonlinear least-square optimization, kriging, and global and local trend surface and thin-plate spline models. The results suggest that the proposed new mathematical programming formulations are superior to those obtained from all the other spatial interpolation methods tested in this study.
This paper addresses a concrete problem in the field of power engineering. Although measurement-based modeling techniques have potential to drastically improve the quality of load representation in power system studie...
详细信息
This paper addresses a concrete problem in the field of power engineering. Although measurement-based modeling techniques have potential to drastically improve the quality of load representation in power system studies and positively affect results, they are not applied (in industry) for reasons of computational complexity. These limitations stem from the optimizationmethods (e.g. Newton-Raphson) and hardware implementations (e.g. digital computer) generally employed. In this work, the authors examine a simple, alternative method which relies on Jacobi optimization and analog emulation hardware to reduce computational complexity, facilitate online applications, and make measurement-based load modeling more attractive to utilities and independent system operators (ISO's). They hypothesize and later demonstrate that the alternative will yield results comparable to that of traditional methods. (C) 2013 Elsevier Ltd. All rights reserved.
A unique and simple method of modeling a coplanar waveguide meander-line inductor is presented. Using only the lower frequency response of electrically smaller inductors, their higher frequency response is predicted. ...
详细信息
A unique and simple method of modeling a coplanar waveguide meander-line inductor is presented. Using only the lower frequency response of electrically smaller inductors, their higher frequency response is predicted. In addition, the responses of physically larger inductors can also be made using circuit models synthesized directly from the unit cell layout of the inductors. The modeling and prediction results for an ideal metal and lossless substrate is presented, together with comparisons made for various lossy parameters. (C) 2002 Wiley Periodicals, Inc.
A Penning trap system called Lanzhou Penning Trap (LPT) is now being developed for precise mass measurements at the Institute of Modern Physics (IMP). One of the key components is a 7 T actively shielded superconducti...
详细信息
A Penning trap system called Lanzhou Penning Trap (LPT) is now being developed for precise mass measurements at the Institute of Modern Physics (IMP). One of the key components is a 7 T actively shielded superconducting magnet with a clear warm bore of 156 mm. The required field homogeneity is 3×10-7 over two 1 cubic centimeter volumes lying 220 mm apart along the magnet axis. We introduce a two-step method which combines linear programming and a nonlinearoptimization algorithm for designing the multi-section superconducting magnet. This method is fast and flexible for handling arbitrary shaped homogeneous volumes and coils. With the help of this method an optimal design for the LPT superconducting magnet has been obtained.
Support vector machine (SVM) is one of the most important class of machine learning models and algorithms, and has been successfully applied in various fields. nonlinearoptimization plays a crucial role in SVM method...
详细信息
Support vector machine (SVM) is one of the most important class of machine learning models and algorithms, and has been successfully applied in various fields. nonlinearoptimization plays a crucial role in SVM methodology, both in defining the machine learning models and in designing convergent and efficient algorithms for large-scale training problems. In this paper we present the convex programming problems underlying SVM focusing on supervised binary classification. We analyze the most important and used optimizationmethods for SVM training problems, and we discuss how the properties of these problems can be incorporated in designing useful algorithms.
We present an application of the p-regularity theory to the analysis of non-regular (irregular, degenerate) nonlinearoptimization problems. The p-regularity theory, also known as the p-factor analysis of nonlinear ma...
详细信息
We present an application of the p-regularity theory to the analysis of non-regular (irregular, degenerate) nonlinearoptimization problems. The p-regularity theory, also known as the p-factor analysis of nonlinear mappings, was developed during last thirty years. The p-factor analysis is based on the construction of the p-factor operator which allows us to analyze optimization problems in the degenerate case. We investigate reducibility of a non-regular optimization problem to a regular system of equations which do not depend on the objective function. As an illustration we consider applications of our results to non-regular complementarity problems of mathematical programming and to linear programming problems.
A nonstationary Markov process model with embedded explanatory variables offers a means to account for underlying causal factors while retaining unrestrictive assumptions and the predictive ability of a stochastic fra...
详细信息
A nonstationary Markov process model with embedded explanatory variables offers a means to account for underlying causal factors while retaining unrestrictive assumptions and the predictive ability of a stochastic framework. We find that a direct search algorithm requiring minimal user preparation is a feasible computational procedure for estimating such a model. We compare this method with several others using factorially designed Monte Carlo simulations and find evidence that a small state space and a long time series lead to better algorithmic performance.
Support Vector Machine (SVM) is one of the most important class of machine learning models and algorithms, and has been successfully applied in various fields. nonlinearoptimization plays a crucial role in SVM method...
详细信息
Support Vector Machine (SVM) is one of the most important class of machine learning models and algorithms, and has been successfully applied in various fields. nonlinearoptimization plays a crucial role in SVM methodology, both in defining the machine learning models and in designing convergent and efficient algorithms for large-scale training problems. In this paper we present the convex programming problems underlying SVM focusing on supervised binary classification. We analyze the most important and used optimizationmethods for SVM training problems, and we discuss how the properties of these problems can be incorporated in designing useful algorithms.
An optimization design method of short-length actively shielded and open structure superconducting MRI magnets is suggested in the paper. Firstly, the section of the solenoid coil is simplified as a current loop with ...
详细信息
An optimization design method of short-length actively shielded and open structure superconducting MRI magnets is suggested in the paper. Firstly, the section of the solenoid coil is simplified as a current loop with zero section to solve a linear programming problem. The position coordinates in the radius and axial, and current for the loop can be calculated by the linear programming method. Then, the cross-section of the coil is optimized with a genetic algorithm to get appropriate section size. The method of linear programming, especially combining with genetic algorithm, reduces optimizing variables, which makes the design of a magnet feasible. Based on the method, a full open MRI superconducting magnet is designed with maximum radii of 0.8 m and 1.2 m. In the paper, the detailed optimization technologies are presented.
In this dissertation we address the problem of estimating the phase from color images acquired with differential–interference–contrast (DIC) microscopy. This technique has been widely recognized for producing high c...
详细信息
In this dissertation we address the problem of estimating the phase from color images acquired with differential–interference–contrast (DIC) microscopy. This technique has been widely recognized for producing high contrast images at high lateral resolution. One of its disadvantages is that the observed images cannot be easily used for topographical and morphological interpretation, because the changes in phase of the light, produced by variations in the refractive index of the object, are hidden in the intensity image. We present an image formation model for polychromatic light, along with a detailed description of the point spread function (PSF). As for the phase recovery problem, we followed the inverse problem approach by means of minimizing a non-linear least–squares (LS)–like discrepancy term with an edge–preserving regularizing term, given by either the hypersurface (HS) potential or the total variation (TV) one. We investigate the analytical properties of the resulting objective non-convex functions, prove the existence of minimizers and propose a compact formulation of the gradient allowing fast computations. Then we use recent effective optimization tools able to obtain in both the smooth and the non-smooth cases accurate reconstructions with a reduced computational demand. We performed different numerical tests on synthetic realistic images and we compared the proposed methods with both the original conjugate gradient method proposed in the literature, exploiting a gradient–free linesearch for the computation of the steplength parameter, and other standard conjugate gradient approaches. The results we obtained in this approach show that the performances of the limited memory gradient method used for minimizing the LS+HS functional are much better than those of the CG approaches in terms of number of function/gradient evaluations and, therefore, computational time. Then we also consider another formulation of the phase retrieval problem by means of minimiza
暂无评论