for Journals by Title or ISSN for Articles by Keywords help
 Subjects -> ENGINEERING (Total: 1962 journals)     - CHEMICAL ENGINEERING (151 journals)    - CIVIL ENGINEERING (149 journals)    - ELECTRICAL ENGINEERING (82 journals)    - ENGINEERING (1119 journals)    - ENGINEERING MECHANICS AND MATERIALS (290 journals)    - HYDRAULIC ENGINEERING (45 journals)    - INDUSTRIAL ENGINEERING (52 journals)    - MECHANICAL ENGINEERING (74 journals) ENGINEERING (1119 journals)            First | 2 3 4 5 6 7 8 9 | Last
 International Journal of Intelligent Engineering Informatics 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: 7) International Journal of Manufacturing Technology and Management       (Followers: 9) International Journal of Materials and Product Technology       (Followers: 4) International Journal of Mathematical Education in Science and Technology       (Followers: 6) 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: 3) 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: 4) International Journal of Navigation and Observation       (Followers: 5) International Journal of Network Management International Journal of Nonlinear Sciences and Numerical Simulation       (Followers: 1) 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: 8) 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: 3) International Journal of Polymer Science       (Followers: 16) International Journal of Precision Engineering and Manufacturing       (Followers: 7) International Journal of Precision Technology International Journal of Pressure Vessels and Piping       (Followers: 2) International Journal of Production Economics       (Followers: 10) International Journal of Quality and Innovation       (Followers: 2) International Journal of Quality Engineering and Technology       (Followers: 2) International Journal of Quantum Information International Journal of Rapid Manufacturing       (Followers: 3) International Journal of Reliability, Quality and Safety Engineering       (Followers: 4) International Journal of Renewable Energy Technology       (Followers: 7) 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: 2) International Journal of Spray and Combustion Dynamics       (Followers: 5) 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 Assurance Engineering and Management International Journal of Systems, Control and Communications       (Followers: 2) 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: 4) International Journal of Thermodynamics       (Followers: 1) 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: 4) International Journal of Vehicular Technology       (Followers: 1) 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: 5) 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 Ironmaking & Steelmaking       (Followers: 2) Irrigation and Drainage Systems ISA Transactions ISRN - International Scholarly Research Notices       (Followers: 69) ISRN Signal Processing IT Professional       (Followers: 2) Journal of Biosensors & Bioelectronics       (Followers: 1) Journal of Advanced Manufacturing Systems       (Followers: 8) Journal of Aerosol Science       (Followers: 2) Journal of Aerospace Engineering       (Followers: 111) Journal of Alloys and Compounds       (Followers: 6) 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 Applied Logic Journal of Applied Physics       (Followers: 138) Journal of Applied Probability       (Followers: 6) Journal of Applied Research and Technology
 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  [2209 journals]   [SJR: 1.149]   [H-I: 46]
• A new mathematical approach for handling DVH criteria in IMRT planning
• Abstract: Abstract The appropriate handling of planning criteria on the cumulative dose-volume histogram (DVH) is a highly problematic issue in intensity-modulated radiation therapy (IMRT) plan optimization. The nonconvexity of DVH criteria and globality of the resulting optimization problems complicate the design of suitable optimization methods, which feature numerical efficiency, reliable convergence and optimality of the results. This work examines the mathematical structure of DVH criteria and proves the valuable properties of isotonicity/antitonicity, connectedness, invexity and sufficiency of the Karush–Kuhn–Tucker condition. These properties facilitate the use of efficient and goal-oriented optimization methods. An exemplary algorithmic realization with feasible direction methods gives rise to a functional framework for interactive IMRT planning on DVH criteria. Numerical examples on real world planning cases prove its practical capability.
PubDate: 2014-05-18

• Necessary optimality conditions for optimistic bilevel programming
problems using set-valued programming
• Abstract: Abstract In this paper we adapt the main results from Amahroq and Gadhi (J Glob Optim 21:435–443, 2001) for a general set-valued optimization problem to an optimistic bilevel programming problem as an optimization problem with implicitly given set-valued constraint. Since this constraint is assumed to be upper but not lower semicontinuous in the sense of Berge, we need to deal with a lower semicontinuous distance function to this mapping. In order to approximate the gradient of the distance function, we introduce a new concept for a directional convexificator. Some calculus rules for this new tool are adapted and several properties are characterized. The main result presents optimality conditions for an optimistic bilevel programming problem using a convexificator constructed with the aid of the directional convexificator.
PubDate: 2014-05-17

