for Journals by Title or ISSN for Articles by Keywords help
 Subjects -> ENGINEERING (Total: 2193 journals)     - CHEMICAL ENGINEERING (185 journals)    - CIVIL ENGINEERING (174 journals)    - ELECTRICAL ENGINEERING (96 journals)    - ENGINEERING (1180 journals)    - ENGINEERING MECHANICS AND MATERIALS (363 journals)    - HYDRAULIC ENGINEERING (55 journals)    - INDUSTRIAL ENGINEERING (58 journals)    - MECHANICAL ENGINEERING (82 journals) ENGINEERING (1180 journals)            First | 2 3 4 5 6 7 8 9 | Last
 International Journal of Heat and Fluid Flow       (Followers: 25) International Journal of Heat and Mass Transfer       (Followers: 155) International Journal of Heavy Vehicle Systems       (Followers: 8) International Journal of Hypersonics       (Followers: 3) International Journal of Imaging Systems and Technology       (Followers: 2) International Journal of Impact Engineering       (Followers: 8) International Journal of Information Acquisition       (Followers: 1) International Journal of Innovation and Applied Studies       (Followers: 4) International Journal of Innovation Science       (Followers: 8) International Journal of Innovative Technology and Research       (Followers: 1) International Journal of Integrated Engineering International Journal of Intelligent Engineering Informatics International Journal of Intelligent Systems and Applications in Engineering International Journal of Lifecycle Performance Engineering       (Followers: 1) International Journal of Machine Tools and Manufacture       (Followers: 5) International Journal of Manufacturing Research       (Followers: 5) International Journal of Manufacturing Technology and Management       (Followers: 7) International Journal of Materials and Product Technology       (Followers: 3) International Journal of Mathematical Education in Science and Technology       (Followers: 8) International Journal of Mathematics in Operational Research       (Followers: 1) International Journal of Medical Engineering and Informatics       (Followers: 6) International Journal of Micro Air Vehicles       (Followers: 4) International Journal of Microwave and Wireless Technologies       (Followers: 1) International Journal of Microwave Science and Technology       (Followers: 3) International Journal of Mobile Network Design and Innovation       (Followers: 3) International Journal of Multiphase Flow       (Followers: 3) International Journal of Nanomanufacturing International Journal of Nanoscience International Journal of Nanotechnology       (Followers: 7) International Journal of Nanotechnology and Molecular Computation       (Followers: 3) International Journal of Navigation and Observation       (Followers: 11) International Journal of Network Management International Journal of Nonlinear Sciences and Numerical Simulation International Journal of Numerical Methods for Heat & Fluid Flow       (Followers: 8) International Journal of Optics       (Followers: 1) International Journal of Organisational Design and Engineering       (Followers: 10) International Journal of Pattern Recognition and Artificial Intelligence       (Followers: 7) International Journal of Pavement Engineering       (Followers: 3) International Journal of Physical Modelling in Geotechnics       (Followers: 3) International Journal of Plasticity       (Followers: 6) International Journal of Plastics Technology       (Followers: 1) International Journal of Polymer Analysis and Characterization       (Followers: 6) International Journal of Polymer Science       (Followers: 21) International Journal of Precision Engineering and Manufacturing       (Followers: 6) International Journal of Precision Engineering and Manufacturing-Green Technology International Journal of Precision Technology International Journal of Pressure Vessels and Piping       (Followers: 4) International Journal of Production Economics       (Followers: 13) International Journal of Quality and Innovation       (Followers: 5) International Journal of Quality Assurance in Engineering and Technology Education       (Followers: 2) International Journal of Quality Engineering and Technology       (Followers: 2) International Journal of Quantum Information International Journal of Rapid Manufacturing       (Followers: 4) International Journal of Reliability, Quality and Safety Engineering       (Followers: 8) International Journal of Renewable Energy Technology       (Followers: 10) International Journal of Robust and Nonlinear Control       (Followers: 3) International Journal of Science Engineering and Advance Technology International Journal of Sediment Research       (Followers: 1) International Journal of Self-Propagating High-Temperature Synthesis       (Followers: 2) International Journal of Signal and Imaging Systems Engineering International Journal of Six Sigma and Competitive Advantage International Journal of Social Robotics       (Followers: 2) International Journal of Software Engineering and Knowledge Engineering       (Followers: 2) International Journal of Space Science and Engineering       (Followers: 2) International Journal of Speech Technology       (Followers: 6) International Journal of Spray and Combustion Dynamics       (Followers: 7) International Journal of Superconductivity International Journal of Surface Engineering and Interdisciplinary Materials Science       (Followers: 1) International Journal of Surface Science and Engineering       (Followers: 8) International Journal of Sustainable Engineering       (Followers: 7) International Journal of Sustainable Manufacturing       (Followers: 5) International Journal of Systems and Service-Oriented Engineering International Journal of Systems Assurance Engineering and Management International Journal of Systems, Control and Communications       (Followers: 2) International Journal of Technoethics       (Followers: 1) International Journal of Technology Management and Sustainable Development       (Followers: 1) International Journal of Technology Policy and Law       (Followers: 6) International Journal of Telemedicine and Applications       (Followers: 2) International Journal of Thermal Sciences       (Followers: 8) International Journal of Thermodynamics       (Followers: 4) International Journal of Turbo & Jet-Engines       (Followers: 1) International Journal of Ultra Wideband Communications and Systems International Journal of Vehicle Autonomous Systems       (Followers: 1) International Journal of Vehicle Design       (Followers: 8) International Journal of Vehicle Information and Communication Systems       (Followers: 2) International Journal of Vehicle Noise and Vibration       (Followers: 3) International Journal of Vehicle Safety       (Followers: 5) International Journal of Vehicular Technology       (Followers: 3) International Journal of Virtual Technology and Multimedia       (Followers: 4) International Journal of Wavelets, Multiresolution and Information Processing International Journal on Artificial Intelligence Tools       (Followers: 4) International Nano Letters       (Followers: 7) International Review of Applied Sciences and Engineering International Scholarly Research Notices       (Followers: 266) Inverse Problems in Science and Engineering       (Followers: 2) Ionics IPTEK The Journal for Technology and Science IRBM News Ironmaking & Steelmaking       (Followers: 2) Irrigation and Drainage Systems       (Followers: 1)
 Journal of Global Optimization   [SJR: 0.919]   [H-I: 51]   [4 followers]  Follow         Hybrid journal (It can contain Open Access articles)    ISSN (Print) 1573-2916 - ISSN (Online) 0925-5001    Published by Springer-Verlag  [2276 journals]
