for Journals by Title or ISSN for Articles by Keywords help
 Subjects -> ENGINEERING (Total: 2018 journals)     - CHEMICAL ENGINEERING (161 journals)    - CIVIL ENGINEERING (154 journals)    - ELECTRICAL ENGINEERING (86 journals)    - ENGINEERING (1135 journals)    - ENGINEERING MECHANICS AND MATERIALS (307 journals)    - HYDRAULIC ENGINEERING (48 journals)    - INDUSTRIAL ENGINEERING (52 journals)    - MECHANICAL ENGINEERING (75 journals) ENGINEERING (1135 journals)            First | 2 3 4 5 6 7 8 9 | Last
 International Journal of Intelligent Systems and Applications in Engineering       (Followers: 1) International Journal of Lifecycle Performance Engineering International Journal of Machine Tools and Manufacture       (Followers: 4) International Journal of Manufacturing Research       (Followers: 5) International Journal of Manufacturing Technology and Management       (Followers: 7) International Journal of Materials and Product Technology       (Followers: 4) International Journal of Mathematical Education in Science and Technology       (Followers: 7) International Journal of Mathematics in Operational Research       (Followers: 1) International Journal of Medical Engineering and Informatics       (Followers: 5) 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: 2) International Journal of Mobile Network Design and Innovation       (Followers: 3) International Journal of Multiphase Flow       (Followers: 2) International Journal of Nanomanufacturing       (Followers: 1) International Journal of Nanoscience       (Followers: 1) International Journal of Nanotechnology       (Followers: 5) International Journal of Nanotechnology and Molecular Computation       (Followers: 3) International Journal of Navigation and Observation       (Followers: 6) International Journal of Network Management International Journal of Nonlinear Sciences and Numerical Simulation International Journal of Numerical Methods for Heat & Fluid Flow       (Followers: 7) International Journal of Optics       (Followers: 1) International Journal of Organisational Design and Engineering       (Followers: 9) International Journal of Pattern Recognition and Artificial Intelligence       (Followers: 6) International Journal of Pavement Engineering       (Followers: 2) International Journal of Physical Modelling in Geotechnics       (Followers: 3) International Journal of Plasticity       (Followers: 6) International Journal of Plastics Technology International Journal of Polymer Analysis and Characterization       (Followers: 4) International Journal of Polymer Science       (Followers: 16) International Journal of Precision Engineering and Manufacturing       (Followers: 5) International Journal of Precision Technology International Journal of Pressure Vessels and Piping       (Followers: 3) International Journal of Production Economics       (Followers: 13) International Journal of Quality and Innovation       (Followers: 4) 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: 1) International Journal of Reliability, Quality and Safety Engineering       (Followers: 6) International Journal of Renewable Energy Technology       (Followers: 8) International Journal of Robust and Nonlinear Control       (Followers: 2) 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: 1) International Journal of Software Engineering and Knowledge Engineering       (Followers: 1) International Journal of Space Science and Engineering       (Followers: 2) International Journal of Speech Technology       (Followers: 3) International Journal of Spray and Combustion Dynamics       (Followers: 6) International Journal of Surface Engineering and Interdisciplinary Materials Science       (Followers: 1) International Journal of Surface Science and Engineering       (Followers: 7) International Journal of Sustainable Engineering       (Followers: 7) International Journal of Sustainable Manufacturing       (Followers: 4) 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 International Journal of Technology Management and Sustainable Development       (Followers: 1) International Journal of Technology Policy and Law       (Followers: 4) International Journal of Telemedicine and Applications       (Followers: 2) International Journal of Thermal Sciences       (Followers: 5) International Journal of Thermodynamics       (Followers: 2) International Journal of Turbo & Jet-Engines International Journal of Ultra Wideband Communications and Systems International Journal of Vehicle Autonomous Systems       (Followers: 1) International Journal of Vehicle Design       (Followers: 6) 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: 2) 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: 9) International Review of Applied Sciences and Engineering Inverse Problems in Science and Engineering       (Followers: 2) Ionics IPTEK The Journal for Technology and Science IRBM News Irrigation and Drainage Systems ISA Transactions       (Followers: 1) ISRN - International Scholarly Research Notices       (Followers: 69) ISRN Nanotechnology ISRN Signal Processing ISRN Thermodynamics IT Professional       (Followers: 3) Journal of Biosensors & Bioelectronics       (Followers: 2) Journal of Advanced Manufacturing Systems       (Followers: 6) Journal of Aerosol Science       (Followers: 1) Journal of Aerospace Engineering       (Followers: 166) Journal of Alloys and Compounds       (Followers: 8) Journal of Analytical and Applied Pyrolysis       (Followers: 3) Journal of Analytical Science & Technology       (Followers: 4) Journal of Analytical Sciences, Methods and Instrumentation       (Followers: 1) Journal of Applied Analysis Journal of Applied and Industrial Sciences
 Journal of Global Optimization    [6 followers]  Follow        Hybrid journal (It can contain Open Access articles)      ISSN (Print) 1573-2916 - ISSN (Online) 0925-5001      Published by Springer-Verlag  [2210 journals]   [SJR: 1.149]   [H-I: 46]
• Extended Lorentz cones and mixed complementarity problems
• Abstract: Abstract In this paper we extend the notion of a Lorentz cone in a Euclidean space as follows: we divide the index set corresponding to the coordinates of points in two disjoint classes. By definition a point belongs to an extended Lorentz cone associated with this division, if the coordinates corresponding to one class are at least as large as the norm of the vector formed by the coordinates corresponding to the other class. We call a closed convex set isotone projection set with respect to a pointed closed convex cone if the projection onto the set is isotone (i.e., order preserving) with respect to the partial order defined by the cone. We determine the isotone projection sets with respect to an extended Lorentz cone. In particular, a Cartesian product between an Euclidean space and any closed convex set in another Euclidean space is such a set. We use this property to find solutions of general mixed complementarity problems recursively.
PubDate: 2014-12-03

• Hybrid methods with regularization for minimization problems and
asymptotically strict pseudocontractive mappings in the intermediate sense

• Abstract: Abstract In this paper we introduce an iterative algorithm for finding a common element of the fixed point set of an asymptotically strict pseudocontractive mapping S in the intermediate sense and the solution set of the minimization problem (MP) for a convex and continuously Frechet differentiable functional in Hilbert space. The iterative algorithm is based on several well-known methods including the extragradient method, CQ method, Mann-type iterative method and hybrid gradient projection algorithm with regularization. We obtain a strong convergence theorem for three sequences generated by our iterative algorithm. In addition, we also prove a new weak convergence theorem by a modified extragradient method with regularization for the MP and the mapping S.
PubDate: 2014-12-01

• Existence theorem for a class of generalized quasi-variational
inequalities
• Abstract: Abstract In this paper we consider a class of generalized quasi-variational inequalities. The variational problem is studied in the convex set $$X\times Y$$ , with $$Y$$ bounded and $$X$$ unbounded. In the latter settings, we investigate about the solvability of the problem. In particular, by using the perturbation theory, we give an existence result of the solution without requesting any coercivity hypothesis on the operator. Finally, we give an application to the obtained theoretical results in terms of an economic equilibrium problem.
PubDate: 2014-12-01

• On cyclic and $$n$$ n -cyclic monotonicity of bifunctions
• Abstract: Abstract In the recent literature, the connection between maximal monotone operators and the Fitzpatrick function is investigated. Subsequently, this relation has been extended to maximal monotone bifunctions and their Fitzpatrick transform. In this paper we generalize some of these results to maximal $$n$$ -cyclically monotone and maximal cyclically monotone bifunctions, by introducing and studying the Fitzpatrick transforms of order $$n$$ or infinite order for bifunctions.
PubDate: 2014-12-01

• Properly optimal elements in vector optimization with variable ordering
structures
• Abstract: Abstract In this paper, proper optimality concepts in vector optimization with variable ordering structures are introduced for the first time and characterization results via scalarizations are given. New type of scalarizing functionals are presented and their properties are discussed. The scalarization approach suggested in the paper does not require convexity and boundedness conditions.
PubDate: 2014-12-01

• Optimal control of impulsive switched systems with minimum subsystem
durations
• Abstract: Abstract This paper presents a new computational approach for solving optimal control problems governed by impulsive switched systems. Such systems consist of multiple subsystems operating in succession, with possible instantaneous state jumps occurring when the system switches from one subsystem to another. The control variables are the subsystem durations and a set of system parameters influencing the state jumps. In contrast with most other papers on the control of impulsive switched systems, we do not require every potential subsystem to be active during the time horizon (it may be optimal to delete certain subsystems, especially when the optimal number of switches is unknown). However, any active subsystem must be active for a minimum non-negligible duration of time. This restriction leads to a disjoint feasible region for the subsystem durations. The problem of choosing the subsystem durations and the system parameters to minimize a given cost function is a non-standard optimal control problem that cannot be solved using conventional techniques. By combining a time-scaling transformation and an exact penalty method, we develop a computational algorithm for solving this problem. We then demonstrate the effectiveness of this algorithm by considering a numerical example on the optimization of shrimp harvesting operations.
PubDate: 2014-12-01

• Minimum total coloring of planar graph
• Abstract: Abstract Graph coloring is an important tool in the study of optimization, computer science, network design, e.g., file transferring in a computer network, pattern matching, computation of Hessians matrix and so on. In this paper, we consider one important coloring, vertex coloring of a total graph, which is familiar to us by the name of “total coloring”. Total coloring is a coloring of $$V\cup {E}$$ such that no two adjacent or incident elements receive the same color. In other words, total chromatic number of $$G$$ is the minimum number of disjoint vertex independent sets covering a total graph of $$G$$ . Here, let $$G$$ be a planar graph with $$\varDelta \ge 8$$ . We proved that if for every vertex $$v\in V$$ , there exists two integers $$i_{v},j_{v} \in \{3,4,5,6,7,8\}$$ such that $$v$$ is not incident with intersecting $$i_v$$ -cycles and $$j_v$$ -cycles, then the vertex chromatic number of total graph of $$G$$ is $$\varDelta +1$$ , i.e., the total chromatic number of $$G$$ is $$\varDelta +1$$ .
PubDate: 2014-12-01

• A parametric solution algorithm for a class of rank-two nonconvex programs
• Abstract: Abstract The aim of this paper is to propose a solution algorithm for a particular class of rank-two nonconvex programs having a polyhedral feasible region. The algorithm lies within the class of the so called “optimal level solutions” parametric methods. The subproblems obtained by means of this parametrical approach are quadratic convex ones, but not necessarily neither strictly convex nor linear. For this very reason, in order to solve in an unifying framework all of the considered rank-two nonconvex programs a new approach needs to be proposed. The efficiency of the algorithm is improved by means of the use of underestimation functions. The results of a computational test are provided and discussed.
PubDate: 2014-12-01

• Bound constrained interval global optimization in the COCONUT Environment
• Abstract: Abstract We introduce a new interval global optimization method for solving bound constrained problems. The method originates from a small standalone software and is implemented in the COCONUT Environment, a framework designed for the development of complex algorithms, containing numerous state-of-the-art methods in a common software platform. The original algorithm is enhanced by various new methods implemented in COCONUT, regarding both interval function evaluations (such as first and second order derivatives with backward automatic differentiation, slopes, slopes of derivatives, bicentered forms, evaluations on the Karush–John conditions, etc.) and algorithmic elements (inclusion/exclusion boxes, local search, constraint propagation). This resulted in a substantial performance increase as compared to the original code. During the selection of the best combination of options, we performed comparison tests that gave empirical answers to long-lasting algorithmic questions (such as whether to use interval gradients or use slopes instead), that have never been studied numerically in such detail before. The new algorithm, called coco_gop_ex, was tested against the prestigious BARON software on an extensive set of bound constrained problems. We found that in addition to accepting a wider class of bound constrained problems and providing more output information (by locating all global minimizers), coco_gop_ex is competitive with BARON in terms of the solution success rates (with the exception of a set of nonlinear least squares problems), and it often outperforms BARON in running time. In particular, coco_gop_ex was around 21 % faster on average over the set of problems solved by both software systems.
PubDate: 2014-12-01

• Primal and dual approximation algorithms for convex vector optimization
problems
• Abstract: Abstract Two approximation algorithms for solving convex vector optimization problems (CVOPs) are provided. Both algorithms solve the CVOP and its geometric dual problem simultaneously. The first algorithm is an extension of Benson’s outer approximation algorithm, and the second one is a dual variant of it. Both algorithms provide an inner as well as an outer approximation of the (upper and lower) images. Only one scalar convex program has to be solved in each iteration. We allow objective and constraint functions that are not necessarily differentiable, allow solid pointed polyhedral ordering cones, and relate the approximations to an appropriate $$\epsilon$$ -solution concept. Numerical examples are provided.
PubDate: 2014-12-01

• Risk-control approach for bottleneck transportation problem with
randomness and fuzziness
• Abstract: Abstract Solving transportation problems is essential in engineering and supply chain management, where profitability depends on optimal traffic flow. This study proposes risk-control approaches for two bottleneck transportation problems with random variables and preference levels to objective functions with risk parameters. Each proposed model is formulated as a multiobjective programming problem using robust-based optimization derived from stochastic chance constraints. Since it is impossible to obtain a transportation pattern that optimizes all objective functions, our proposed models are numerically solved by introducing an aggregation function for the multiobjective problem. An exact algorithm that performs deterministic equivalent transformations and introduces auxiliary problems is also developed.
PubDate: 2014-12-01

• Motzkin predecomposable sets
• Abstract: Abstract We introduce and study the family of sets in a finite dimensional Euclidean space which can be written as the Minkowski sum of a compact and convex set and a convex cone (not necessarily closed). We establish several properties of the class of such sets, called Motzkin predecomposable, some of which hold also for the class of Motzkin decomposable sets (i.e., those for which the convex cone in the decomposition is requested to be closed), while others are specific of the new family.
PubDate: 2014-12-01

• Note on coloring of double disk graphs
• Abstract: Abstract The coloring of disk graphs is motivated by the frequency assignment problem. In 1998, Malesińska et al. introduced double disk graphs as their generalization. They showed that the chromatic number of a double disk graph $$G$$ is at most $$33\,\omega (G) - 35$$ , where $$\omega (G)$$ denotes the size of a maximum clique in $$G$$ . Du et al. improved the upper bound to $$31\,\omega (G) - 1$$ . In this paper we decrease the bound substantially; namely we show that the chromatic number of $$G$$ is at most $$15\,\omega (G) - 14$$ .
PubDate: 2014-12-01

• The robust constant and its applications in random global search for
unconstrained global optimization
• Abstract: Abstract Robust analysis is important for designing and analyzing algorithms for global optimization. In this paper, we introduce a new concept, robust constant, to quantitatively characterize the robustness of measurable sets and functions. The new concept is consistent to the theoretical robustness presented in literatures. This paper shows that, from the respects of convergence theory and numerical computational cost, robust constant is valuable significantly for analyzing random global search methods for unconstrained global optimization.
PubDate: 2014-11-30