• Branching and bounding improvements for global optimization algorithms
with Lipschitz continuity properties
• Abstract: Abstract We present improvements to branch and bound techniques for globally optimizing functions with Lipschitz continuity properties by developing novel bounding procedures and parallelisation strategies. The bounding procedures involve nonconvex quadratic or cubic lower bounds on the objective and use estimates of the spectrum of the Hessian or derivative tensor, respectively. As the nonconvex lower bounds are only tractable if solved over Euclidean balls, we implement them in the context of a recent branch and bound algorithm (Fowkes et al. in J Glob Optim 56:1791–1815, 2013) that uses overlapping balls. Compared to the rectangular tessellations of traditional branch and bound, overlapping ball coverings result in an increased number of subproblems that need to be solved and hence makes the need for their parallelization even more stringent and challenging. We develop parallel variants based on both data- and task-parallel paradigms, which we test on an HPC cluster on standard test problems with promising results.
PubDate: 2014-05-15

• Some equivalence results for well-posedness of hemivariational
inequalities
• Abstract: Abstract In the present paper, we are devoted to exploring conditions of well-posedness for hemivariational inequalities in reflexive Banach spaces. By using some equivalent formulations of the hemivariational inequality considered under different monotonicity assumptions, we establish two kinds of conditions under which the strong well-posedness and the weak well-posedness for the hemivariational inequality considered are equivalent to the existence and uniqueness of its solution, respectively.
PubDate: 2014-05-13

• On an extension of Pólya’s Positivstellensatz
• Abstract: Abstract In this paper we provide a generalization of a Positivstellensatz by Pólya [Pólya in Naturforsch Ges Zürich 73:141–145 1928]. We show that if a homogeneous polynomial is positive over the intersection of the non-negative orthant and a given basic semialgebraic cone (excluding the origin), then there exists a “Pólya type” certificate for non-negativity. The proof of this result uses the original Positivstellensatz by Pólya, and a Positivstellensatz by Putinar and Vasilescu [Putinar and Vasilescu C R Acad Sci Ser I Math 328(7) 1999].
PubDate: 2014-05-13

• On continuation methods for non-linear bi-objective optimization: towards
a certified interval-based approach
• Abstract: Abstract The global resolution of constrained non-linear bi-objective optimization problems (NLBOO) aims at covering their Pareto-optimal front which is in general a one-manifold in $\mathbb {R}^2$ . Continuation methods can help in this context as they can follow a continuous component of this front once an initial point on it is provided. They constitute somehow a generalization of the classical scalarization framework which transforms the bi-objective problem into a parametric single-objective problem. Recent works have shown that they can play a key role in global algorithms dedicated to bi-objective problems, e.g. population based algorithms, where they allow discovering large portions of locally Pareto optimal vectors, which turns out to strongly support diversification. The contribution of this paper is twofold: we first provide a survey on continuation techniques in global optimization methods for NLBOO, identifying relations between several work and usual limitations, among which the ability to handle inequality constraints. We then propose a rigorous active set management strategy on top of a continuation method based on interval analysis, certified with respect to feasibility, local optimality and connectivity. This allows overcoming the latter limitation as illustrated on a representative bi-objective problem.
PubDate: 2014-05-11

• Conic approximation to nonconvex quadratic programming with convex
• Abstract: Abstract In this paper, a conic reformulation and approximation is proposed for solving a nonconvex quadratic programming problem subject to several convex quadratic constraints. The original problem is transformed into a linear conic programming problem, which can be approximated by a sequence of linear conic programming problems over the dual cone of the cone of nonnegative quadratic functions. Since the dual cone of the cone of nonnegative quadratic functions has a linear matrix inequality representation, each linear conic programming problem in the sequence can be solved efficiently using the semidefinite programming techniques. In order to speed up the convergence of the approximation sequence and relieve the computational effort in solving the linear conic programming problems, an adaptive scheme is adopted in the proposed algorithm. We prove that the lower bounds generated by the linear conic programming problems converge to the optimal value of the original problem. Several numerical examples are used to illustrate how the algorithm works and the computational results demonstrate the efficiency of the proposed algorithm.
PubDate: 2014-05-10

• A convergent conical algorithm with        inline-equation id-i-eq1">        equation-source format-t-e-x">$\omega$ -bisection for
concave minimization
• Abstract: Abstract The conical algorithm is a global optimization algorithm proposed by Tuy in 1964 to solve concave minimization problems. Introducing the concept of pseudo-nonsingularity, we give an alternative proof of convergence of the algorithm with the $\omega$ -subdivision rule. We also develop a new convergent subdivision rule, named $\omega$ -bisection, and report numerical results of comparing it with the usual $\omega$ -subdivision.
PubDate: 2014-05-10