• Interiors of completely positive cones
• Abstract: Abstract A symmetric matrix A is completely positive (CP) if there exists an entrywise nonnegative matrix B such that $$A = BB^T$$ . We characterize the interior of the CP cone. A semidefinite algorithm is proposed for checking whether a matrix is in the interior of the CP cone, and its properties are studied. A CP-decomposition of a matrix in Dickinson’s form can be obtained if it is an interior of the CP cone. Some computational experiments are also presented.
PubDate: 2015-12-01

• A new preference handling technique for interactive multiobjective
• Abstract: Abstract Because the purpose of multiobjective optimization methods is to optimize conflicting objectives simultaneously, they mainly focus on Pareto optimal solutions, where improvement with respect to some objective is only possible by allowing some other objective(s) to impair. Bringing this idea into practice requires the decision maker to think in terms of trading-off, which may limit the ability of effective problem solving. We outline some drawbacks of this and exploit another idea emphasizing the possibility of simultaneous improvement of all objectives. Based on this idea, we propose a technique for handling decision maker’s preferences, which eliminates the necessity to think in terms of trade-offs. We incorporate this technique into an interactive trade-off-free method for multiobjective optimization. We call the resulting method NAUTILUS 2, which is also suitable for negotiation support. We demonstrate the applicability of the new method with an example problem.
PubDate: 2015-12-01

• Island models for cluster geometry optimization: how design options impact
effectiveness and diversity
• Abstract: Abstract Designing island models is a challenging task for researchers. A number of decisions is required regarding the structure of the islands, how they are connected, how many individuals are migrated, which ones and how often. The impact of these choices is yet to be fully understood, specially since it may change between different problems and contexts. Cluster geometry optimization is a widely known and complex problem that provides a set of hard instances to assess and test optimization algorithms. The analysis presented in this paper reveals how design options for island models impact search effectiveness and population diversity, when seeking for the global optima of short-ranged Morse clusters. These outcomes support the definition of a robust and scalable island-based framework for cluster geometry optimization problems.
PubDate: 2015-12-01

