for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> ENGINEERING (Total: 2096 journals)
    - CHEMICAL ENGINEERING (176 journals)
    - CIVIL ENGINEERING (161 journals)
    - ELECTRICAL ENGINEERING (88 journals)
    - ENGINEERING (1157 journals)
    - ENGINEERING MECHANICS AND MATERIALS (330 journals)
    - HYDRAULIC ENGINEERING (53 journals)
    - INDUSTRIAL ENGINEERING (52 journals)
    - MECHANICAL ENGINEERING (79 journals)

ENGINEERING (1157 journals)            First | 2 3 4 5 6 7 8 9 | Last

International Journal of Heavy Vehicle Systems     Hybrid Journal   (Followers: 6)
International Journal of Hypersonics     Full-text available via subscription   (Followers: 3)
International Journal of Imaging Systems and Technology     Hybrid Journal   (Followers: 2)
International Journal of Impact Engineering     Hybrid Journal   (Followers: 7)
International Journal of Information Acquisition     Hybrid Journal   (Followers: 1)
International Journal of Innovation and Applied Studies     Open Access   (Followers: 2)
International Journal of Innovation Science     Full-text available via subscription   (Followers: 6)
International Journal of Innovative Technology and Research     Open Access  
International Journal of Integrated Engineering     Open Access   (Followers: 1)
International Journal of Intelligent Engineering Informatics     Hybrid Journal  
International Journal of Intelligent Systems and Applications in Engineering     Open Access  
International Journal of Lifecycle Performance Engineering     Hybrid Journal   (Followers: 1)
International Journal of Machine Tools and Manufacture     Hybrid Journal   (Followers: 5)
International Journal of Manufacturing Research     Hybrid Journal   (Followers: 5)
International Journal of Manufacturing Technology and Management     Hybrid Journal   (Followers: 7)
International Journal of Materials and Product Technology     Hybrid Journal   (Followers: 4)
International Journal of Mathematical Education in Science and Technology     Hybrid Journal   (Followers: 7)
International Journal of Mathematics in Operational Research     Hybrid Journal   (Followers: 1)
International Journal of Medical Engineering and Informatics     Hybrid Journal   (Followers: 5)
International Journal of Micro Air Vehicles     Full-text available via subscription   (Followers: 4)
International Journal of Microwave and Wireless Technologies     Hybrid Journal   (Followers: 1)
International Journal of Microwave Science and Technology     Open Access   (Followers: 2)
International Journal of Mobile Network Design and Innovation     Hybrid Journal   (Followers: 3)
International Journal of Multiphase Flow     Hybrid Journal   (Followers: 2)
International Journal of Nanomanufacturing     Hybrid Journal   (Followers: 1)
International Journal of Nanoscience     Hybrid Journal   (Followers: 1)
International Journal of Nanotechnology     Hybrid Journal   (Followers: 5)
International Journal of Nanotechnology and Molecular Computation     Full-text available via subscription   (Followers: 3)
International Journal of Navigation and Observation     Open Access   (Followers: 6)
International Journal of Network Management     Hybrid Journal  
International Journal of Nonlinear Sciences and Numerical Simulation     Full-text available via subscription  
International Journal of Numerical Methods for Heat & Fluid Flow     Hybrid Journal   (Followers: 7)
International Journal of Optics     Open Access   (Followers: 1)
International Journal of Organisational Design and Engineering     Hybrid Journal   (Followers: 9)
International Journal of Pattern Recognition and Artificial Intelligence     Hybrid Journal   (Followers: 6)
International Journal of Pavement Engineering     Hybrid Journal   (Followers: 2)
International Journal of Physical Modelling in Geotechnics     Hybrid Journal   (Followers: 3)
International Journal of Plasticity     Hybrid Journal   (Followers: 6)
International Journal of Plastics Technology     Hybrid Journal  
International Journal of Polymer Analysis and Characterization     Hybrid Journal   (Followers: 5)
International Journal of Polymer Science     Open Access   (Followers: 16)
International Journal of Precision Engineering and Manufacturing     Hybrid Journal   (Followers: 5)
International Journal of Precision Engineering and Manufacturing-Green Technology     Hybrid Journal  
International Journal of Precision Technology     Hybrid Journal  
International Journal of Pressure Vessels and Piping     Hybrid Journal   (Followers: 3)
International Journal of Production Economics     Hybrid Journal   (Followers: 13)
International Journal of Quality and Innovation     Hybrid Journal   (Followers: 4)
International Journal of Quality Assurance in Engineering and Technology Education     Full-text available via subscription   (Followers: 2)
International Journal of Quality Engineering and Technology     Hybrid Journal   (Followers: 2)
International Journal of Quantum Information     Hybrid Journal  
International Journal of Rapid Manufacturing     Hybrid Journal   (Followers: 1)
International Journal of Reliability, Quality and Safety Engineering     Hybrid Journal   (Followers: 7)
International Journal of Renewable Energy Technology     Hybrid Journal   (Followers: 8)
International Journal of Robust and Nonlinear Control     Hybrid Journal   (Followers: 2)
International Journal of Science Engineering and Advance Technology     Open Access  
International Journal of Sediment Research     Full-text available via subscription   (Followers: 1)
International Journal of Self-Propagating High-Temperature Synthesis     Hybrid Journal   (Followers: 2)
International Journal of Signal and Imaging Systems Engineering     Hybrid Journal  
International Journal of Six Sigma and Competitive Advantage     Hybrid Journal  
International Journal of Social Robotics     Hybrid Journal   (Followers: 2)
International Journal of Software Engineering and Knowledge Engineering     Hybrid Journal   (Followers: 1)
International Journal of Space Science and Engineering     Hybrid Journal   (Followers: 2)
International Journal of Speech Technology     Hybrid Journal   (Followers: 4)
International Journal of Spray and Combustion Dynamics     Full-text available via subscription   (Followers: 6)
International Journal of Superconductivity     Open Access  
International Journal of Surface Engineering and Interdisciplinary Materials Science     Full-text available via subscription   (Followers: 1)
International Journal of Surface Science and Engineering     Hybrid Journal   (Followers: 7)
International Journal of Sustainable Engineering     Hybrid Journal   (Followers: 7)
International Journal of Sustainable Manufacturing     Hybrid Journal   (Followers: 4)
International Journal of Systems and Service-Oriented Engineering     Full-text available via subscription  
International Journal of Systems Assurance Engineering and Management     Hybrid Journal  
International Journal of Systems, Control and Communications     Hybrid Journal   (Followers: 2)
International Journal of Technoethics     Full-text available via subscription  
International Journal of Technology Management and Sustainable Development     Hybrid Journal   (Followers: 1)
International Journal of Technology Policy and Law     Hybrid Journal   (Followers: 4)
International Journal of Telemedicine and Applications     Open Access   (Followers: 2)
International Journal of Thermal Sciences     Hybrid Journal   (Followers: 7)
International Journal of Thermodynamics     Open Access   (Followers: 2)
International Journal of Turbo & Jet-Engines     Full-text available via subscription  
International Journal of Ultra Wideband Communications and Systems     Hybrid Journal  
International Journal of Vehicle Autonomous Systems     Hybrid Journal   (Followers: 1)
International Journal of Vehicle Design     Hybrid Journal   (Followers: 6)
International Journal of Vehicle Information and Communication Systems     Hybrid Journal   (Followers: 2)
International Journal of Vehicle Noise and Vibration     Hybrid Journal   (Followers: 3)
International Journal of Vehicle Safety     Hybrid Journal   (Followers: 5)
International Journal of Vehicular Technology     Open Access   (Followers: 2)
International Journal of Virtual Technology and Multimedia     Hybrid Journal   (Followers: 4)
International Journal of Wavelets, Multiresolution and Information Processing     Hybrid Journal  
International Journal on Artificial Intelligence Tools     Hybrid Journal   (Followers: 4)
International Nano Letters     Open Access   (Followers: 9)
International Review of Applied Sciences and Engineering     Full-text available via subscription  
Inverse Problems in Science and Engineering     Hybrid Journal   (Followers: 2)
Ionics     Hybrid Journal  
IPTEK The Journal for Technology and Science     Open Access  
IRBM News     Full-text available via subscription  
Ironmaking & Steelmaking     Hybrid Journal   (Followers: 2)
Irrigation and Drainage Systems     Hybrid Journal  
ISA Transactions     Full-text available via subscription   (Followers: 1)
ISRN - International Scholarly Research Notices     Open Access   (Followers: 68)
ISRN Nanotechnology     Open Access  

  First | 2 3 4 5 6 7 8 9 | Last

