Search results for "Optimization problem"
showing 10 items of 281 documents
Solving some optimal control problems using the barrier penalty function method
2005
In this paper we present a new approach to solve the two-level optimization problem arising from an approximation by means of the finite element method of optimal control problems governed by unilateral boundary value problems. The minimized functional depends on control variables and state variables x. The latter are the optimal solution of an auxiliary quadratic programming problem, whose parameters depend on u.
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…
A Fokker–Planck control framework for multidimensional stochastic processes
2013
AbstractAn efficient framework for the optimal control of probability density functions (PDFs) of multidimensional stochastic processes is presented. This framework is based on the Fokker–Planck equation that governs the time evolution of the PDF of stochastic processes and on tracking objectives of terminal configuration of the desired PDF. The corresponding optimization problems are formulated as a sequence of open-loop optimality systems in a receding-horizon control strategy. Many theoretical results concerning the forward and the optimal control problem are provided. In particular, it is shown that under appropriate assumptions the open-loop bilinear control function is unique. The res…
Interdependence Between Tool Fracture and Wear
1985
Wear and fracture are the main causes of tool scrapping. However fracture plays a major role for increasing values of the hardness and brittleness of tool materials or when low-cobalt tungsten carbides are used or in interrupted cutting conditions where it is the most relevant factor for tool scrapping. In order to obtain the optimal values of the cutting speed both these factors should be considered. The hypothesis of stochastic independence among them simplifies the mathematical formulation of the optimization problem; but experimental investigations do not agree with this assumption and, as a matter of fact, the probability density function of tool fracture results to be dependent on the…
Constrained and unconstrained problems in location theory and inner products
1997
In a real normed space X the optimization problem associated to a finite subset and to a family of positive weights with the objective function [UM0001] has some well known properties when X is an ...
Memetic algorithms and memetic computing optimization: A literature review
2012
Abstract Memetic computing is a subject in computer science which considers complex structures such as the combination of simple agents and memes, whose evolutionary interactions lead to intelligent complexes capable of problem-solving. The founding cornerstone of this subject has been the concept of memetic algorithms, that is a class of optimization algorithms whose structure is characterized by an evolutionary framework and a list of local search components. This article presents a broad literature review on this subject focused on optimization problems. Several classes of optimization problems, such as discrete, continuous, constrained, multi-objective and characterized by uncertainties…
Implementation aspects of interactive multiobjective optimization for modeling environments: The case of GAMS-NIMBUS
2014
Abstract. Interactive multiobjective optimization methods have provided promising results in the literature but still their implementations are rare. Here we introduce a core structure of interactive methods to enable their convenient implementation. We also demonstrate how this core structure can be applied when implementing an interactive method using a modeling environment. Many modeling environments contain tools for single objective optimization but not for interactive multiobjective optimization. Furthermore, as a concrete example, we present GAMS-NIMBUS Tool which is an implementation of the classification-based NIMBUS method for the GAMS modeling environment. So far, interactive met…
Supercapacitor diagnosis using an Extended Kalman Filtering approach
2016
This paper deals with the model-based analysis of a Supercapacitor for diagnostic purposes. A two legs nonlinear physical model is assumed for the Supercapacitor and the corresponding second-order nonlinear state-space mathematical model is obtained. Then, an Extended Kalman Filter is tuned so that the estimated outputs reproduce the voltages at the equivalent capacitance terminals; they give information on the state of health of the supercapacitor but are not directly measurable. In particular, an optimization problem is firstly formulated, involving the experimental input-output data and those given by the Extended Kalman Filter.
Workhardening adaptation of rigid-plastic structures
1976
The paper considers discrete rigid-plastic structures which are subjected to the action of loads varying quasi-statically within given limits. It studies the conditions for workhoardening adaptation, that is the conditions to ensure that the structure, after an initial rigid-plastic phase, shows a purely rigid behavior. The safety factor against the workhardening inadaptation is defined by two dual optimization problems. Some characteristic features of the yielding surface at failure are pointed out, using also a proper geometric description. Static and kinematic theorems, which are similar to those of shakedown theory, are given. A simple application concludes the paper.
Heuristics for the Constrained Incremental Graph Drawing Problem
2019
Abstract Visualization of information is a relevant topic in Computer Science, where graphs have become a standard representation model, and graph drawing is now a well-established area. Within this context, edge crossing minimization is a widely studied problem given its importance in obtaining readable representations of graphs. In this paper, we focus on the so-called incremental graph drawing problem, in which we try to preserve the user’s mental map when obtaining successive drawings of the same graph. In particular, we minimize the number of edge crossings while satisfying some constraints required to preserve the position of vertices with respect to previous drawings. We propose heur…