• Higher-order metric subregularity and its applications
• Abstract: Abstract This paper is devoted to the study of metric subregularity and strong subregularity of any positive order $$q$$ for set-valued mappings in finite and infinite dimensions. While these notions have been studied and applied earlier for $$q=1$$ and—to a much lesser extent—for $$q\in (0,1)$$ , no results are available for the case $$q>1$$ . We derive characterizations of these notions for subgradient mappings, develop their sensitivity analysis under small perturbations, and provide applications to the convergence rate of Newton-type methods for solving generalized equations.
PubDate: 2015-12-01

• A natural extension of the classical envelope theorem in vector
differential programming
• Abstract: Abstract The aim of this paper is to extend the classical envelope theorem from scalar to vector differential programming. The obtained result allows us to measure the quantitative behaviour of a certain set of optimal values (not necessarily a singleton) characterized to become minimum when the objective function is composed with a positive function, according to changes of any of the parameters which appear in the constraints. We show that the sensitivity of the program depends on a Lagrange multiplier and its sensitivity.
PubDate: 2015-12-01

• A proximal point algorithm for DC fuctions on Hadamard manifolds
• Abstract: Abstract An extension of a proximal point algorithm for difference of two convex functions is presented in the context of Riemannian manifolds of nonposite sectional curvature. If the sequence generated by our algorithm is bounded it is proved that every cluster point is a critical point of the function (not necessarily convex) under consideration, even if minimizations are performed inexactly at each iteration. Application in maximization problems with constraints, within the framework of Hadamard manifolds is presented.
PubDate: 2015-12-01

• A new regularized limited memory BFGS-type method based on modified secant
conditions for unconstrained optimization problems
• Abstract: Abstract In the framework of large-scale optimization problems, the standard BFGS method is not affordable due to memory constraints. The so-called limited-memory BFGS (L-BFGS) method is an adaption of the BFGS method for large-scale settings. However, the standard BFGS method and therefore the standard L-BFGS method only use the gradient information of the objective function and neglect function values. In this paper, we propose a new regularized L-BFGS method for solving large scale unconstrained optimization problems in which more available information from the function and gradient values are employed to approximate the curvature of the objective function. The proposed method utilizes a class of modified quasi-Newton equations in order to achieve higher order accuracy in approximating the second order curvature of the objective function. Under some standard assumptions, we provide the global convergence property of the new method. In order to provide an efficient method for finding global minima of a continuously differentiable function, a hybrid algorithm that combines a genetic algorithm (GA) with the new proposed regularized L-BFGS method has been proposed. This combination leads the iterates to a stationary point of the objective function with higher chance of being global minima. Numerical results show the efficiency and robustness of the new proposed regularized L-BFGS and its hybridized version with GA in practice.
PubDate: 2015-12-01

• Optimal control problems with stopping constraints
• Abstract: Abstract We consider a novel optimal control problem in which the terminal time is governed by a stopping constraint. This stopping constraint is a nonlinear equality constraint depending on the state variables, and the terminal time is defined as the first time at which this constraint is satisfied. Since the stopping constraint causes the terminal time to be an implicit function of the control, the optimal control problem we consider cannot be solved using conventional techniques. We propose a new computational approach that involves approximating the original problem by a standard optimal control problem with fixed terminal time. Our main result shows that this approximation, which depends on two adjustable parameters, can be made to arbitrarily high accuracy. On this basis, the original optimal control problem with stopping constraints can be transformed into a sequence of approximate problems, each of which can be solved readily using conventional optimal control techniques. We conclude the paper by demonstrating this approach with numerical simulations in three application areas: range maximization of a hang glider, range maximization of a hypersonic re-entry vehicle, and time-optimal control of a nuclear reactor.
PubDate: 2015-12-01

