نتایج جستجو برای: constrained nonlinear programming

تعداد نتایج: 599935  

We establish a relationship between general constrained pseudoconvex optimization problems and globally projected dynamical systems. A corresponding novel neural network model, which is globally convergent and stable in the sense of Lyapunov, is proposed. Both theoretical and numerical approaches are considered. Numerical simulations for three constrained nonlinear optimization problems a...

2013
Y. Zare Mehrjerdi Yahia Zare Mehrjerdi

This article proposes a stochastic vehicle routing problem within the frame-wok of chance constrained programming where one or more parameters are presumed to be random variables with known distribution function. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable ...

2010
Alexandra Grancharova Juš Kocijan Tor A. Johansen

This paper applies an approximate multi-parametric Nonlinear Programming approach to explicitly solve output-feedback Nonlinear Model Predictive Control (NMPC) problems for constrained nonlinear systems described by black-box models. In particular, neural network models are used and the optimal regulation problem is considered. A dual-mode control strategy is employed in order to achieve an off...

2008
Alexandra Grancharova Tor A. Johansen

This paper presents an approximate multi-parametric Nonlinear Programming (mp-NLP) approach to explicit solution of feedback min-max NMPC problems for constrained nonlinear systems in the presence of bounded disturbances and/or parameter uncertainties. It is based on an orthogonal search tree structure of the state space partition and consists in constructing a piecewise nonlinear (PWNL) approx...

2011
Maria P. Barbarosou Nicholas G. Maratos

Convex optimization techniques are widely used in the design and analysis of communication systems and signal processing algorithms. In this paper a novel recurrent neural network is presented for solving nonlinear strongly convex equality constrained optimization problems. The proposed neural network is based on recursive quadratic programming for nonlinear optimization, in conjunction with ho...

Journal: :Annals OR 2001
John W. Chinneck

Just as modern general-purpose programming languages (e.g. C++, Java) are supported by a suite of tools (debuggers, profilers, etc.), mathematical programming languages need supporting tools. MProbe is an example of a suite of tools supporting a mathematical programming language, in this case AMPL. MProbe includes tools for empirically estimating the shape of nonlinear functions of many variabl...

A. Csébfalvi , E. Szendrői ,

This paper presents an experimental investigation of the Sounds of Silence (SoS) harmony search metaheuristic for the multi-mode resource-constrained project scheduling problem (MRCPSP) using a pre-optimized starting repertoire. The presented algorithm is based on the time oriented version of the SoS harmony search metaheuristic developed by Csébfalvi et al. [1] for the single-mode resource-con...

ژورنال: علوم آب و خاک 2012
رسول قبادیان, , سید محمود کاشفی‌پور, , محمد زارع, ,

Development of precise and simple methods in flood simulation has greatly reduced financial damage and life loss. Various methods and procedures have been implemented based on Saint-Venant's one-dimensional equation governing unsteady flows. To simplify the solution for these flows, analytical and numerical methods have been used. In the present study, a new method that provides the optimal out...

Journal: :bulletin of the iranian mathematical society 0
a. malek s. ezazipour n. hosseinipour-mahani

we establish a relationship between general constrained pseudoconvex optimization problems and globally projected dynamical systems. a corresponding novel neural network model, which is globally convergent and stable in the sense of lyapunov, is proposed. both theoretical and numerical approaches are considered. numerical simulations for three constrained nonlinear optimization problems are giv...

2011
Philip E. GILL Elizabeth WONG

In his 1963 PhD thesis, Wilson proposed the first sequential quadratic programming (SQP) method for the solution of constrained nonlinear optimization problems. In the intervening 48 years, SQP methods have evolved into a powerful and effective class of methods for a wide range of optimization problems. We review some of the most prominent developments in SQP methods since 1963 and discuss the ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید