for Journals by Title or ISSN for Articles by Keywords help
 Subjects -> ENGINEERING (Total: 2166 journals)     - CHEMICAL ENGINEERING (185 journals)    - CIVIL ENGINEERING (168 journals)    - ELECTRICAL ENGINEERING (93 journals)    - ENGINEERING (1171 journals)    - ENGINEERING MECHANICS AND MATERIALS (356 journals)    - HYDRAULIC ENGINEERING (55 journals)    - INDUSTRIAL ENGINEERING (57 journals)    - MECHANICAL ENGINEERING (81 journals) ENGINEERING (1171 journals)            First | 2 3 4 5 6 7 8 9 | Last
 International Journal of Grid and Utility Computing International Journal of Heat and Fluid Flow       (Followers: 18) International Journal of Heat and Mass Transfer       (Followers: 129) 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: 3) International Journal of Innovation Science       (Followers: 6) International Journal of Innovative Technology and Research 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: 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: 3) International Journal of Nanomanufacturing International Journal of Nanoscience International Journal of Nanotechnology       (Followers: 4) 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: 6) 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: 5) International Journal of Polymer Science       (Followers: 20) International Journal of Precision Engineering and Manufacturing       (Followers: 5) International Journal of Precision Engineering and Manufacturing-Green Technology 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: 3) International Journal of Reliability, Quality and Safety Engineering       (Followers: 8) International Journal of Renewable Energy Technology       (Followers: 9) 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: 5) International Journal of Spray and Combustion Dynamics       (Followers: 6) 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: 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       (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: 3) 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: 8) International Review of Applied Sciences and Engineering International Scholarly Research Notices       (Followers: 239) Inverse Problems in Science and Engineering       (Followers: 2) Ionics IPTEK The Journal for Technology and Science IRBM News Ironmaking & Steelmaking       (Followers: 2)
 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  [2291 journals]
• Erratum to: A box-constrained differentiable penalty method for nonlinear
complementarity problems
• PubDate: 2015-08-01

• Scalarization and pointwise well-posedness for set optimization problems
• Abstract: Abstract In this paper, we consider three kinds of pointwise well-posedness for set optimization problems. We establish some relations among the three kinds of pointwise well-posedness. By virtue of a generalized nonlinear scalarization function, we obtain the equivalence relations between the three kinds of pointwise well-posedness for set optimization problems and the well-posedness of three kinds of scalar optimization problems, respectively.
PubDate: 2015-08-01

• Norm descent conjugate gradient methods for solving symmetric nonlinear
equations
• Abstract: Abstract Nonlinear conjugate gradient method is very popular in solving large-scale unconstrained minimization problems due to its simple iterative form and lower storage requirement. In the recent years, it was successfully extended to solve higher-dimension monotone nonlinear equations. Nevertheless, the research activities on conjugate gradient method in symmetric equations are just beginning. This study aims to developing, analyzing, and validating a family of nonlinear conjugate gradient methods for symmetric equations. The proposed algorithms are based on the latest, and state-of-the-art descent conjugate gradient methods for unconstrained minimization. The series of proposed methods are derivative-free, where the Jacobian information is needless at the full iteration process. We prove that the proposed methods converge globally under some appropriate conditions. Numerical results with differentiable parameter’s values and performance comparisons with another solver CGD to demonstrate the superiority and effectiveness of the proposed algorithms are reported.
PubDate: 2015-08-01

• A proximal alternating direction method of multipliers for a minimization
problem with nonconvex constraints
• Abstract: Abstract In this paper, a proximal alternating direction method of multipliers is proposed for solving a minimization problem with Lipschitz nonconvex constraints. Such problems are raised in many engineering fields, such as the analytical global placement of very large scale integrated circuit design. The proposed method is essentially a new application of the classical proximal alternating direction method of multipliers. We prove that, under some suitable conditions, any subsequence of the sequence generated by the proposed method globally converges to a Karush–Kuhn–Tucker point of the problem. We also present a practical implementation of the method using a certain self-adaptive rule of the proximal parameters. The proposed method is used as a global placement method in a placer of very large scale integrated circuit design. Preliminary numerical results indicate that, compared with some state-of-the-art global placement methods, the proposed method is applicable and efficient.
PubDate: 2015-08-01