• History-dependent mixed variational problems in contact mechanics
• Abstract: We consider a new class of mixed variational problems arising in Contact Mechanics. The problems are formulated on the unbounded interval of time $[0,+\infty )$ and involve history-dependent operators. For such problems we prove existence, uniqueness and continuous dependence results. The proofs are based on results on generalized saddle point problems and various estimates, combined with a fixed point argument. Then, we apply the abstract results in the study of a mathematical model which describes the frictionless contact between a viscoplastic body and an obstacle, the so-called foundation. The process is quasistatic and the contact is modelled with normal compliance and unilateral constraint, in such a way that the stiffness coefficient depends on the history of the penetration. We prove the unique weak solvability of the contact problem, as well as the continuous dependence of its weak solution with respect to the viscoplastic constitutive function, the applied forces, the contact conditions and the initial data.
PubDate: 2014-05-07

• New heuristic for harmonic means clustering
• Abstract: Abstract It is well known that some local search heuristics for $K$ -clustering problems, such as $k$ -means heuristic for minimum sum-of-squares clustering occasionally stop at a solution with a smaller number of clusters than the desired number $K$ . Such solutions are called degenerate. In this paper, we reveal that the degeneracy also exists in $K$ -harmonic means (KHM) method, proposed as an alternative to $K$ -means heuristic, but which is less sensitive to the initial solution. In addition, we discover two types of degenerate solutions and provide examples for both. Based on these findings, we give a simple method to remove degeneracy during the execution of the KHM heuristic; it can be used as a part of any other heuristic for KHM clustering problem. We use KHM heuristic within a recent variant of variable neighborhood search (VNS) based heuristic. Extensive computational analysis, performed on test instances usually used in the literature, shows that significant improvements are obtained if our simple degeneracy correcting method is used within both KHM and VNS. Moreover, our VNS based heuristic suggested here may be considered as a new state-of-the-art heuristic for solving KHM clustering problem.
PubDate: 2014-05-06

• Preface: Honoring the 60th birthday of Panos M. Pardalos
• PubDate: 2014-05-04

• Exact solution approach for a class of nonlinear bilevel knapsack problems
• Abstract: Abstract We study a class of nonlinear bilevel knapsack problems. The upper-level objective is a nonlinear integer function of both the leader’s and the follower’s decision variables. At the lower level the follower solves a linear binary knapsack problem, where the right-hand side of the knapsack constraint depends on the resource allocated by the leader. After discussing computational complexity issues, we propose an exact solution approach using an equivalent single-level value function reformulation. Extensive computational experiments are performed with quadratic and fractional binary objective functions.
PubDate: 2014-05-03

• Models and solution techniques for production planning problems with
increasing byproducts
• Abstract: Abstract We consider a production planning problem where the production process creates a mixture of desirable products and undesirable byproducts. In this production process, at any point in time the fraction of the mixture that is an undesirable byproduct increases monotonically as a function of the cumulative mixture production up to that time. The mathematical formulation of this continuous-time problem is nonconvex. We present a discrete-time mixed-integer nonlinear programming (MINLP) formulation that exploits the increasing nature of the byproduct ratio function. We demonstrate that this new formulation is more accurate than a previously proposed MINLP formulation. We describe three different mixed-integer linear programming (MILP) approximation and relaxation models of this nonconvex MINLP, and we derive modifications that strengthen the linear programming relaxations of these models. We also introduce nonlinear programming formulations to choose piecewise-linear approximations and relaxations of multiple functions that share the same domain and use the same set of break points in the domain. We conclude with computational experiments that demonstrate that the proposed formulation is more accurate than the previous formulation, and that the strengthened MILP approximation and relaxation models can be used to obtain provably near-optimal solutions for large instances of this nonconvex MINLP. Experiments also illustrate the quality of the piecewise-linear approximations produced by our nonlinear programming formulations.
PubDate: 2014-05-03

• Stability for trust-region methods via generalized differentiation
• Abstract: Abstract We obtain necessary and sufficient conditions for local Lipschitz-like property and sufficient conditions for local metric regularity in Robinson’s sense of Karush–Kuhn–Tucker point set maps of trust-region subproblems in trust-region methods. The main tools being used in our investigation are dual criteria for fundamental properties of implicit multifunctions which are established on the basis of generalized differentiation of normal cone mappings.
PubDate: 2014-05-01