• A Branch-and-Cut algorithm for factory crane scheduling problem
• Abstract: Abstract The factory crane scheduling problem (FCSP) deals with assigning delivery tasks to cranes and then sequencing them, in order to minimize the total completion time for all tasks. In this paper, delivery tasks for required jobs are preemptive allowed at most once before the jobs arrive at exit. The preemptive jobs are temporarily stored in a buffer stack, in which jobs pickup and delivery should be performed under the Last-In-First-Out policy. This feature makes our problem more changeling and interesting. In this paper, FCSP is first formulated as an integer programming model. Based on properties of the problem, FCSP is then reformulated with a much tighter bound. After that, several families of valid inequalities are proposed and used within a Branch-and-Cut framework. In addition, preprocessing techniques and separation heuristics are used to improve algorithm efficiency. Computational experiments are carried out on practical data collected from the steel company. The results support both effectiveness and efficiency of the model refinements as well as the Branch-and-Cut algorithm proposed.
PubDate: 2015-12-01

• The H -differentiability and calmness of circular cone functions
• Abstract: Abstract Let $$\mathcal{L}_{\theta }$$ be the circular cone in $${\mathbb {R}}^n$$ which includes second-order cone as a special case. For any function f from $${\mathbb {R}}$$ to $${\mathbb {R}}$$ , one can define a corresponding vector-valued function $$f^{\mathcal{L}_{\theta }}$$ on $${\mathbb {R}}^n$$ by applying f to the spectral values of the spectral decomposition of $$x \in {\mathbb {R}}^n$$ with respect to $$\mathcal{L}_{\theta }$$ . The main results of this paper are regarding the H-differentiability and calmness of circular cone function $$f^{\mathcal{L}_{\theta }}$$ . Specifically, we investigate the relations of H-differentiability and calmness between f and $$f^{\mathcal{L}_{\theta }}$$ . In addition, we propose a merit function approach for solving the circular cone complementarity problems under H-differentiability. These results are crucial to subsequent study regarding various analysis towards optimizations associated with circular cone.
PubDate: 2015-12-01

• Stochastic filter methods for generally constrained global optimization
• Abstract: Abstract A filter based template for bound and otherwise constrained global optimization of non-smooth black-box functions is presented. The constraints must include finite upper and lower bounds, and can include nonlinear equality and inequality constraints. Almost sure convergence is shown for a wide class of algorithms conforming to this template. An existing method for bound constrained global optimization (oscars) is easily modified to conform to this template. Numerical results show the modified oscars is competitive with other methods on test problems including those listed by Koziel and Michalewicz.
PubDate: 2015-11-21

• Approximate solutions of quasiequilibrium problems in Banach spaces
• Abstract: Abstract In this note we show that a recent existence result on quasiequilibrium problems, which seems to improve deeply some well-known results, is not correct. We exhibit a counterexample and we furnish a generalization of a lemma about continuous $$\varepsilon$$ -minimizers of quasiconvex functions depending on a parameter. This allows to establish an existence result of approximate solutions of quasiequilibrium problems.
PubDate: 2015-11-17

• Journal of Global Optimization Best Paper Award for a paper published in
2014
• PubDate: 2015-11-14

• Delaunay-based derivative-free optimization via global surrogates, part I:
linear constraints
• Abstract: Abstract A new derivative-free optimization algorithm is introduced for nonconvex functions within a feasible domain bounded by linear constraints. Global convergence is guaranteed for twice differentiable functions with bounded Hessian, and is found to be remarkably efficient even for many functions which are not differentiable. Like other Response Surface Methods, at each optimization step, the algorithm minimizes a metric combining an interpolation of existing function evaluations and a model of the uncertainty of this interpolation. By adjusting the respective weighting of these two terms, the algorithm incorporates a tunable balance between global exploration and local refinement; a rule to adjust this balance automatically is also presented. Unlike other methods, any well-behaved interpolation strategy may be used. The uncertainty model is built upon the framework of a Delaunay triangulation of existing datapoints in parameter space. A quadratic function which goes to zero at each datapoint is formed within each simplex of this triangulation; the union of each of these quadratics forms the desired uncertainty model. Care is taken to ensure that function evaluations are performed at points that are well situated in parameter space; that is, such that the simplices of the resulting triangulation have circumradii with a known bound. This facilitates well-behaved local refinement as additional function evaluations are performed.
PubDate: 2015-11-13

• Functional inequalities, regularity and computation of the deficit and
surplus variables in the financial equilibrium problem
• Abstract: Abstract This paper is concerned with a general model of financial flows and prices related to individual entities, called sectors, which invest in financial instruments as assets and as liabilities. In particular, using delicate tools of Functional Analysis, besides existence results of financial equilibrium, in the dual formulation, the Lagrange functions $$\rho _j^{*1}(t)$$ and $$\rho _j^{*2}(t)$$ , called “deficit” and “surplus” variables, appear and reveal to be very relevant in order to analyze the financial model and the possible insolvencies, which can lead to a financial contagion. In the paper the continuity of these Lagrange functions is proved. Finally, a procedure for the calculus of these variables is suggested.
PubDate: 2015-11-06