• A box-constrained differentiable penalty method for nonlinear
complementarity problems
• Abstract: Abstract In this paper, we propose a box-constrained differentiable penalty method for nonlinear complementarity problems, which not only inherits the same convergence rate as the existing $$\ell _\frac{1}{p}$$ -penalty method but also overcomes its disadvantage of non-Lipschitzianness. We introduce the concept of a uniform $$\xi$$ – $$P$$ -function with $$\xi \in (1,2]$$ , and apply it to prove that the solution of box-constrained penalized equations converges to that of the original problem at an exponential order. Instead of solving the box-constrained penalized equations directly, we solve a corresponding differentiable least squares problem by using a trust-region Gauss–Newton method. Furthermore, we establish the connection between the local solution of the least squares problem and that of the original problem under mild conditions. We carry out the numerical experiments on the test problems from MCPLIB, and show that the proposed method is efficient and robust.
PubDate: 2015-08-01

• Parameter identification for a nonlinear enzyme-catalytic dynamic system
with time-delays
• Abstract: Abstract In this paper, we consider a nonlinear enzyme-catalytic dynamical system with uncertain system parameters and state-delays for describing the process of batch culture. Some important properties of the time-delay system are discussed. Taking account of the difficulty in accurately measuring the concentrations of intracellular substances and the absence of equilibrium points for the time-delay system, we define quantitatively biological robustness of the intracellular substance concentrations for the entire process of batch culture to identify the uncertain system parameters and state-delays. Taking the defined biological robustness as a cost function, we establish an identification model subject to the time-delay system, continuous state inequality constraints and parameter constraints. By a penalty approach, this model can be converted into a sequence of nonlinear programming submodels. In consideration of both the difficulty in finding analytical solutions and the complexity of numerical solution to the nonlinear system, based on an improved simulated annealing, we develop a parallelized synchronous algorithm to solve these nonlinear programming submodels. An illustrative numerical example shows the appropriateness of the optimal system parameters and state-delays as well as the validity of the parallel algorithm.
PubDate: 2015-08-01

• On optimal low rank Tucker approximation for tensors: the case for an
• Abstract: Abstract Approximating high order tensors by low Tucker-rank tensors have applications in psychometrics, chemometrics, computer vision, biomedical informatics, among others. Traditionally, solution methods for finding a low Tucker-rank approximation presume that the size of the core tensor is specified in advance, which may not be a realistic assumption in many applications. In this paper we propose a new computational model where the configuration and the size of the core become a part of the decisions to be optimized. Our approach is based on the so-called maximum block improvement method for non-convex block optimization. Numerical tests on various real data sets from gene expression analysis and image compression are reported, which show promising performances of the proposed algorithms.
PubDate: 2015-08-01

• Duality and robust duality for special nonconvex homogeneous quadratic
programming under certainty and uncertainty environment
• Abstract: Abstract In this paper, we discuss a kind of special nonconvex homogenous quadratic programming (HQP) and the methods to solve the HQP in an environment with certainty or uncertainty. In an environment with certainty, we first establish a strong duality between the HQP and its Lagrange dual problem, with the help of the fact that the Lagrange dual problem is equivalent to a convex semidefinite programming (SDP). Then we obtain a global solution to the HQP by solving the convex SDP. Furthermore, in an environment with uncertainty, we formulate the robust counterpart of the HQP to cope with uncertainty. We also establish the robust strong duality between the robust counterpart and its optimistic counterpart under a mild assumption. Since the counterpart is equivalent to a convex SDP under the same assumption, we can obtain a global solution to the robust counterpart by solving the convex SDP under the same assumption.
PubDate: 2015-08-01

