Subjects -> MATHEMATICS (Total: 1061 journals)
    - APPLIED MATHEMATICS (86 journals)
    - GEOMETRY AND TOPOLOGY (23 journals)
    - MATHEMATICS (783 journals)
    - MATHEMATICS (GENERAL) (43 journals)
    - NUMERICAL ANALYSIS (23 journals)
    - PROBABILITIES AND MATH STATISTICS (103 journals)

MATHEMATICS (783 journals)            First | 1 2 3 4     

Showing 401 - 538 of 538 Journals sorted alphabetically
Journal of Function Spaces     Open Access  
Journal of Functional Analysis     Full-text available via subscription   (Followers: 2)
Journal of Geochemical Exploration     Hybrid Journal   (Followers: 1)
Journal of Geological Research     Open Access   (Followers: 1)
Journal of Geovisualization and Spatial Analysis     Hybrid Journal  
Journal of Global Optimization     Hybrid Journal   (Followers: 6)
Journal of Global Research in Mathematical Archives     Open Access   (Followers: 1)
Journal of Group Theory     Hybrid Journal   (Followers: 2)
Journal of Homotopy and Related Structures     Hybrid Journal  
Journal of Honai Math     Open Access  
Journal of Humanistic Mathematics     Open Access   (Followers: 1)
Journal of Hyperbolic Differential Equations     Hybrid Journal  
Journal of Indian Council of Philosophical Research     Hybrid Journal  
Journal of Industrial Mathematics     Open Access   (Followers: 2)
Journal of Inequalities and Applications     Open Access  
Journal of Infrared, Millimeter and Terahertz Waves     Hybrid Journal   (Followers: 2)
Journal of Integrable Systems     Open Access   (Followers: 1)
Journal of K-Theory     Full-text available via subscription  
Journal of Knot Theory and Its Ramifications     Hybrid Journal   (Followers: 1)
Journal of Kufa for Mathematics and Computer     Open Access   (Followers: 1)
Journal of Liquid Chromatography & Related Technologies     Hybrid Journal   (Followers: 7)
Journal of Logical and Algebraic Methods in Programming     Hybrid Journal  
Journal of Manufacturing Systems     Full-text available via subscription   (Followers: 4)
Journal of Mathematical Analysis and Applications     Full-text available via subscription   (Followers: 4)
Journal of mathematical and computational science     Open Access   (Followers: 7)
Journal of Mathematical and Fundamental Sciences     Open Access  
Journal of Mathematical Behavior     Hybrid Journal   (Followers: 2)
Journal of Mathematical Chemistry     Hybrid Journal   (Followers: 3)
Journal of Mathematical Cryptology     Hybrid Journal   (Followers: 1)
Journal of Mathematical Extension     Open Access   (Followers: 3)
Journal of Mathematical Finance     Open Access   (Followers: 7)
Journal of Mathematical Imaging and Vision     Hybrid Journal   (Followers: 6)
Journal of Mathematical Logic     Hybrid Journal   (Followers: 2)
Journal of Mathematical Modelling and Algorithms     Hybrid Journal   (Followers: 1)
Journal of Mathematical Neuroscience     Open Access   (Followers: 9)
Journal of Mathematical Sciences     Hybrid Journal  
Journal of Mathematical Sciences and Applications     Open Access   (Followers: 2)
Journal of Mathematical Sociology     Hybrid Journal   (Followers: 3)
Journal of Mathematics     Open Access  
Journal of Mathematics and Statistics     Open Access   (Followers: 8)
Journal of Mathematics and the Arts     Hybrid Journal   (Followers: 2)
Journal of Mathematics in Industry     Open Access   (Followers: 1)
Journal of Mathematics Research     Open Access   (Followers: 7)
Journal of Metallurgy     Open Access   (Followers: 7)
Journal of Modern Mathematics Frontier     Open Access  
Journal of Multidisciplinary Modeling and Optimization     Open Access  
Journal of Multivariate Analysis     Hybrid Journal   (Followers: 13)
Journal of Natural Sciences and Mathematics Research     Open Access  
Journal of Nonlinear Analysis and Optimization : Theory & Applications     Open Access   (Followers: 4)
Journal of Nonlinear Mathematical Physics     Hybrid Journal   (Followers: 1)
Journal of Nonlinear Science     Hybrid Journal   (Followers: 1)
Journal of Numerical Cognition     Open Access  
Journal of Numerical Mathematics     Hybrid Journal   (Followers: 2)
Journal of Optimization     Open Access   (Followers: 4)
Journal of Peridynamics and Nonlocal Modeling     Hybrid Journal  
Journal of Problem Solving     Open Access   (Followers: 2)
Journal of Progressive Research in Mathematics     Open Access   (Followers: 1)
Journal of Pseudo-Differential Operators and Applications     Hybrid Journal  
Journal of Pure and Applied Algebra     Full-text available via subscription   (Followers: 4)
Journal of Quantitative Analysis in Sports     Hybrid Journal   (Followers: 8)
Journal of Quantitative Linguistics     Hybrid Journal   (Followers: 6)
Journal of Scientific Computing     Hybrid Journal   (Followers: 18)
Journal of Scientific Research     Open Access  
Journal of Symbolic Computation     Hybrid Journal   (Followers: 1)
Journal of the Australian Mathematical Society     Full-text available via subscription  
Journal of the Egyptian Mathematical Society     Open Access  
Journal of the European Mathematical Society     Full-text available via subscription   (Followers: 1)
Journal of the Indian Mathematical Society     Hybrid Journal   (Followers: 1)
Journal of the Institute of Mathematics of Jussieu     Hybrid Journal  
Journal of the London Mathematical Society     Hybrid Journal   (Followers: 2)
Journal of the Nigerian Mathematical Society     Open Access   (Followers: 1)
Journal of Theoretical and Applied Physics     Open Access   (Followers: 8)
Journal of Topology and Analysis     Hybrid Journal  
Journal of Transport and Supply Chain Management     Open Access   (Followers: 14)
Journal of Turbulence     Hybrid Journal   (Followers: 7)
Journal of Uncertainty Analysis and Applications     Open Access  
Journal of Universal Mathematics     Open Access  
Journal of Urban Regeneration & Renewal     Full-text available via subscription   (Followers: 10)
Journal of Water and Land Development     Open Access   (Followers: 3)
JRAMathEdu : Journal of Research and Advances in Mathematics Education     Open Access   (Followers: 4)
JURING (Journal for Research in Mathematics Learning)     Open Access   (Followers: 1)
Jurnal Ilmiah AdMathEdu     Open Access  
Jurnal Matematika     Open Access   (Followers: 1)
Jurnal Matematika Integratif     Open Access  
Jurnal Matematika, Sains, Dan Teknologi     Open Access  
Jurnal Natural     Open Access  
Jurnal Pendidikan Matematika Raflesia     Open Access  
Jurnal Penelitian Pembelajaran Matematika Sekolah     Open Access  
Jurnal Penelitian Sains (JPS)     Open Access  
Jurnal Riset Pendidikan Matematika     Open Access  
Jurnal Sains Matematika dan Statistika     Open Access  
Jurnal Tadris Matematika     Open Access  
Jurnal Teknologi dan Sistem Komputer     Open Access  
Kreano, Jurnal Matematika Kreatif-Inovatif     Open Access   (Followers: 5)
Le Matematiche     Open Access  
Learning and Teaching Mathematics     Full-text available via subscription   (Followers: 7)
Lettera Matematica     Hybrid Journal  
Limits : Journal of Mathematics and Its Applications     Open Access   (Followers: 1)
Linear Algebra and its Applications     Full-text available via subscription   (Followers: 22)
Linear and Multilinear Algebra     Hybrid Journal   (Followers: 8)
Lithuanian Mathematical Journal     Hybrid Journal  
LMS Journal of Computation and Mathematics     Free  
Lobachevskii Journal of Mathematics     Open Access  
Logic and Analysis     Hybrid Journal  
Logic Journal of the IGPL     Hybrid Journal  
Logica Universalis     Hybrid Journal  
manuscripta mathematica     Hybrid Journal  
MaPan : Jurnal Matematika dan Pembelajaran     Open Access  
Marine Genomics     Hybrid Journal   (Followers: 2)
Matemáticas, Educación y Sociedad     Open Access  
Matematicheskie Zametki     Full-text available via subscription  
Matematika     Open Access  
Matematychni Studii     Open Access  
Mathematica Eterna     Open Access  
Mathematica Scandinavica     Open Access   (Followers: 1)
Mathematica Slovaca     Hybrid Journal   (Followers: 1)
Mathematical and Computational Forestry & Natural-Resource Sciences     Free  
Mathematical Communications     Open Access  
Mathematical Computation     Open Access   (Followers: 1)
Mathematical Geosciences     Hybrid Journal   (Followers: 3)
Mathematical Medicine and Biology: A Journal of the IMA     Hybrid Journal   (Followers: 1)
Mathematical Methods in the Applied Sciences     Hybrid Journal   (Followers: 4)
Mathematical Methods of Statistics     Hybrid Journal   (Followers: 4)
Mathematical Modelling and Analysis     Open Access   (Followers: 1)
Mathematical Modelling in Civil Engineering     Open Access   (Followers: 5)
Mathematical Modelling of Natural Phenomena     Full-text available via subscription   (Followers: 1)
Mathematical Models and Methods in Applied Sciences     Hybrid Journal   (Followers: 2)
Mathematical Notes     Hybrid Journal  
Mathematical Proceedings of the Cambridge Philosophical Society     Full-text available via subscription   (Followers: 1)
Mathematical Programming Computation     Hybrid Journal   (Followers: 3)
Mathematical Sciences     Open Access  
Mathematical Social Sciences     Hybrid Journal   (Followers: 1)
Mathematical Theory and Modeling     Open Access   (Followers: 13)
Mathematical Thinking and Learning     Hybrid Journal   (Followers: 3)
Mathematics and Statistics     Open Access   (Followers: 5)
Mathematics Education Journal     Open Access   (Followers: 1)
Mathematics Education Research Journal     Partially Free   (Followers: 17)
Mathematics in Science and Engineering     Full-text available via subscription  
Mathematics of Control, Signals, and Systems (MCSS)     Hybrid Journal   (Followers: 5)
Mathematics of Quantum and Nano Technologies     Open Access  
Mathématiques et sciences humaines     Open Access   (Followers: 7)
Mathematische Annalen     Hybrid Journal   (Followers: 1)
Mathematische Nachrichten     Hybrid Journal   (Followers: 1)
Mathematische Semesterberichte     Hybrid Journal  
Mathematische Zeitschrift     Hybrid Journal   (Followers: 1)
MATI : Mathematical Aspects of Topological Indeces     Open Access  
MATICS     Open Access   (Followers: 2)
Matrix Science Mathematic     Open Access   (Followers: 1)
Measurement Science Review     Open Access   (Followers: 3)
Mediterranean Journal of Mathematics     Hybrid Journal  
Memetic Computing     Hybrid Journal  
Mendel : Soft Computing Journal     Open Access  
Metaheuristics     Hybrid Journal  
Metals and Materials International     Hybrid Journal  
Metascience     Hybrid Journal   (Followers: 1)
Milan Journal of Mathematics     Hybrid Journal  
Mitteilungen der DMV     Hybrid Journal  
MLQ- Mathematical Logic Quarterly     Hybrid Journal  
Monatshefte fur Mathematik     Hybrid Journal  
Moroccan Journal of Pure and Applied Analysis     Open Access   (Followers: 4)
Moscow University Mathematics Bulletin     Hybrid Journal  
MSOR Connections     Open Access   (Followers: 1)
Multiscale Modeling and Simulation     Hybrid Journal   (Followers: 3)
MUST : Journal of Mathematics Education, Science and Technology     Open Access   (Followers: 1)
Nagoya Mathematical Journal     Hybrid Journal  
Nano Research     Hybrid Journal   (Followers: 3)
Nanotechnologies in Russia     Hybrid Journal   (Followers: 1)
Natural Resource Modeling     Hybrid Journal  
New Mathematics and Natural Computation     Hybrid Journal  
Nonlinear Analysis : Modelling and Control     Open Access   (Followers: 1)
Nonlinear Analysis : Theory, Methods & Applications     Hybrid Journal   (Followers: 1)
Nonlinear Analysis: Hybrid Systems     Hybrid Journal  
Nonlinear Analysis: Real World Applications     Hybrid Journal   (Followers: 2)
Nonlinear Differential Equations and Applications NoDEA     Hybrid Journal  
Nonlinear Engineering     Open Access  
Nonlinear Oscillations     Hybrid Journal   (Followers: 1)
North Carolina Journal of Mathematics and Statistics     Open Access  
North-Holland Mathematical Library     Full-text available via subscription   (Followers: 1)
North-Holland Mathematics Studies     Full-text available via subscription  
North-Holland Series in Applied Mathematics and Mechanics     Full-text available via subscription   (Followers: 1)
Note di Matematica     Open Access  
NTM Zeitschrift für Geschichte der Wissenschaften, Technik und Medizin     Hybrid Journal   (Followers: 4)
Numeracy : Advancing Education in Quantitative Literacy     Open Access  
Numerical Analysis and Applications     Hybrid Journal   (Followers: 1)
Numerical Functional Analysis and Optimization     Hybrid Journal   (Followers: 2)
Numerical Linear Algebra with Applications     Hybrid Journal   (Followers: 6)
Numerical Mathematics : Theory, Methods and Applications     Full-text available via subscription  
Numerische Mathematik     Hybrid Journal  
Open Journal of Discrete Mathematics     Open Access   (Followers: 5)
Open Journal of Modelling and Simulation     Open Access   (Followers: 1)
Open Mathematics     Open Access   (Followers: 1)
Operations Research Letters     Hybrid Journal   (Followers: 11)
Optimization Letters     Hybrid Journal   (Followers: 2)
Optimization Methods and Software     Hybrid Journal   (Followers: 8)
Opuscula Mathematica     Open Access   (Followers: 108)
Order     Hybrid Journal  
ORiON     Open Access  
P-Adic Numbers, Ultrametric Analysis, and Applications     Hybrid Journal  
PAMM : Proceedings in Applied Mathematics and Mechanics     Free   (Followers: 1)
Parallel Processing Letters     Hybrid Journal   (Followers: 3)

  First | 1 2 3 4     

Similar Journals
Journal Cover
Journal of Global Optimization
Journal Prestige (SJR): 1.311
Citation Impact (citeScore): 2
Number of Followers: 6  
 
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 1573-2916 - ISSN (Online) 0925-5001
Published by Springer-Verlag Homepage  [2570 journals]
  • Optimality conditions for optimal impulsive control problems with
           multipoint state constraints
    • Abstract: Abstract This paper addresses an optimal impulsive control problem whose trajectories are functions of bounded variation and impulsive controls are regular vector measures. This problem is characterized by two main features. First, the dynamical control system to be considered may not possess the so-called well-posedness property. Second, the constraints on the one-sided limits of states are presented. Such constraints are interpreted as multipoint state constraints. For this problem, we derive global optimality conditions based on using of compound Lyapunov type functions which possess strongly monotone properties with respect to the control system. As a motivating case, a model of advertising expenses optimization for mutually complementary products is considered. For this model, we propose four variants of resolving sets of Lyapunov type functions and explain the technique of applying the optimality conditions.
      PubDate: 2020-01-16
       
  • Improved metaheuristics for the quartet method of hierarchical clustering
    • Abstract: Abstract The quartet method is a novel hierarchical clustering approach where, given a set of n data objects and their pairwise dissimilarities, the aim is to construct an optimal tree from the total number of possible combinations of quartet topologies on n, where optimality means that the sum of the dissimilarities of the embedded (or consistent) quartet topologies is minimal. This corresponds to an NP-hard combinatorial optimization problem, also referred to as minimum quartet tree cost (MQTC) problem. We provide details and formulation of this challenging problem, and propose a basic greedy heuristic that is characterized by some appealing insights and findings for speeding up and simplifying the processes of solution generation and evaluation, such as the use of adjacency-like matrices to represent the topology structures of candidate solutions; fast calculation of coefficients and weights of the solution matrices; shortcuts in the enumeration of all solution permutations for a given configuration; and an iterative distance matrix reduction procedure, which greedily merges together highly connected objects which may bring lower values of the quartet cost function in a given partial solution. It will be shown that this basic greedy heuristic is able to improve consistently the performance of popular quartet clustering algorithms in the literature, namely a reduced variable neighbourhood search and a simulated annealing metaheuristic, producing novel efficient solution approaches to the MQTC problem.
      PubDate: 2020-01-13
       
  • An enhanced formulation for solving graph coloring problems with the
           Douglas–Rachford algorithm
    • Abstract: Abstract We study the behavior of the Douglas–Rachford algorithm on the graph vertex-coloring problem. Given a graph and a number of colors, the goal is to find a coloring of the vertices so that all adjacent vertex pairs have different colors. In spite of the combinatorial nature of this problem, the Douglas–Rachford algorithm was recently shown to be a successful heuristic for solving a wide variety of graph coloring instances, when the problem was cast as a feasibility problem on binary indicator variables. In this work we consider a different formulation, based on semidefinite programming. The much improved performance of the Douglas–Rachford algorithm, with this new approach, is demonstrated through various numerical experiments.
      PubDate: 2020-01-13
       
  • Linear conditioning, weak sharpness and finite convergence for equilibrium
           problems
    • Abstract: Abstract The present paper first provides sufficient conditions and characterizations for linearly conditioned bifunction associated with an equilibrium problem. It then introduces the notion of weak sharp solution for equilibrium problems which is analogous to the linear conditioning notion. This new notion generalizes and unifies the notion of weak sharp minima for optimization problems as well as the notion of weak sharp solutions for variational inequality problems. Some sufficient conditions and characterizations of weak sharpness are also presented. Finally, we study the finite convergence property of sequences generated by some algorithms for solving equilibrium problems under linear conditioning and weak shapness assumptions. An upper bound of the number of iterations by which the sequence generated by proximal point algorithm converges to a solution of equilibrium problems is also given.
      PubDate: 2020-01-10
       
  • Strategic decisions of sales and pay-per-use rentals under incomplete
           product availability
    • Abstract: Abstract Motivated by the fact that pay-per-use rentals require firms to be responsible for the the operational costs of products and service support network, we establish a pay-per-use rental model where a firm strategically sets the availability of products for rentals to achieve the trade-off between production quantity and operational costs. Furthermore, based on the traditional sale model, we also propose a combined model of sale and pay-per-use rental. The objective is to maximize firm’s profits under three models: the sale model, the pay-per-use rental model, and the hybrid model of sale and rental. The approach of backward induction is adopted to obtain the firm’s optimal decisions on pricing and production volume. Through comparative analysis, we provide the firm’s global optimal strategic solution, and the corresponding solutions in different market environments are developed, respectively, due to the variance of polling effects and costs. The results show that under the no-pooling case where customers’ requests overlap completely, the hybrid model always show higher profitability than the pay-per-use rental model, and it performs better than the sales model only when the per-unit operational and production costs are low. Under the perfect-pooling case where customers’ requests do not overlap, the hybrid model is always the optimal strategy. Numerical experiments are also conducted to illustrate the results under the general pooling case.
      PubDate: 2020-01-10
       
  • Multi-objective optimization models in finance and investments
    • PubDate: 2020-01-06
       
  • A residual-based algorithm for solving a class of structured nonsmooth
           optimization problems
    • Abstract: Abstract In this paper, we consider a class of structured nonsmooth optimization problem in which the first component of the objective is a smooth function while the second component is the sum of one-dimensional nonsmooth functions. We first verify that every minimizer of this problem is a solution of an equation \(h(x)=0\), where h is continuous but not differentiable, and moreover \(-h(x)\) is a descent direction of the objective at \(x\in \mathbb {R}^n\) if \(h(x)\ne 0\). Then by using \(-h(x)\) as a search direction, we propose a residual-based algorithm for solving this problem. Under proper conditions, we verify that any accumulation point of the sequence of iterates generated by our algorithm is a first-order stationary point of the problem. Additionally, we prove that the worst-case iteration-complexity for finding an \(\epsilon \) first-order stationary point is \(O(\epsilon ^{-2})\). Numerical results have shown the efficiency of this algorithm.
      PubDate: 2020-01-01
       
  • Strong duality in minimizing a quadratic form subject to two homogeneous
           quadratic inequalities over the unit sphere
    • Abstract: Abstract In this paper, we study the strong duality for an optimization problem to minimize a homogeneous quadratic function subject to two homogeneous quadratic constraints over the unit sphere, called Problem (P) in this paper. When a feasible (P) fails to have a Slater point, we show that (P) always adopts the strong duality. When (P) has a Slater point, we propose a set of conditions, called “Property J”, on an SDP relaxation of (P) and its conical dual. We show that (P) has the strong duality if and only if there exists at least one optimal solution to the SDP relaxation of (P) which fails Property J. Our techniques are based on various extensions of S-lemma as well as the matrix rank-one decomposition procedure introduced by Ai and Zhang. Many nontrivial examples are constructed to help understand the mechanism.
      PubDate: 2020-01-01
       
  • The decompositions with respect to two core non-symmetric cones
    • Abstract: Abstract It is known that the analysis to tackle with non-symmetric cone optimization is quite different from the way to deal with symmetric cone optimization due to the discrepancy between these types of cones. However, there are still common concepts for both optimization problems, for example, the decomposition with respect to the given cone, smooth and nonsmooth analysis for the associated conic function, conic-convexity, conic-monotonicity and etc. In this paper, motivated by Chares’s thesis (Cones and interior-point algorithms for structured convex optimization involving powers and exponentials, 2009), we consider the decomposition issue of two core non-symmetric cones, in which two types of decomposition formulae will be proposed, one is adapted from the well-known Moreau decomposition theorem and the other follows from geometry properties of the given cones. As a byproduct, we also establish the conic functions of these cones and generalize the power cone case to its high-dimensional counterpart.
      PubDate: 2020-01-01
       
  • New global optimality conditions for nonsmooth DC optimization problems
    • Abstract: Abstract In this article we propose a new approach to an analysis of DC optimization problems. This approach was largely inspired by codifferential calculus and the method of codifferential descent and is based on the use of a so-called affine support set of a convex function instead of the Frenchel conjugate function. With the use of affine support sets we define a global codifferential mapping of a DC function and derive new necessary and sufficient global optimality conditions for DC optimization problems. We also provide new simple necessary and sufficient conditions for the global exactness of the \(\ell _1\) penalty function for DC optimization problems with equality and inequality constraints and present a series of simple examples demonstrating a constructive nature of the new global optimality conditions. These examples show that when the optimality conditions are not satisfied, they can be easily utilised in order to find “global descent” directions of both constrained and unconstrained problems. As an interesting theoretical example, we apply our approach to the analysis of a nonsmooth problem of Bolza.
      PubDate: 2020-01-01
       
  • On the choice of the low-dimensional domain for global optimization via
           random embeddings
    • Abstract: Abstract The challenge of taking many variables into account in optimization problems may be overcome under the hypothesis of low effective dimensionality. Then, the search of solutions can be reduced to the random embedding of a low dimensional space into the original one, resulting in a more manageable optimization problem. Specifically, in the case of time consuming black-box functions and when the budget of evaluations is severely limited, global optimization with random embeddings appears as a sound alternative to random search. Yet, in the case of box constraints on the native variables, defining suitable bounds on a low dimensional domain appears to be complex. Indeed, a small search domain does not guarantee to find a solution even under restrictive hypotheses about the function, while a larger one may slow down convergence dramatically. Here we tackle the issue of low-dimensional domain selection based on a detailed study of the properties of the random embedding, giving insight on the aforementioned difficulties. In particular, we describe a minimal low-dimensional set in correspondence with the embedded search space. We additionally show that an alternative equivalent embedding procedure yields simultaneously a simpler definition of the low-dimensional minimal set and better properties in practice. Finally, the performance and robustness gains of the proposed enhancements for Bayesian optimization are illustrated on numerical examples.
      PubDate: 2020-01-01
       
  • Convex envelope of bivariate cubic functions over rectangular regions
    • Abstract: Abstract In recent years many papers have derived polyhedral and non-polyhedral convex envelopes for different classes of functions. Except for the univariate cases, all these classes of functions share the property that the generating set of their convex envelope is a subset of the border of the region over which the envelope is computed. In this paper we derive the convex envelope over a rectangular region for a class of functions which does not have this property, namely the class of bivariate cubic functions without univariate third-degree terms.
      PubDate: 2020-01-01
       
  • Solving k -center problems involving sets based on optimization techniques
    • Abstract: Abstract The continuous k-center problem aims at finding k balls with the smallest radius to cover a finite number of given points in \(\mathbb {R}^n\). In this paper, we propose and study the following generalized version of the k-center problem: Given a finite number of nonempty closed convex sets in \(\mathbb {R}^n\), find k balls with the smallest radius such that their union intersects all of the sets. Because of its nonsmoothness and nonconvexity, this problem is very challenging. Based on nonsmooth optimization techniques, we first derive some qualitative properties of the problem and then propose new algorithms to solve the problem. Numerical experiments are also provided to show the effectiveness of the proposed algorithms.
      PubDate: 2020-01-01
       
  • Steklov regularization and trajectory methods for univariate global
           optimization
    • Abstract: Abstract We introduce a new regularization technique, using what we refer to as the Steklov regularization function, and apply this technique to devise an algorithm that computes a global minimizer of univariate coercive functions. First, we show that the Steklov regularization convexifies a given univariate coercive function. Then, by using the regularization parameter as the independent variable, a trajectory is constructed on the surface generated by the Steklov function. For monic quartic polynomials, we prove that this trajectory does generate a global minimizer. In the process, we derive some properties of quartic polynomials. Comparisons are made with a previous approach which uses a quadratic regularization function. We carry out numerical experiments to illustrate the working of the new method on polynomials of various degree as well as a non-polynomial function.
      PubDate: 2020-01-01
       
  • Multimode resource-constrained project scheduling in flexible projects
    • Abstract: Abstract Flexible agile and extreme project management methods have become increasingly popular among practitioners, particularly in the IT and R&D sectors. In contrast to the theoretically and algorithmically well-established and developed trade-off and multimode methods applied in traditional project management methods, flexible project scheduling methods, which are applied in agile, hybrid, and especially extreme project management, lack a principled foundation and algorithmic handling. The aim of this paper is to fill this gap. We propose a matrix-based method that provides scores for alternative project plans that host flexible task dependencies and undecided, supplementary task completion while also handling the new but unplanned tasks. In addition, traditional multimode resource-constrained project scheduling problems are also covered. The proposed method can bridge the flexible and traditional approaches.
      PubDate: 2020-01-01
       
  • Order cancellation law in the family of bounded convex sets
    • Abstract: Abstract In this paper we prove necessary and sufficient criteria for a cancellation of a bounded convex set in the inclusion of Minkowski sums of sets. We also prove an order cancellation law in semigroups of not closed, bounded and convex sets.
      PubDate: 2019-12-19
       
  • Cooperative versus non-cooperative parallel variable neighborhood search
           strategies: a case study on the capacitated vehicle routing problem
    • Abstract: Abstract The capacitated vehicle routing problem (CVRP) is a well-known NP-hard combinatorial optimization problem with numerous real-world applications in logistics. In this work, we present a literature review with recent successful parallel implementations of variable neighborhood search regarding different variants of vehicle routing problems. We conduct an experimental study for the CVRP using well-known benchmark instances, and we present and investigate three parallelization strategies that coordinate the communication of the multiple processors. We experimentally evaluate a non-cooperative and two novel cooperation models, the managed cooperative and the parameterized cooperative strategies. Our results constitute a first proof-of-concept for the benefits of this new self-adaptive parameterized cooperative approach, especially in computationally hard instances.
      PubDate: 2019-12-12
       
  • An exact completely positive programming formulation for the discrete
           ordered median problem: an extended version
    • Abstract: Abstract This paper presents a first continuous, linear, conic formulation for the discrete ordered median problem (DOMP). Starting from a binary, quadratic formulation in the original space of location and allocation variables that are common in location analysis (L.A.), we prove that there exists a transformation of that formulation, using the same space of variables, that allows us to cast DOMP as a continuous, linear programming problem in the space of completely positive matrices. This is the first positive result that states equivalence between the family of continuous, convex problems and some hard combinatorial problems in L.A. The result is of theoretical interest because it allows us to share the tools from continuous optimization to shed new light into the difficult combinatorial structure of the class of ordered median problems that combines elements of the p-median, quadratic assignment and permutation polytopes.
      PubDate: 2019-12-09
       
  • Sequential characterizations of approximate solutions in convex vector
           optimization problems with set-valued maps
    • Abstract: Abstract This paper deals with a convex vector optimization problem with set-valued maps. In the absence of constraint qualifications, it provides, by the scalarization theorem, sequential Lagrange multiplier conditions characterizing approximate weak Pareto optimal solutions for the problem in terms of the approximate subdifferentials of the marginal function associated with corresponding set-valued maps. The paper shows also that this result yields the approximate Lagrange multiplier condition for the problem under a new constraint qualification which is weaker than the Slater-type constraint qualification. Illustrative examples are also provided to discuss the significance of the sequential conditions.
      PubDate: 2019-12-07
       
  • Optimality conditions for an exhausterable function on an exhausterable
           set
    • Abstract: Abstract Exhausters are families of convex compact sets that allow one to represent directional derivative of the studied function at a point in the form of InfMax or SupMin of linear functions. Functions for which such a representation is valid we call exhausterable. This class of functions is quite wide and contains many nonsmooth ones. The set of exhausterable function is also called exhausterable. In the present paper we describe optimality conditions for an exhausterable function on an exhausterable set. These conditions can be used for solving many nondifferentiable optimization problems. An example that illustrate obtained results is provided.
      PubDate: 2019-11-21
       
 
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
 


Your IP address: 35.175.201.14
 
Home (Search)
API
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-