Search results for " optimization."

showing 10 items of 2333 documents

Consensus for networks with unknown but bounded disturbances

2009

We consider stationary consensus protocols for networks of dynamic agents. The measure of the neighbors' states is affected by unknown but bounded disturbances. Here the main contribution is the formulation and solution of what we call the $\epsilon$-consensus problem, where the states are required to converge in a target set of radius $\epsilon$ asymptotically or in finite time. We introduce as a solution a dead-zone policy that we denote as the lazy rule.

Networks; UBB; Consensus; Dynamic AgentsMathematical optimizationConsensusControl and OptimizationApplied MathematicsDynamic Agentsnetworks; unknown but bounded; consensus; dynamic agentsUBBRadiusdynamic agentsMeasure (mathematics)Set (abstract data type)unknown but boundedSettore ING-INF/04 - AutomaticaconsensusnetworksBounded functionNetworks UBB Consensus Dynamic AgentsApplied mathematicsNetworksFinite timeMathematics
researchProduct

Remark on a nonlocal isoperimetric problem

2017

Abstract We consider isoperimetric problem with a nonlocal repulsive term given by the Newtonian potential. We prove that regular critical sets of the functional are analytic. This optimal regularity holds also for critical sets of the Ohta–Kawasaki functional. We also prove that when the strength of the nonlocal part is small the ball is the only possible stable critical set.

Newtonian potentialcritical pointsApplied Mathematics010102 general mathematicsMathematical analysista111Isoperimetric dimension01 natural sciences010101 applied mathematicsMathematics - Analysis of PDEsshape optimizationFOS: Mathematicsisoperimetric problemShape optimizationBall (mathematics)0101 mathematicsIsoperimetric inequalityAnalysisCritical setAnalysis of PDEs (math.AP)MathematicsNonlinear Analysis: Theory, Methods and Applications
researchProduct

On optimizing firewall performance in dynamic networks by invoking a novel swapping window-based paradigm

2018

Designing and implementing efficient firewall strategies in the age of the Internet of Things (IoT) is far from trivial. This is because, as time proceeds, an increasing number of devices will be connected, accessed and controlled on the Internet. Additionally, an everincreasingly amount of sensitive information will be stored on various networks. A good and efficient firewall strategy will attempt to secure this information, and to also manage the large amount of inevitable network traffic that these devices create. The goal of this paper is to propose a framework for designing optimized firewalls for the IoT. This paper deals with two fundamental challenges/problems encountered in such firewalls…

Non-stationary environmentsFirewall optimizationsMatching timesWeak estimatorsBatch updatesLearning automata
researchProduct

Numerical methods for nonlinear inverse problems

1996

AbstractInverse problems of distributed parameter systems with applications to optimal control and identification are considered. Numerical methods and their numerical analysis for solving this kind of inverse problems are presented, main emphasis being on the estimates of the rate of convergence for various schemes. Finally, based on the given error estimates, a two-grid method and related algorithms are introduced, which can be used to solve nonlinear inverse problems effectively.

Nonlinear inverse problemInverse problemsMathematical optimizationFinite element methodNumerical analysisApplied MathematicsInverse problemOptimal controlFinite element methodTwo-grid methodIdentification (information)Computational MathematicsRate of convergenceDistributed parameter systemError estimatesMathematicsJournal of Computational and Applied Mathematics
researchProduct

An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions

1983

This paper develops a method for interactive multiple objective linear programming assuming an unknown pseudo concave utility function satisfying certain general properties. The method is an extension of our earlier method published in this journal (Zionts, S., Wallenius, J. 1976. An interactive programming method for solving the multiple criteria problem. Management Sci. 22 (6) 652–663.). Various technical problems present in predecessor versions have been resolved. In addition to presenting the supporting theory and algorithm, we discuss certain options in implementation and summarize our practical experience with several versions of the method.

Nonlinear systemClass (computer programming)Mathematical optimizationInteractive programmingLinear programmingMultiple objectiveStrategy and Managementmultiple criteria utility/preference: multi-attribute [programming]Function (mathematics)Extension (predicate logic)Management Science and Operations ResearchMathematicsLinear-fractional programmingManagement Science
researchProduct

Entropy dissipation of moving mesh adaptation

2014

Non-uniform grids and mesh adaptation have become an important part of numerical approximations of differential equations over the past decades. It has been experimentally noted that mesh adaptation leads not only to locally improved solution but also to numerical stability of the underlying method. In this paper we consider nonlinear conservation laws and provide a method to perform the analysis of the moving mesh adaptation method, including both the mesh reconstruction and evolution of the solution. We moreover employ this method to extract sufficient conditions — on the adaptation of the mesh — that stabilize a numerical scheme in the sense of the entropy dissipation.

Nonlinear systemConservation lawMathematical optimizationDifferential equationGeneral MathematicsNumerical analysisApplied mathematicsEntropy dissipationAdaptation (computer science)Mesh adaptationAnalysisNumerical stabilityMathematics
researchProduct

A Note on the Nonlinear Landweber Iteration

2014

We reconsider the Landweber iteration for nonlinear ill-posed problems. It is known that this method becomes a regularization method in the case when the iteration is terminated as soon as the residual drops below a certain multiple of the noise level in the data. So far, all known estimates of this factor are greater than two. Here we derive a smaller factor that may be arbitrarily close to one depending on the type of nonlinearity of the underlying operator equation.

Nonlinear systemControl and OptimizationPower iterationSignal ProcessingMathematical analysisNoise levelResidualRegularization (mathematics)AnalysisLandweber iterationMultipleComputer Science ApplicationsMathematicsNumerical Functional Analysis and Optimization
researchProduct

Interactive Nonlinear Multiobjective Procedures

2006

An overview of the interactive methods for solving nonlinear multiple criteria decision making problems is given. In interactive methods, the decision maker progressively provides preference information so that the most satisfactory compromise can be found. The basic features of several methods are introduced and some theoretical results are provided. In addition, references to modifications and applications as well as to other methods are indicated.

Nonlinear systemMathematical optimizationComputer scienceCompromisemedia_common.quotation_subjectMultiple criteriaDecision makerMulti-objective optimizationPreferenceNonlinear programmingmedia_common
researchProduct

Some Methods for Nonlinear Multi-objective Optimization

2001

A general overview of nonlinear multiobjective optimization methods is given. The basic features of several methods are introduced so that an appropriate method could be found for different purposes. The methods are classified according to the role of a decision maker in the solution process. The main emphasis is devoted to interactive methods where the decision maker progressively provides preference information so that the most satisfactory solution can be found.

Nonlinear systemMathematical optimizationComputer scienceMulti-objective optimizationPreferenceNonlinear programming
researchProduct

Small-gain conditions for stochastic network systems

2013

In this paper, some small-gain conditions are presented for stochastic network systems which can describe many large-scale systems with interconnections, nonlinear behaviors, uncertainties and random disturbances. One subsystem is selected as monitor with the requirement that the gains to other systems are smooth concave functions. The relations of members under the supervise of the monitor are described as bilateral plus multilateral relations of gains. For the deterministic case, the requirement on the monitor can be removed. To demonstrate the power of this result, the small-gain conditions cover interconnected system with two subsystems as a special case. Compared with the existing resu…

Nonlinear systemMathematical optimizationCover (topology)Concave functionControl theoryStochastic processUniform boundednessSpecial caseStability (probability)Power (physics)Mathematics52nd IEEE Conference on Decision and Control
researchProduct