• Preface: special issue MAGO 2014
• PubDate: 2015-11-06

• Linear and parabolic relaxations for quadratic constraints
• Abstract: Abstract This paper presents new techniques for filtering boxes in the presence of an additional quadratic constraint, a problem relevant for branch and bound methods for global optimization and constraint satisfaction. This is done by generating powerful linear and parabolic relaxations from a quadratic constraint and bound constraints, which are then subject to standard constraint propagation techniques. The techniques are often applicable even if the original box is unbounded in some but not all variables. As an auxiliary tool—needed to make our theoretical results implementable in floating-point arithmetic without sacrificing mathematical rigor—we extend the directed Cholesky factorization from Domes and Neumaier (SIAM J Matrix Anal Appl 32:262–285, 2011) to a partial directed Cholesky factorization with pivoting. If the quadratic constraint is convex and the initial bounds are sufficiently wide, the final relaxation and the enclosure are optimal up to rounding errors. Numerical tests show the usefulness of the new factorization methods in the context of filtering.
PubDate: 2015-11-06

• Global optimization of general constrained grey-box models: new method and
its application to constrained PDEs for pressure swing adsorption
• Abstract: Abstract This paper introduces a novel methodology for the global optimization of general constrained grey-box problems. A grey-box problem may contain a combination of black-box constraints and constraints with a known functional form. The novel features of this work include (i) the selection of initial samples through a subset selection optimization problem from a large number of faster low-fidelity model samples (when a low-fidelity model is available), (ii) the exploration of a diverse set of interpolating and non-interpolating functional forms for representing the objective function and each of the constraints, (iii) the global optimization of the parameter estimation of surrogate functions and the global optimization of the constrained grey-box formulation, and (iv) the updating of variable bounds based on a clustering technique. The performance of the algorithm is presented for a set of case studies representing an expensive non-linear algebraic partial differential equation simulation of a pressure swing adsorption system for $$\hbox {CO}_{2}$$ . We address three significant sources of variability and their effects on the consistency and reliability of the algorithm: (i) the initial sampling variability, (ii) the type of surrogate function, and (iii) global versus local optimization of the surrogate function parameter estimation and overall surrogate constrained grey-box problem. It is shown that globally optimizing the parameters in the parameter estimation model, and globally optimizing the constrained grey-box formulation has a significant impact on the performance. The effect of sampling variability is mitigated by a two-stage sampling approach which exploits information from reduced-order models. Finally, the proposed global optimization approach is compared to existing constrained derivative-free optimization algorithms.
PubDate: 2015-11-05

• Global behavior of the Douglas–Rachford method for a nonconvex
feasibility problem
• Abstract: Abstract In recent times the Douglas–Rachford algorithm has been observed empirically to solve a variety of nonconvex feasibility problems including those of a combinatorial nature. For many of these problems current theory is not sufficient to explain this observed success and is mainly concerned with questions of local convergence. In this paper we analyze global behavior of the method for finding a point in the intersection of a half-space and a potentially non-convex set which is assumed to satisfy a well-quasi-ordering property or a property weaker than compactness. In particular, the special case in which the second set is finite is covered by our framework and provides a prototypical setting for combinatorial optimization problems.
PubDate: 2015-11-04

• Node selection strategies in interval Branch and Bound algorithms
• Abstract: Abstract We present in this article new strategies for selecting nodes in interval Branch and Bound algorithms for constrained global optimization. For a minimization problem the standard best-first strategy selects a node with the smallest lower bound of the objective function estimate. We first propose new node selection policies where an upper bound of each node/box is also taken into account. The good accuracy of this upper bound achieved by several contracting operators leads to a good performance of the node selection rule based on this criterion. We propose another strategy that also makes a tradeoff between diversification and intensification by greedily diving into potential feasible regions at each node of the best-first search. These new strategies obtain better experimental results than classical best-first search on difficult constrained global optimization instances.
PubDate: 2015-11-02

JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327