• Smoothing augmented Lagrangian method for nonsmooth constrained
optimization problems
• Abstract: Abstract In this paper, we propose a smoothing augmented Lagrangian method for finding a stationary point of a nonsmooth and nonconvex optimization problem. We show that any accumulation point of the iteration sequence generated by the algorithm is a stationary point provided that the penalty parameters are bounded. Furthermore, we show that a weak version of the generalized Mangasarian Fromovitz constraint qualification (GMFCQ) at the accumulation point is a sufficient condition for the boundedness of the penalty parameters. Since the weak GMFCQ may be strictly weaker than the GMFCQ, our algorithm is applicable for an optimization problem for which the GMFCQ does not hold. Numerical experiments show that the algorithm is efficient for finding stationary points of general nonsmooth and nonconvex optimization problems, including the bilevel program which will never satisfy the GMFCQ.
PubDate: 2015-08-01

• A polynomial case of convex integer quadratic programming problems with
box integer constraints
• Abstract: Abstract In this paper, we study a special class of convex quadratic integer programming problem with box constraints. By using the decomposition approach, we propose a fixed parameter polynomial time algorithm for such a class of problems. Given a problem with size $$n$$ being the number of decision variables and $$m$$ being the possible integer values of each decision variable, if the $$n-k$$ largest eigenvalues of the quadratic coefficient matrix in the objective function are identical for some $$k$$ $$(0<k<n)$$ , we can construct a solution algorithm with a computational complexity of $${\mathcal {O}}((mn)^k)$$ . To achieve such complexity, we decompose the original problem into several convex quadratic programming problems, where the total number of the subproblems is bounded by the number of cells generated by a set of hyperplane arrangements in $$\mathbb {R}^k$$ space, which can be efficiently identified by cell enumeration algorithm.
PubDate: 2015-08-01

• The retailer’s optimal decision on order quantity and credit periods
under two-level trade credit policy
• 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: 2015-08-01

• Fast algorithm for color texture image inpainting using the non-local CTV
model
• Abstract: Abstract The classical non-local Total Variation model has been extensively used for gray texture image inpainting previously, but such model can not be directly applied to color texture image inpainting due to coupling of different image channels in color images. In order to solve the inpainting problem for color texture images effectively, we propose a non-local Color Total Variation model. This model is different from the recently proposed non-local Mumford–Shah model (NL-MS). Technically, the proposed model is an extension of local TV model for gray images but we take account of the relationship between different channels in color images and make use of concepts of the non-local operators. We will analyze how the coupling of different channels of color images in the proposed model makes the problem difficult for numerical implementation with the conventional split Bregman algorithm. In order to solve the proposed model efficiently, we propose a fast heuristic numerical algorithm based on the split Bregman algorithm with introduction of a threshold function. The performance of the proposed model with the proposed heuristic algorithm is compared with the NL-MS model. Extensive numerical experiments have shown that the proposed model and algorithm have superior excellent performance as well as with much faster speed.
PubDate: 2015-08-01

• Global optimality conditions and optimization methods for polynomial
programming problems
• Abstract: Abstract This paper is concerned with the general polynomial programming problem with box constraints, including global optimality conditions and optimization methods. First, a necessary global optimality condition for a general polynomial programming problem with box constraints is given. Then we design a local optimization method by using the necessary global optimality condition to obtain some strongly or $$\varepsilon$$ -strongly local minimizers which substantially improve some KKT points. Finally, a global optimization method, by combining the new local optimization method and an auxiliary function, is designed. Numerical examples show that our methods are efficient and stable.
PubDate: 2015-08-01

• A new alternating direction method for linearly constrained nonconvex
optimization problems
• Abstract: Abstract In this paper, we study the classical nonconvex linearly constrained optimization problem. Under some mild conditions, we obtain that the penalization sequence is nonincreasing and the sequence generated by our algorithm has finite length. Based on the assumption that the objective functions have Kurdyka–Lojasiewicz property, we prove the convergence of the algorithm. We also show the numerical efficiency of our method by the concrete applications in the areas of image processing and statistics.
PubDate: 2015-08-01