• The retailer’s optimal decision on order quantity and credit periods
• Abstract: Abstract In this paper, we propose an inventory model under two-level trade credit policy, where the supplier offers quantity discounts and allows the retailer to choose the period of delay in payments that determines the unit purchasing cost, and so retailer’s unit purchasing cost is a function of both ordering quantity and his/her allowed credit period. Furthermore, the demand function is relevant to the credit period offered by the retailer to his/her customers. Our objective here is to maximize the retailer’s total profit per unit time by solving the optimal decision on ordering quantity and two credit periods. An effective algorithm is developed to determine the optimal solution to the problem. Numerical examples are provided to illustrate the impact of the model parameters on the optimal solutions.
PubDate: 2014-11-27

• Optimization over the Pareto outcome set associated with a convex
bi-objective optimization problem: theoretical results, deterministic
algorithm and application to the stochastic case
• Abstract: Abstract Our paper consists of two main parts. In the first one, we deal with the deterministic problem of minimizing a real valued function $$f$$ over the Pareto outcome set associated with a deterministic convex bi-objective optimization problem (BOP), in the particular case where $$f$$ depends on the objectives of (BOP), i.e. we optimize over the Pareto set in the outcome space. In general, the optimal value $$U$$ of such a kind of problem cannot be computed directly, so we propose a deterministic outcome space algorithm whose principle is to give at every step a range (lower bound, upper bound) that contains $$U$$ . Then we show that for any given error bound, the algorithm terminates in a finite number of steps. In the second part of our paper, in order to handle also the stochastic case, we consider the situation where the two objectives of (BOP) are given by expectations of random functions, and we deal with the stochastic problem $$(S)$$ of minimizing a real valued function $$f$$ over the Pareto outcome set associated with this Stochastic bi-objective Optimization Problem (SBOP). Because of the presence of random functions, the Pareto set associated with this type of problem cannot be explicitly given, and thus it is not possible to compute the optimal value $$V$$ of problem $$(S)$$ . That is why we consider a sequence of Sample Average Approximation problems (SAA- $$N$$ , where $$N$$ is the sample size) whose optimal values converge almost surely to $$V$$ as the sample size $$N$$ goes to infinity. Assuming $$f$$ nondecreasing, we show that the convergence rate is exponential, and we propose a confidence interval for $$V$$ . Finally, some computational results are given to illustrate the paper.
PubDate: 2014-11-26

• SymNMF: nonnegative low-rank approximation of a similarity matrix for
graph clustering
• Abstract: Abstract Nonnegative matrix factorization (NMF) provides a lower rank approximation of a matrix by a product of two nonnegative factors. NMF has been shown to produce clustering results that are often superior to those by other methods such as K-means. In this paper, we provide further interpretation of NMF as a clustering method and study an extended formulation for graph clustering called Symmetric NMF (SymNMF). In contrast to NMF that takes a data matrix as an input, SymNMF takes a nonnegative similarity matrix as an input, and a symmetric nonnegative lower rank approximation is computed. We show that SymNMF is related to spectral clustering, justify SymNMF as a general graph clustering method, and discuss the strengths and shortcomings of SymNMF and spectral clustering. We propose two optimization algorithms for SymNMF and discuss their convergence properties and computational efficiencies. Our experiments on document clustering, image clustering, and image segmentation support SymNMF as a graph clustering method that captures latent linear and nonlinear relationships in the data.
PubDate: 2014-11-19

• A note on the complexity of scheduling problems with linear job
deterioration
• Abstract: Abstract Jafari and Moslehi (J Glob Optim 54:389–404, 2012) state that certain single-machine scheduling problems with linear job deterioration are NP-hard. We show that this is not the case for the maximum lateness minimization problem and point out the issues in the analysis of Jafari and Moslehi (J Glob Optim 54:389–404, 2012).
PubDate: 2014-11-18

• R. Paulavičius and J. Žilinskas: Simplicial global optimization
• PubDate: 2014-10-30

• Journal of Global Optimization Best Paper Award for a paper published in
2013
• PubDate: 2014-10-30

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