Search results for "nonlinear programming"

showing 10 items of 31 documents

A combined approach of SGBEM and conic quadratic optimization for limit analysis

2011

The static approach to evaluate the limit multiplier directly was rephrased using the Symmetric Galerkin Boundary Element Method (SGBEM) for multidomain type problems [1,2]. The present formulation couples SGBEM multidomain procedure with nonlinear optimization techniques, making use of the self-equilibrium stress equation [3-5]. This equation connects the stresses at the Gauss points of each substructure (bem-e) to plastic strains through a self-stress matrix computed in all the bem-elements of the discretized system. The analysis was performed by means of a conic quadratic optimization problem, in terms of discrete variables, and implemented using Karnak.sGbem code [6] coupled with MathLa…

SGBEM multidomain lower bound limit analysis nonlinear programming
researchProduct

The OptQuest Callable Library

2005

In this chapter we discuss the development and application of a library of functions that is the optimization engine for the OptQuest system. OptQuest is commercial software designed for optimizing complex systems, such as those formulated as simulation models. OptQuest has been integrated with several simulation packages with the goal of adding optimization capabilities. The optimization technology within OptQuest is based on the metaheuristic framework known as scatter search. In addition to describing the functionality of the OptQuest Callable Library (OCL) with an illustrative example, we apply it to a set of unconstrained nonlinear optimization problems.

Set (abstract data type)Commercial softwareMathematical optimizationComputer scienceComplex systemMetaheuristicCallable bondNonlinear programming
researchProduct

SIOPRED performance in a Forecasting Blind Competition

2012

In this paper we present the results obtained by applying our automatic forecasting support system, named SIOPRED, over a data set of time series in a Forecasting Blind Competition. In order to apply our procedure for providing point forecasts it has been necessary to develop an interactive strategy for the choice of the suitable length of the seasonal cycle and the seasonality form for a generalized exponential smoothing method, which have been obtained using SIOPRED. For the choice of those essential characteristics of forecasting methods, also a certain multi-objective formulation which minimizes several measures of fitting is used. Once these specifications are established, the model pa…

Soft computingData setCompetition (economics)Mathematical optimizationSeries (mathematics)Computer scienceExponential smoothingPoint (geometry)Physics::Atmospheric and Oceanic PhysicsSmoothingNonlinear programming2012 IEEE Conference on Evolving and Adaptive Intelligent Systems
researchProduct

A non-linear optimization procedure to estimate distances and instantaneous substitution rate matrices under the GTR model.

2006

Abstract Motivation: The general-time-reversible (GTR) model is one of the most popular models of nucleotide substitution because it constitutes a good trade-off between mathematical tractability and biological reality. However, when it is applied for inferring evolutionary distances and/or instantaneous rate matrices, the GTR model seems more prone to inapplicability than more restrictive time-reversible models. Although it has been previously noted that the causes for intractability are caused by the impossibility of computing the logarithm of a matrix characterised by negative eigenvalues, the issue has not been investigated further. Results: Here, we formally characterize the mathematic…

Statistics and ProbabilityOptimization problemBase Pair MismatchBiochemistryLinkage DisequilibriumNonlinear programmingInterpretation (model theory)Evolution MolecularApplied mathematicsComputer SimulationDivergence (statistics)Molecular BiologyEigenvalues and eigenvectorsPhylogenyMathematicsSequenceModels GeneticSubstitution (logic)Chromosome MappingGenetic VariationSequence Analysis DNAComputer Science ApplicationsComputational MathematicsComputational Theory and MathematicsNonlinear DynamicsLogarithm of a matrixAlgorithmAlgorithmsBioinformatics (Oxford, England)
researchProduct

A decision support system methodology for forecasting of time series based on soft computing

2006

Exponential procedures are widely used as forecasting techniques for inventory control and business planning. A number of modifications to the generalized exponential smoothing (Holt-Winters) approach to forecasting univariate time series is presented, which have been adapted into a tool for decision support systems. This methodology unifies the phases of estimation and model selection into just one optimization framework which permits the identification of robust solutions. This procedure may provide forecasts from different versions of exponential smoothing by fitting the updated formulas of Holt-Winters and selects the best method using a fuzzy multicriteria approach. The elements of the…

Statistics and ProbabilitySoft computingMathematical optimizationDecision support systembusiness.industryApplied MathematicsModel selectionExponential smoothingUnivariateFuzzy logicNonlinear programmingComputational MathematicsComputational Theory and MathematicsArtificial intelligencebusinessPhysics::Atmospheric and Oceanic PhysicsSmoothingMathematicsComputational Statistics & Data Analysis
researchProduct

Characteristics of the polymer transport in ratchet systems

2010