• A penalty approach to a discretized double obstacle problem with
derivative constraints
• Abstract: Abstract This work presents a penalty approach to a nonlinear optimization problem with linear box constraints arising from the discretization of an infinite-dimensional differential obstacle problem with bound constraints on derivatives. In this approach, we first propose a penalty equation approximating the mixed nonlinear complementarity problem representing the Karush–Kuhn–Tucker conditions of the optimization problem. We then show that the solution to the penalty equation converges to that of the complementarity problem with an exponential convergence rate depending on the parameters used in the equation. Numerical experiments, carried out on a non-trivial test problem to verify the theoretical finding, show that the computed rates of convergence match the theoretical ones well.
PubDate: 2015-08-01

• Some interesting properties for zero-forcing beamforming under per-antenna
power constraints in rural areas
• Abstract: Abstract Providing broadband services in the rural area is a challenging work. Multi-user multiple-input multiple-output (MU-MIMO) systems can be applied to increase spectral efficiency. One of the most commonly used method in MU-MIMO broadcast channel is zero-forcing beamforming (ZFBF) since it provides a good trade off between complexity and performance. In this paper, we consider the ZFBF under the per-antenna power constraints. Particularly, a deterministic line-of-sight modeling of the downlink channels is adopted. To reduce the computational complexity, we consider the problem in which all the equality constraints are eliminated. By examining the KKT optimality conditions and the properties of the channel, some interesting properties are revealed.
PubDate: 2015-08-01

• Normalized multiparametric disaggregation: an efficient relaxation for
mixed-integer bilinear problems
• Abstract: Abstract A key element for the global optimization of non-convex mixed-integer bilinear problems is the computation of a tight lower bound for the objective function being minimized. Multiparametric disaggregation is a technique for generating a mixed-integer linear relaxation of a bilinear problem that works by discretizing the domain of one of the variables in every bilinear term according to a numeric representation system. This can be done up to a certain accuracy level that can be different for each discretized variable so as to adjust the number of significant digits to their range of values and give all variables the same importance. We now propose a normalized formulation (NMDT) that achieves the same goal using a common setting for all variables, which is equivalent to the number of uniform partitions in a closely related, piecewise McCormick (PCM) approach. Through the solution of several benchmark problems from the literature involving four distinct problem classes, we show that the computational performance of NMDT is already better than PCM for ten partitions, with the difference rising quickly due to the logarithmic versus linear growth in the number of binary variables with the number of partitions. The results also show that a global optimization solver based on the proposed relaxation compares favorably with commercial solvers BARON and GloMIQO.
PubDate: 2015-07-30

• Quasi-phi-functions and optimal packing of ellipses
• Abstract: Abstract We further develop our phi-function technique for solving Cutting and Packing problems. Here we introduce quasi-phi-functions for an analytical description of non-overlapping and containment constraints for 2D- and 3D-objects which can be continuously rotated and translated. These new functions can work well for various types of objects, such as ellipses, for which ordinary phi-functions are too complicated or have not been constructed yet. We also define normalized quasi-phi-functions and pseudonormalized quasi-phi-functions for modeling distance constraints. To show the advantages of our new quasi-phi-functions we apply them to the problem of placing a given collection of ellipses into a rectangular container of minimal area. We use radical free quasi-phi-functions to reduce it to a nonlinear programming problem and develop an efficient solution algorithm. We present computational results that compare favourably with those published elsewhere recently.
PubDate: 2015-07-24

• A branch-and-bound multi-parametric programming approach for non-convex
multilevel optimization with polyhedral constraints
• Abstract: Abstract In this paper we develop a general but smooth global optimization strategy for nonlinear multilevel programming problems with polyhedral constraints. At each decision level successive convex relaxations are applied over the non-convex terms in combination with a multi-parametric programming approach. The proposed algorithm reaches the approximate global optimum in a finite number of steps through the successive subdivision of the optimization variables that contribute to the non-convexity of the problem and partitioning of the parameter space. The method is implemented and tested for a variety of bilevel, trilevel and fifth level problems which have non-convexity formulation at their inner levels.
PubDate: 2015-07-23

• Special issue on “optimization and optimal control with
applications” for the 9th international conference on optimization:
techniques and applications (9th ICOTA), December 12–16, 2013,
Taipei, Taiwan
• PubDate: 2015-07-11

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