A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs

2016 ◽  
Vol 68 (2) ◽  
pp. 227-253 ◽  
Author(s):  
Hatim Djelassi ◽  
Alexander Mitsos
2008 ◽  
Vol 1 ◽  
pp. 193-211
Author(s):  
Netra Narayan Poudel

No abstract available. Himalayan Journal of Sociology & Anthropology Vol.1 2004, p.193-211


1994 ◽  
Vol 30 (8) ◽  
pp. 73-80 ◽  
Author(s):  
L. Spinosa ◽  
E. S. Kempa ◽  
N. Okuno ◽  
P. A. Vesilind

Sludge management is a more and more complex problem due to increased difficulties in locating disposal works and meeting more stringent environmental quality requirements. The most recent notable developments in conventional processing systems have regarded dewatering and stabilization, which remain essential prerequisites to any disposal method. With the increasing pressure on disposal options, such as agricultural use and landfilling, there has been a resurgence of interest in incineration. New processes and alternative uses have been proposed and experienced, but most of them still require further investigations to evaluate effectiveness and reliability. In any case, it is not realistic to search for a global solution to the problem, but the best solutions must derive from local and site-specific considerations.


2021 ◽  
pp. 1-10
Author(s):  
Adam Weintrit ◽  
Jacek Pietraszkiewicz ◽  
Wiesław Piotrzkowski ◽  
Wojciech Tycholiz

Abstract In recent years the transition of marine navigation to the digital era has been gaining momentum. Implementation of e-Navigation solutions varies from country to country in terms of their priorities, goals, levels and effects. Maritime authorities in Poland have been setting the pace in this transition process, not only in Poland but also in general as a global solution. The most recent example is the planned deployment of a variety of e-Navigation tools in the Vistula Lagoon: from GNSS-RTK Ground-Based Augmentation System, to virtual and synthetic aids to navigation, high-resolution bathymetry and advanced navigational software for piloting. The major objectives of this paper are, first, to summarise recent dynamics in the e-Navigation field, and second, to present a practical implementation of the e-Navigation concept in the Vistula Lagoon area.


2021 ◽  
Vol 54 (1) ◽  
pp. 245-258
Author(s):  
Younes Bidi ◽  
Abderrahmane Beniani ◽  
Khaled Zennir ◽  
Ahmed Himadan

Abstract We consider strong damped wave equation involving the fractional Laplacian with nonlinear source. The results of global solution under necessary conditions on the critical exponent are established. The existence is proved by using the Galerkin approximations combined with the potential well theory. Moreover, we showed new decay estimates of global solution.


2021 ◽  
Vol 10 (1) ◽  
pp. 1235-1254
Author(s):  
Qiang Tao ◽  
Canze Zhu

Abstract This paper deals with a Cauchy problem of the full compressible Hall-magnetohydrodynamic flows. We establish the existence and uniqueness of global solution, provided that the initial energy is suitably small but the initial temperature allows large oscillations. In addition, the large time behavior of the global solution is obtained.


Author(s):  
Jan-Lucas Gade ◽  
Carl-Johan Thore ◽  
Jonas Stålhand

AbstractIn this study, we consider identification of parameters in a non-linear continuum-mechanical model of arteries by fitting the models response to clinical data. The fitting of the model is formulated as a constrained non-linear, non-convex least-squares minimization problem. The model parameters are directly related to the underlying physiology of arteries, and correctly identified they can be of great clinical value. The non-convexity of the minimization problem implies that incorrect parameter values, corresponding to local minima or stationary points may be found, however. Therefore, we investigate the feasibility of using a branch-and-bound algorithm to identify the parameters to global optimality. The algorithm is tested on three clinical data sets, in each case using four increasingly larger regions around a candidate global solution in the parameter space. In all cases, the candidate global solution is found already in the initialization phase when solving the original non-convex minimization problem from multiple starting points, and the remaining time is spent on increasing the lower bound on the optimal value. Although the branch-and-bound algorithm is parallelized, the overall procedure is in general very time-consuming.


2019 ◽  
Author(s):  
Nurnisa Helmee ◽  
Yasmin Mohd Yacob ◽  
Zulkifli Husin ◽  
Mohd Farid Mavi ◽  
Tan Wei Keong

Sign in / Sign up

Export Citation Format

Share Document