Molecules with complex internal structure in time-dependent periodic potentials are studied by using short Rubinstein-Duke model polymers as an example. We extend our earlier work on transport in stochastically varying potentials to cover also deterministic potential switching mechanisms, energetic efficiency and non-uniform charge distributions. We also use currents in the non-equilibrium steady state to identify the dominating mechanisms that lead to polymer transportation and analyze the evolution of the macroscopic state (e.g., total and head-to-head lengths) of the polymers. Several numerical methods are used to solve the master equations and nonlinear optimization problems. The domina…

Work (thermodynamics)PolymersRatchetMolecular ConformationFOS: Physical sciencesRatchet effectmolecular motorsNonlinear programmingDiffusionMotionkuljetusilmiötMaster equationmolekyylimoottoritStatistical physicspolymeeritCondensed Matter - Statistical MechanicsPhysicsStochastic ProcessesStatistical Mechanics (cond-mat.stat-mech)Molecular Motor ProteinsNumerical analysisCharge (physics)ratchetsModels Theoreticalnonequilibrium phenomenaKineticsClassical mechanicsräikätepätasapainoilmiöttransport phenomenaAlgorithmsCoherence (physics)Physical Review E
researchProduct

Lower bound limit analysis by bem: Convex optimization problem and incremental approach

2013

Abstract The lower bound limit approach of the classical plasticity theory is rephrased using the Multidomain Symmetric Galerkin Boundary Element Method, under conditions of plane and initial strains, ideal plasticity and associated flow rule. The new formulation couples a multidomain procedure with nonlinear programming techniques and defines the self-equilibrium stress field by an equation involving all the substructures (bem-elements) of the discretized system. The analysis is performed in a canonical form as a convex optimization problem with quadratic constraints, in terms of discrete variables, and implemented using the Karnak.sGbem code coupled with the optimization toolbox by MatLab…

convex optimizationelastoplasticityApplied MathematicsMathematical analysisGeneral EngineeringSGBEMUpper and lower boundsself-equilibrium streNonlinear programmingComputational MathematicsQuadratic equationLimit analysisConvex optimizationCanonical formSettore ICAR/08 - Scienza Delle CostruzioniGalerkin methodBoundary element methodAnalysislower bound limit analysiMathematicsEngineering Analysis with Boundary Elements
researchProduct

Scatter Search for the Point-Matching Problem in 3D Image Registration

2008

Scatter search is a population-based method that has recently been shown to yield promising outcomes for solving combinatorial and nonlinear optimization problems. Based on formulations originally proposed in the 1960s for combining decision rules and problem constraints, such as the surrogate constraint method, scatter search uses strategies for combining solution vectors that have proved effective in a variety of problem settings. We present a scatter-search implementation designed to find high-quality solutions for the 3D image-registration problem, which has many practical applications. This problem arises in computer vision applications when finding a correspondence or transformation …

education.field_of_studyComputer scienceHeuristic (computer science)business.industryPopulationComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONGeneral EngineeringImage registrationPoint set registrationMachine learningcomputer.software_genreEvolutionary computationNonlinear programmingRobustness (computer science)Artificial intelligenceeducationbusinessMetaheuristicAlgorithmcomputerINFORMS Journal on Computing
researchProduct

The Tax Justice Network-Africa v Cabinet Secretary for National Treasury & 2 Others: A Big Win for Tax Justice Activism?

2019

This paper develops an optimization model for selecting a large subsample that improves the representativeness of a simple random sample previously obtained from a population larger than the population of interest. The problem formulation involves convex mixed-integer nonlinear programming (convex MINLP) and is therefore NP-hard. However, the solution is found by maximizing the “constant of proportionality” – in other words, maximizing the size of the subsample taken from a stratified random sample with proportional allocation – and restricting it to a p-value high enough to achieve a good fit to the population of interest using Pearson’s chi-square goodness-of-fit test. The beauty of the m…

education.field_of_studyPopulationStatisticsChi-square testSample (statistics)p-valueeducationSimple random sampleRepresentativeness heuristicStratified samplingMathematicsNonlinear programmingSSRN Electronic Journal
researchProduct

Shape optimization in contact problems based on penalization of the state inequality

1986

The paper deals with the approximation of optimal shape of elastic bodies, uni­laterally supported by a rigid, frictionless foundation. Original state inequality, describing the behaviour of such a body is replaced by a family of penalized state problems. The relation between optimal shapes for the original state inequality and those for penalized state equations is established. peerReviewed

msc:49M30msc:73k40frictionless plane contact [keyword]minimization of the total potential energy [keyword]msc:74M15linear-elastic sheet [keyword]rigid foundation [keyword]msc:74P99contact boundary curve [keyword]family of penalized state problems [keyword]existence [keyword]msc:49J40convergence [keyword]nonlinear programming problem [keyword]msc:73T05shape optimization [keyword]box constraints [keyword]msc:74S05linear equality constraint [keyword]msc:74A55linear inequality constraints [keyword]
researchProduct