• Order statistics and region-based evolutionary computation
• Abstract: Abstract Trust region algorithms are well known in the field of local continuous optimization. They proceed by maintaining a confidence region in which a simple, most often quadratic, model is substituted to the criterion to be minimized. The minimum of the model in the trust region becomes the next starting point of the algorithm and, depending on the amount of progress made during this step, the confidence region is expanded, contracted or kept unchanged. In the field of global optimization, interval programming may be thought as a kind of confidence region approach, with a binary confidence level: the region is guaranteed to contain the optimum or guaranteed to not contain it. A probabilistic version, known as branch and probability bound, is based on an approximate probability that a region of the search space contains the optimum, and has a confidence level in the interval [0,1]. The method introduced in this paper is an application of the trust region approach within the framework of evolutionary algorithms. Regions of the search space are endowed with a prospectiveness criterion obtained from random sampling possibly coupled with a local continuous algorithm. The regions are considered as individuals for an evolutionary algorithm with mutation and crossover operators based on a transformation group. The performance of the algorithm on some standard benchmark functions is presented.
PubDate: 2014-05-01

• Levitin–Polyak well-posedness for constrained quasiconvex vector
optimization problems
• Abstract: Abstract In this paper, a notion of Levitin–Polyak (LP in short) well-posedness is introduced for a vector optimization problem in terms of minimizing sequences and efficient solutions. Sufficient conditions for the LP well-posedness are studied under the assumptions of compactness of the feasible set, closedness of the set of minimal solutions and continuity of the objective function. The continuity assumption is then weakened to cone lower semicontinuity for vector-valued functions. A notion of LP minimizing sequence of sets is studied to establish another set of sufficient conditions for the LP well-posedness of the vector problem. For a quasiconvex vector optimization problem, sufficient conditions are obtained by weakening the compactness of the feasible set to a certain level-boundedness condition. This in turn leads to the equivalence of LP well-posedness and compactness of the set of efficient solutions. Some characterizations of LP well-posedness are given in terms of the upper Hausdorff convergence of the sequence of sets of approximate efficient solutions and the upper semicontinuity of an approximate efficient map by assuming the compactness of the set of efficient solutions, even when the objective function is not necessarily quasiconvex. Finally, a characterization of LP well-posedness in terms of the closedness of the approximate efficient map is provided by assuming the compactness of the feasible set.
PubDate: 2014-05-01

• On penalty methods for non monotone equilibrium problems
• Abstract: Abstract We consider a general equilibrium problem under weak coercivity conditions in a finite-dimensional space setting. It appears such a condition provides convergence of the general penalty method without any monotonicity assumptions. We also show that the regularized version of the penalty method enables us to further weaken the coercivity condition.
PubDate: 2014-05-01

• Path-following gradient-based decomposition algorithms for separable
convex optimization
• Abstract: Abstract A new decomposition optimization algorithm, called path-following gradient-based decomposition, is proposed to solve separable convex optimization problems. Unlike path-following Newton methods considered in the literature, this algorithm does not require any smoothness assumption on the objective function. This allows us to handle more general classes of problems arising in many real applications than in the path-following Newton methods. The new algorithm is a combination of three techniques, namely smoothing, Lagrangian decomposition and path-following gradient framework. The algorithm decomposes the original problem into smaller subproblems by using dual decomposition and smoothing via self-concordant barriers, updates the dual variables using a path-following gradient method and allows one to solve the subproblems in parallel. Moreover, compared to augmented Lagrangian approaches, our algorithmic parameters are updated automatically without any tuning strategy. We prove the global convergence of the new algorithm and analyze its convergence rate. Then, we modify the proposed algorithm by applying Nesterov’s accelerating scheme to get a new variant which has a better convergence rate than the first algorithm. Finally, we present preliminary numerical tests that confirm the theoretical development.
PubDate: 2014-05-01

• Subdifferential test for optimality
• Abstract: Abstract We provide a first-order necessary and sufficient condition for optimality of lower semicontinuous functions on Banach spaces using the concept of subdifferential. From the sufficient condition we derive that any subdifferential operator is monotone absorbing, hence maximal monotone when the function is convex.
PubDate: 2014-05-01

• On the stability of the linear functional equation in a single variable on
complete metric groups
• Abstract: Abstract In this paper we obtain a result on Hyers–Ulam stability of the linear functional equation in a single variable $f(\varphi (x)) = g(x) \cdot f(x)$ on a complete metric group.
PubDate: 2014-05-01

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