Journal Cover   Journal of Global Optimization
  [SJR: 0.919]   [H-I: 51]   [6 followers]  Follow
    
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1573-2916 - ISSN (Online) 0925-5001
   Published by Springer-Verlag Homepage  [2302 journals]
  • 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-03-19
       
  • On power penalty methods for linear complementarity problems arising from
           American option pricing
    • Abstract: Abstract Power penalty methods for solving a linear parabolic complementarity problem arising from American option pricing have attracted much attention. These methods require us to solve a series of systems of nonlinear equations (called penalized equations). In this paper, we first study the relationships among the solutions of penalized equations under appropriate conditions. Additionally, since these penalized equations are neither smooth nor convex, some existing algorithms, such as Newton method, cannot be applied directly to solve them. We shall apply the nonlinear Jacobian method to solve penalized equations and verify that the iteration sequence generated by the method converges monotonically to the solution of the penalized equation. Some numerical results confirm the theoretical results and the efficiency of the proposed algorithm.
      PubDate: 2015-03-17
       
  • Global optimization of expensive black box functions using potential
           Lipschitz constants and response surfaces
    • Abstract: Abstract This article develops a novel global optimization algorithm using potential Lipschitz constants and response surfaces (PLRS) for computationally expensive black box functions. With the usage of the metamodeling techniques, PLRS proposes a new approximate function \({\hat{F}}\) to describe the lower bounds of the real function \(f\) in a compact way, i.e., making the approximate function \({\hat{F}}\) closer to \(f\) . By adjusting a parameter \({\hat{K}}\) (an estimate of the Lipschitz constant \(K\) ), \({\hat{F}}\) could approximate \(f\) in a fine way to favor local exploitation in some interesting regions; \({\hat{F}}\) can also approximate \(f\) in a coarse way to favor global exploration over the entire domain. When doing optimization, PLRS cycles through a set of identified potential estimates of the Lipschitz constant to construct the approximate function from fine to coarse. Consequently, the optimization operates at both local and global levels. Comparative studies with several global optimization algorithms on 53 test functions and an engineering application indicate that the proposed algorithm is promising for expensive black box functions.
      PubDate: 2015-03-12
       
  • Population model-based optimization
    • Abstract: Abstract Model-based optimization methods are a class of stochastic search methods that iteratively find candidate solutions by generating samples from a parameterized probabilistic model on the solution space. In order to better capture the multi-modality of the objective functions than the traditional model-based methods which use only a single model, we propose a framework of using a population of models at every iteration with an adaptive mechanism to propagate the population over iterations. The adaptive mechanism is derived from estimating the optimal parameter of the probabilistic model in a Bayesian manner, and thus provides a proper way to determine the diversity in the population of the models. We provide theoretical justification on the convergence of this framework by showing that the posterior distribution of the parameter asymptotically converges to a degenerate distribution concentrating on the optimal parameter. Under this framework, we develop two practical algorithms by incorporating sequential Monte Carlo methods, and carry out numerical experiments to illustrate their performance.
      PubDate: 2015-03-12
       
  • 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-03-10
       
  • Augmented Lagrangian methods for nonlinear programming with possible
           infeasibility
    • Abstract: Abstract In this paper, we consider a nonlinear programming problem for which the constraint set may be infeasible. We propose an algorithm based on a large family of augmented Lagrangian functions and analyze its global convergence properties taking into account the possible infeasibility of the problem. We show that, in a finite number of iterations, the algorithm stops detecting the infeasibility of the problem or finds an approximate feasible/optimal solution with any required precision. We illustrate, by means of numerical experiments, that our algorithm is reliable for different Lagrangian/penalty functions proposed in the literature.
      PubDate: 2015-03-10
       
  • 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-03-06
       
  • 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-03-06
       
  • Second-order conditions for existence of augmented Lagrange multipliers
           for eigenvalue composite optimization problems
    • Abstract: Abstract In this paper, we mainly consider the augmented Lagrangian duality theory and explore second-order conditions for the existence of augmented Lagrange multipliers for eigenvalue composite optimization problems. In the approach, we reformulate the augmented Lagrangian introduced by Rockafellar into a new form in terms of the Moreau envelope function and characterize second-order conditions via the epi-derivatives of the augmented Lagrangian.
      PubDate: 2015-03-04
       
  • 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: 2015-03-01
       
  • 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: 2015-03-01
       
  • Scalarization in set optimization with solid and nonsolid ordering cones
    • Abstract: This paper focuses on characterizations via scalarization of several kinds of minimal solutions of set-valued optimization problems, where the objective values are compared through relations between sets (set optimization). For this aim we follow an axiomatic approach based on general order representation and order preservation properties, which works in any abstract set ordered by a quasi order (i.e., reflexive and transitive) relation. Then, following this approach, we study a recent Gerstewitz scalarization mapping for set-valued optimization problems with \(K\) -proper sets and a solid ordering cone \(K\) . In particular we show a dual minimax reformulation of this scalarization. Moreover, in the setting of normed spaces ordered by non necessarily solid ordering cones, we introduce a new scalarization functional based on the so-called oriented distance. Using these scalarization mappings, we obtain necessary and sufficient optimality conditions in set optimization. Finally, whenever the ordering cone is solid, by considering suitable generalized Chebyshev norms with appropriate parameters, we show that the three scalarizations studied in the present work are coincident.
      PubDate: 2015-03-01
       
  • Conic approximation to nonconvex quadratic programming with convex
           quadratic constraints
    • 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: 2015-03-01
       
  • Optimal clustering of a pair of irregular objects
    • Abstract: Abstract Cutting and packing problems arise in many fields of applications and theory. When dealing with irregular objects, an important subproblem is the identification of the optimal clustering of two objects. Within this paper we consider a container (rectangle, circle, convex polygon) of variable sizes and two irregular objects bounded by circular arcs and/or line segments, that can be continuously translated and rotated. In addition minimal allowable distances between objects and between each object and the frontier of a container, may be imposed. The objects should be arranged within a container such that a given objective will reach its minimal value. We consider a polynomial function as the objective, which depends on the variable parameters associated with the objects and the container. The paper presents a universal mathematical model and a solution strategy which are based on the concept of phi-functions and provide new benchmark instances of finding the containing region that has either minimal area, perimeter or homothetic coefficient of a given container, as well as finding the convex polygonal hull (or its approximation) of a pair of objects.
      PubDate: 2015-03-01
       
  • 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: 2015-03-01
       
  • Interactive model-based search for global optimization
    • Abstract: Abstract Single-thread algorithms for global optimization differ in the way computational effort between exploitation and exploration is allocated. This allocation ultimately determines overall performance. For example, if too little emphasis is put on exploration, the globally optimal solution may not be identified. Increasing the allocation of computational effort to exploration increases the chances of identifying a globally optimal solution but it also slows down convergence. Thus, in a single-thread implementation of model-based search exploration and exploitation are substitutes. In this paper we propose a new algorithmic design for global optimization based upon multiple interacting threads. In this design, each thread implements a model-based search in which the allocation of exploration versus exploitation effort does not vary over time. Threads interact through a simple acceptance-rejection rule preventing duplication of search efforts. We show the proposed design provides a speedup effect which is increasing in the number of threads. Thus, in the proposed algorithmic design, exploration is a complement rather than a substitute to exploitation.
      PubDate: 2015-03-01
       
  • Characterizations of efficient and weakly efficient points in nonconvex
           vector optimization
    • Abstract: Abstract In this paper, a class of nonconvex vector optimization problems with inequality constraints and a closed convex set constraint are considered. By means of Clarke derivatives and Clarke subdifferentials, a necessary and sufficient condition of weak efficiency and a sufficient criteria of efficiency are presented under suitable generalized convexity. A special case is discussed in finite dimensional space and an equivalent version of sufficient criteria of efficiency is obtained by means of Clarke derivative and linearizing cone. Some examples also are given to illustrate the main results.
      PubDate: 2015-03-01
       
  • Convergence analysis of inexact proximal point algorithms on Hadamard
           manifolds
    • Abstract: Abstract Inexact proximal point methods are extended to find singular points for multivalued vector fields on Hadamard manifolds. Convergence criteria are established under some mild conditions. In particular, in the case of proximal point algorithm, that is, \(\varepsilon _n=0\) for each \(n\) , our results improve sharply the corresponding results in Li et al. (2009). Applications to optimization problems, variational inequality problems and gradient methods are also given.
      PubDate: 2015-03-01
       
  • Constrained shortest path with uncertain transit times
    • Abstract: Abstract This paper is concerned with the constrained shortest path (CSP) problem, where in addition to the arc cost, a transit time is associated to each arc. The presence of uncertainty in transit times is a critical issue in a wide variety of world applications, such as telecommunication, traffic, and transportation. To capture this issue, we present tractable approaches for solving the CSP problem with uncertain transit times from the viewpoint of robust and stochastic optimization. To study robust CSP problem, two different uncertainty sets, \({\varGamma }\) -scenario and ellipsoidal, are considered. We show that the robust counterpart of the CSP problem under both uncertainty sets, can be efficiently solved. We further consider the CSP problem with random transit times and show that the problem can be solved by solving robust constrained shortest path problem under ellipsoidal uncertainty set. We present extensive computational results on a set of randomly generated networks. Our results demonstrate that with a reasonable extra cost, the robust optimal path preserves feasibility, in almost all scenarios under \({\varGamma }\) -scenario uncertainty set. The results also show that, in the most cases, the robust CSP problem under ellipsoidal uncertainty set is feasible.
      PubDate: 2015-02-21
       
  • 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-02-20
       
 
 
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
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2015