Subjects -> MATHEMATICS (Total: 1013 journals)
    - APPLIED MATHEMATICS (92 journals)
    - GEOMETRY AND TOPOLOGY (23 journals)
    - MATHEMATICS (714 journals)
    - MATHEMATICS (GENERAL) (45 journals)
    - NUMERICAL ANALYSIS (26 journals)
    - PROBABILITIES AND MATH STATISTICS (113 journals)

MATHEMATICS (714 journals)            First | 1 2 3 4     

Showing 401 - 538 of 538 Journals sorted alphabetically
Journal of mathematical and computational science     Open Access   (Followers: 2)
Journal of Mathematical and Fundamental Sciences     Open Access  
Journal of Mathematical Behavior     Hybrid Journal   (Followers: 6)
Journal of Mathematical Chemistry     Hybrid Journal   (Followers: 5)
Journal of Mathematical Finance     Open Access   (Followers: 6)
Journal of Mathematical Imaging and Vision     Hybrid Journal   (Followers: 6)
Journal of Mathematical Logic     Hybrid Journal   (Followers: 2)
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: 6)
Journal of Mathematics and Statistics Studies     Open Access  
Journal of Mathematics and the Arts     Hybrid Journal   (Followers: 1)
Journal of Mathematics Education at Teachers College     Open Access   (Followers: 5)
Journal of Mathematics in Industry     Open Access  
Journal of Mathematics Research     Open Access  
Journal of Metallurgy     Open Access   (Followers: 9)
Journal of Modern Mathematics Frontier     Open Access  
Journal of Multidisciplinary Modeling and Optimization     Open Access   (Followers: 1)
Journal of Multivariate Analysis     Hybrid Journal   (Followers: 15)
Journal of Nonlinear Analysis and Optimization : Theory & Applications     Open Access   (Followers: 4)
Journal of Nonlinear Mathematical Physics     Hybrid Journal   (Followers: 2)
Journal of Nonlinear Science     Hybrid Journal   (Followers: 1)
Journal of Numerical Cognition     Open Access   (Followers: 1)
Journal of Optimization     Open Access   (Followers: 5)
Journal of Peridynamics and Nonlocal Modeling     Hybrid Journal  
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: 3)
Journal of Quantitative Linguistics     Hybrid Journal   (Followers: 6)
Journal of Scientific Computing     Hybrid Journal   (Followers: 19)
Journal of Scientific Research     Open Access  
Journal of Symbolic Computation     Hybrid Journal   (Followers: 2)
Journal of the Australian Mathematical Society     Full-text available via subscription  
Journal of the Egyptian Mathematical Society     Open Access  
Journal of the Indian Mathematical Society     Hybrid Journal  
Journal of the Institute of Mathematics of Jussieu     Hybrid Journal  
Journal of the London Mathematical Society     Hybrid Journal   (Followers: 3)
Journal of the Nigerian Mathematical Society     Open Access  
Journal of Theoretical and Applied Physics     Open Access   (Followers: 9)
Journal of Topology and Analysis     Hybrid Journal  
Journal of Transport and Supply Chain Management     Open Access   (Followers: 10)
Journal of Turbulence     Hybrid Journal   (Followers: 7)
Journal of Universal Mathematics     Open Access  
Journal of Urban Regeneration & Renewal     Full-text available via subscription   (Followers: 8)
JRAMathEdu : Journal of Research and Advances in Mathematics Education     Open Access   (Followers: 5)
JUMLAHKU : Jurnal Matematika Ilmiah STKIP Muhammadiyah Kuningan     Open Access  
JURING (Journal for Research in Mathematics Learning)     Open Access  
Jurnal Didactical Mathematics     Open Access   (Followers: 5)
Jurnal Matematika     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  
Kontinu : Jurnal Penelitian Didaktik Matematika     Open Access  
Kreano, Jurnal Matematika Kreatif-Inovatif     Open Access  
Le Matematiche     Open Access  
Lettera Matematica     Hybrid Journal  
Lietuvos Matematikos Rinkinys     Open Access  
Limits : Journal of Mathematics and Its Applications     Open Access  
Linear Algebra and its Applications     Full-text available via subscription   (Followers: 22)
Linear and Multilinear Algebra     Hybrid Journal   (Followers: 7)
Lithuanian Mathematical Journal     Hybrid Journal  
Lobachevskii Journal of Mathematics     Open Access  
Logic Journal of the IGPL     Hybrid Journal   (Followers: 1)
Logica Universalis     Hybrid Journal  
manuscripta mathematica     Hybrid Journal   (Followers: 1)
MaPan : Jurnal Matematika dan Pembelajaran     Open Access  
Marine Genomics     Hybrid Journal   (Followers: 1)
Matemáticas, Educación y Sociedad     Open Access  
Matematicheskie Zametki     Full-text available via subscription  
Mathematica Scandinavica     Full-text available via subscription   (Followers: 1)
Mathematical Analysis and its Contemporary Applications     Open Access   (Followers: 1)
Mathematical Communications     Open Access  
Mathematical Computation     Open Access   (Followers: 1)
Mathematical Geosciences     Hybrid Journal   (Followers: 4)
Mathematical Journal of Interdisciplinary Sciences     Open Access   (Followers: 1)
Mathematical Medicine and Biology: A Journal of the IMA     Hybrid Journal   (Followers: 1)
Mathematical Methods in the Applied Sciences     Hybrid Journal   (Followers: 3)
Mathematical Methods of Statistics     Hybrid Journal   (Followers: 4)
Mathematical Modelling and Analysis     Open Access   (Followers: 1)
Mathematical Modelling of Natural Phenomena     Open Access   (Followers: 1)
Mathematical Models and Methods in Applied Sciences     Hybrid Journal   (Followers: 1)
Mathematical Notes     Hybrid Journal  
Mathematical Proceedings of the Cambridge Philosophical Society     Full-text available via subscription   (Followers: 2)
Mathematical Programming Computation     Hybrid Journal   (Followers: 2)
Mathematical Sciences     Open Access  
Mathematical Social Sciences     Hybrid Journal   (Followers: 1)
Mathematical Theory and Modeling     Open Access   (Followers: 6)
Mathematical Thinking and Learning     Hybrid Journal   (Followers: 4)
Mathematics and Statistics     Open Access   (Followers: 2)
Mathematics Education Forum Chitwan     Open Access   (Followers: 2)
Mathematics Education Journal     Open Access   (Followers: 4)
Mathematics Education Research Journal     Partially Free   (Followers: 16)
Mathematics of Control, Signals, and Systems (MCSS)     Hybrid Journal   (Followers: 5)
Mathematics Teacher: Learning and Teaching PK-12     Full-text available via subscription   (Followers: 9)
Mathematics Teaching in the Middle School     Full-text available via subscription   (Followers: 8)
Mathematische Annalen     Hybrid Journal   (Followers: 2)
Mathematische Nachrichten     Hybrid Journal   (Followers: 1)
Mathematische Semesterberichte     Hybrid Journal  
Mathematische Zeitschrift     Hybrid Journal   (Followers: 2)
MATICS     Open Access  
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   (Followers: 1)
Metascience     Hybrid Journal   (Followers: 1)
Metrology and Instruments / Метрологія та прилади     Open Access  
Milan Journal of Mathematics     Hybrid Journal  
MLQ- Mathematical Logic Quarterly     Hybrid Journal   (Followers: 1)
Modelling in Civil and Environmental Engineering     Open Access   (Followers: 4)
MONA : Matematik- og Naturfagsdidaktik     Hybrid Journal  
Monatshefte fur Mathematik     Hybrid Journal  
Moroccan Journal of Pure and Applied Analysis     Open Access  
Moscow University Mathematics Bulletin     Hybrid Journal  
MSOR Connections     Open Access   (Followers: 1)
Multiscale Modeling and Simulation     Hybrid Journal   (Followers: 2)
MUST : Journal of Mathematics Education, Science and Technology     Open Access   (Followers: 4)
Nagoya Mathematical Journal     Hybrid Journal   (Followers: 1)
Nano Research     Hybrid Journal   (Followers: 4)
Nanotechnologies in Russia     Hybrid Journal  
Natural Resource Modeling     Hybrid Journal  
New Mathematics and Natural Computation     Hybrid Journal   (Followers: 1)
Nonlinear Analysis     Hybrid Journal   (Followers: 1)
Nonlinear Analysis : Modelling and Control     Open Access   (Followers: 1)
Nonlinear Analysis: Hybrid Systems     Hybrid Journal  
Nonlinear Analysis: Real World Applications     Hybrid Journal   (Followers: 1)
Nonlinear Differential Equations and Applications NoDEA     Hybrid Journal  
North Carolina Journal of Mathematics and Statistics     Open Access  
Note di Matematica     Open Access  
NTM Zeitschrift für Geschichte der Wissenschaften, Technik und Medizin     Hybrid Journal   (Followers: 3)
Numeracy : Advancing Education in Quantitative Literacy     Open Access   (Followers: 1)
Numerical Analysis and Applications     Hybrid Journal   (Followers: 1)
Numerical Functional Analysis and Optimization     Hybrid Journal   (Followers: 3)
Numerical Linear Algebra with Applications     Hybrid Journal   (Followers: 7)
Numerische Mathematik     Hybrid Journal  
Open Journal of Discrete Mathematics     Open Access   (Followers: 3)
Open Journal of Modelling and Simulation     Open Access   (Followers: 2)
Operations Research Letters     Hybrid Journal   (Followers: 11)
Optimization Letters     Hybrid Journal   (Followers: 2)
Optimization Methods and Software     Hybrid Journal   (Followers: 6)
Opuscula Mathematica     Open Access  
Order     Hybrid Journal  
ORiON     Open Access  
P-Adic Numbers, Ultrametric Analysis, and Applications     Hybrid Journal  
PAMM : Proceedings in Applied Mathematics and Mechanics     Free  
Parallel Processing Letters     Hybrid Journal   (Followers: 3)
Peking Mathematical Journal     Hybrid Journal  
Periodica Mathematica Hungarica     Full-text available via subscription   (Followers: 1)
Petroleum Science     Open Access  
Philosophia Mathematica     Hybrid Journal   (Followers: 1)
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences     Full-text available via subscription   (Followers: 9)
PNA. Revista de Investigación en Didáctica de la Matemática     Open Access  
Polar Science     Hybrid Journal   (Followers: 3)
Positivity     Hybrid Journal  
Press Start     Open Access   (Followers: 1)
Prime Number     Full-text available via subscription  
Probability in the Engineering and Informational Sciences     Hybrid Journal   (Followers: 1)
Problemy Peredachi Informatsii     Full-text available via subscription  
Proceedings - Mathematical Sciences     Open Access   (Followers: 5)
Proceedings of the American Mathematical Society, Series B     Open Access   (Followers: 4)
Proceedings of the Edinburgh Mathematical Society     Hybrid Journal  
Proceedings of the Institution of Civil Engineers - Engineering and Computational Mechanics     Hybrid Journal   (Followers: 2)
Proceedings of the Latvian Academy of Sciences. Section B: Natural, Exact and Applied Sciences     Open Access   (Followers: 1)
Proceedings of the London Mathematical Society     Hybrid Journal   (Followers: 5)
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences     Full-text available via subscription   (Followers: 6)
Proceedings of the Royal Society of Edinburgh Section A Mathematics     Full-text available via subscription  
Proceedings of the Steklov Institute of Mathematics     Hybrid Journal  
Progress in Photovoltaics: Research & Applications     Hybrid Journal   (Followers: 6)
Proyecciones : Revista de Matematica     Open Access   (Followers: 1)
Publications Mathématiques de Besançon : Algèbre et Théorie des Nombres     Open Access  
Publications Mathématiques de L'IHÉS     Hybrid Journal   (Followers: 4)
Punjab University Journal of Mathematics     Open Access   (Followers: 1)
Pure Mathematics and Applications     Open Access  
Pythagoras     Open Access  
Quaestiones Mathematicae     Hybrid Journal  
Qualitative Theory of Dynamical Systems     Hybrid Journal  
Quantum Studies : Mathematics and Foundations     Hybrid Journal   (Followers: 2)
Quarterly Journal of Mathematics     Hybrid Journal  
Rare Metals     Hybrid Journal   (Followers: 2)
Recreational Mathematics Magazine     Open Access  
REDIMAT : Journal of Research in Mathematics Education     Open Access   (Followers: 6)
REMAT : Revista Eletrônica da Matemática     Open Access  
Rendiconti del Circolo Matematico di Palermo     Hybrid Journal  
Reportes Científicos de la FaCEN     Open Access  
Research in Mathematics Education     Hybrid Journal   (Followers: 13)
Research in Nondestructive Evaluation     Hybrid Journal   (Followers: 7)
Research in Number Theory     Hybrid Journal   (Followers: 1)
Research in the Mathematical Sciences     Open Access  
Research Journal of Pure Algebra     Open Access   (Followers: 1)
Researches in Mathematics     Open Access  

  First | 1 2 3 4     

Similar Journals
Journal Cover
Mathematical Programming Computation
Journal Prestige (SJR): 1.293
Citation Impact (citeScore): 3
Number of Followers: 2  
 
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 1867-2957 - ISSN (Online) 1867-2949
Published by Springer-Verlag Homepage  [2469 journals]
  • Correction to: Asynchronous Lagrangian scenario decomposition

    • Free pre-print version: Loading...

      PubDate: 2022-06-01
       
  • Political districting to minimize cut edges

    • Free pre-print version: Loading...

      Abstract: Abstract When constructing political districting plans, prominent criteria include population balance, contiguity, and compactness. The compactness of a districting plan, which is often judged by the “eyeball test”, has been quantified in many ways, e.g., Length-Width, Polsby-Popper, and Moment-of-Inertia. This paper considers the number of cut edges, which has recently gained traction in the redistricting literature as a measure of compactness because it is simple and reasonably agrees with the eyeball test. We study the stylized problem of minimizing the number of cut edges, subject to constraints on population balance and contiguity. With the integer programming techniques proposed in this paper, all county-level instances in the USA (and some tract-level instances) can be solved to optimality. Our techniques extend to minimize weighted cut edges (e.g., to minimize district perimeter length) or to impose compactness constraints. All data, code, and results are on GitHub.
      PubDate: 2022-04-26
       
  • Allocation of fungible resources via a fast, scalable price discovery
           method

    • Free pre-print version: Loading...

      Abstract: Abstract We consider the problem of assigning or allocating resources to a set of jobs. We consider the case when the resources are fungible, that is, the job can be done with any mix of the resources, but with different efficiencies. In our formulation we maximize a total utility subject to a given limit on the resource usage, which is a convex optimization problem and so is tractable. In this paper we develop a custom, parallelizable algorithm for solving the resource allocation problem that scales to large problems, with millions of jobs. Our algorithm is based on the dual problem, in which the dual variables associated with the resource usage limit can be interpreted as resource prices. Our method updates the resource prices in each iteration, ultimately discovering the optimal resource prices, from which an optimal allocation is obtained. We provide an open-source implementation of our method, which can solve problems with millions of jobs in a few seconds on CPU, and under a second on a GPU; our software can solve smaller problems in milliseconds. On large problems, our implementation is up to three orders of magnitude faster than a commercial solver for convex optimization.
      PubDate: 2022-04-18
      DOI: 10.1007/s12532-022-00220-6
       
  • Limited-memory common-directions method for large-scale optimization:
           convergence, parallelization, and distributed optimization

    • Free pre-print version: Loading...

      Abstract: Abstract In this paper, we present a limited-memory common-directions method for smooth optimization that interpolates between first- and second-order methods. At each iteration, a subspace of a limited dimension size is constructed using first-order information from previous iterations, and an efficient Newton method is deployed to find an approximate minimizer within this subspace. With properly selected subspace of dimension as small as two, the proposed algorithm achieves the optimal convergence rates for first-order methods while remaining a descent method, and it also possesses fast convergence speed on nonconvex problems. Since the major operations of our method are dense matrix-matrix operations, the proposed method can be efficiently parallelized in multicore environments even for sparse problems. By wisely utilizing historical information, our method is also communication-efficient in distributed optimization that uses multiple machines as the Newton steps can be calculated with little communication. Numerical study shows that our method has superior empirical performance on real-world large-scale machine learning problems.
      PubDate: 2022-03-29
      DOI: 10.1007/s12532-022-00219-z
       
  • QPALM: a proximal augmented lagrangian method for nonconvex quadratic
           programs

    • Free pre-print version: Loading...

      Abstract: Abstract We propose QPALM, a nonconvex quadratic programming (QP) solver based on the proximal augmented Lagrangian method. This method solves a sequence of inner subproblems which can be enforced to be strongly convex and which therefore admit a unique solution. The resulting steps are shown to be equivalent to inexact proximal point iterations on the extended-real-valued cost function, which allows for a fairly simple analysis where convergence to a stationary point at an \(R\) -linear rate is shown. The QPALM algorithm solves the subproblems iteratively using semismooth Newton directions and an exact linesearch. The former can be computed efficiently in most iterations by making use of suitable factorization update routines, while the latter requires the zero of a monotone, one-dimensional, piecewise affine function. QPALM is implemented in open-source C code, with tailored linear algebra routines for the factorization in a self-written package LADEL. The resulting implementation is shown to be extremely robust in numerical simulations, solving all of the Maros-Meszaros problems and finding a stationary point for most of the nonconvex QPs in the Cutest test set. Furthermore, it is shown to be competitive against state-of-the-art convex QP solvers in typical QPs arising from application domains such as portfolio optimization and model predictive control. As such, QPALM strikes a unique balance between solving both easy and hard problems efficiently.
      PubDate: 2022-03-22
      DOI: 10.1007/s12532-022-00218-0
       
  • Optimal patchings for consecutive ones matrices

    • Free pre-print version: Loading...

      Abstract: Abstract We study a variant of the weighted consecutive ones property problem. Here, a 0/1-matrix is given with a cost associated to each of its entries and one has to find a minimum cost set of zero entries to be turned to ones in order to make the matrix have the consecutive ones property for rows. We investigate polyhedral and combinatorial properties of the problem and we exploit them in a branch-and-cut algorithm. In particular, we devise preprocessing rules and investigate variants of “local cuts”. We test the resulting algorithm on a number of instances, and we report on these computational experiments.
      PubDate: 2022-03-01
      DOI: 10.1007/s12532-021-00203-z
       
  • $$\mathtt {Tenscalc}$$ Tenscalc : a toolbox to generate fast code to solve
           nonlinear constrained minimizations and compute Nash equilibria

    • Free pre-print version: Loading...

      Abstract: Abstract We describe the toolbox \(\mathtt {Tenscalc}\) that generates specialized C-code to solve nonlinear constrained optimizations and to compute Nash equilibria. \(\mathtt {Tenscalc}\) is aimed at scenarios where one needs to solve very fast a large number of optimizations that are structurally similar. This is common in applications where the optimizations depend on measured data and one wants to compute optima for large or evolving datasets, e.g., in robust estimation and classification, maximum likelihood estimation, model predictive control (MPC), moving horizon estimation (MHE), and combined MPC-MHE (which requires the computation of a saddle-point equilibria). \(\mathtt {Tenscalc}\) is mostly aimed at generating solvers for optimizations with up to a few thousands of optimization variables/constraints and solve times up to a few milliseconds. The speed achieved by the solver arises from a combination of features: reuse of intermediate computations across and within iterations of the solver, detection and exploitation of matrix sparsity, avoidance of run-time memory allocation and garbage collection, and reliance on flat code that improves the efficiency of the microprocessor pipelining and caching. All these features have been automated and embedded into the code generation process. We include a few representative examples to illustrate how the speed and memory footprint of the solver scale with the size of the problem.
      PubDate: 2022-02-08
      DOI: 10.1007/s12532-022-00216-2
       
  • A penalized method of alternating projections for weighted low-rank hankel
           matrix optimization

    • Free pre-print version: Loading...

      Abstract: Abstract Weighted low-rank Hankel matrix optimization has long been used to reconstruct contaminated signal or forecast missing values for time series of a wide class. The Method of Alternating Projections (MAP) (i.e., alternatively projecting to a low-rank matrix manifold and the Hankel matrix subspace) is a leading method. Despite its wide use, MAP has long been criticized of lacking convergence and of ignoring the weights used to reflect importance of the observed data. The most of known results are in a local sense. In particular, the latest research shows that MAP may converge at a linear rate provided that the initial point is close enough to a true solution and a transversality condition is satisfied. In this paper, we propose a globalized variant of MAP through a penalty approach. The proposed method inherits the favourable local properties of MAP and has the same computational complexity. Moreover, it is capable of handling a general weight matrix, is globally convergent, and enjoys local linear convergence rate provided that the cutting off singular values are significantly smaller than the kept ones. Furthermore, the new method also applies to complex data. Extensive numerical experiments demonstrate the efficiency of the proposed method against several popular variants of MAP.
      PubDate: 2022-02-03
      DOI: 10.1007/s12532-022-00217-1
       
  • Adaptive primal-dual stochastic gradient method for
           expectation-constrained convex stochastic programs

    • Free pre-print version: Loading...

      Abstract: Abstract Stochastic gradient methods (SGMs) have been widely used for solving stochastic optimization problems. A majority of existing works assume no constraints or easy-to-project constraints. In this paper, we consider convex stochastic optimization problems with expectation constraints. For these problems, it is often extremely expensive to perform projection onto the feasible set. Several SGMs in the literature can be applied to solve the expectation-constrained stochastic problems. We propose a novel primal-dual type SGM based on the Lagrangian function. Different from existing methods, our method incorporates an adaptiveness technique to speed up convergence. At each iteration, our method inquires an unbiased stochastic subgradient of the Lagrangian function, and then it renews the primal variables by an adaptive-SGM update and the dual variables by a vanilla-SGM update. We show that the proposed method has a convergence rate of \(O(1/\sqrt{k})\) in terms of the objective error and the constraint violation. Although the convergence rate is the same as those of existing SGMs, we observe its significantly faster convergence than an existing non-adaptive primal-dual SGM and a primal SGM on solving the Neyman–Pearson classification and quadratically constrained quadratic programs. Furthermore, we modify the proposed method to solve convex–concave stochastic minimax problems, for which we perform adaptive-SGM updates to both primal and dual variables. A convergence rate of \(O(1/\sqrt{k})\) is also established to the modified method for solving minimax problems in terms of primal-dual gap. Our code has been released at https://github.com/RPI-OPT/APriD.
      PubDate: 2022-02-03
      DOI: 10.1007/s12532-021-00214-w
       
  • Efficient unconstrained black box optimization

    • Free pre-print version: Loading...

      Abstract: Abstract For the unconstrained optimization of black box functions, this paper introduces a new randomized algorithm called VRBBO. In practice, VRBBO matches the quality of other state-of-the-art algorithms for finding, in small and large dimensions, a local minimizer with reasonable accuracy. Although our theory guarantees only local minimizers our heuristic techniques turn VRBBO into an efficient global solver. In very thorough numerical experiments, we found in most cases either a global minimizer, or where this could not be checked, at least a point of similar quality to the best competitive global solvers. For smooth, everywhere defined functions, it is proved that, with probability arbitrarily close to 1, a basic version of our algorithm finds with \({{\mathcal {O}}}(n\varepsilon ^{-2})\) function evaluations a point whose unknown exact gradient 2-norm is below a given threshold \(\varepsilon >0\) , where n is the dimension. In the smooth convex case, this number improves to \({{\mathcal {O}}}(n\log \varepsilon ^{-1})\) and in the smooth (strongly) convex case to \({{\mathcal {O}}}(n\log n\varepsilon ^{-1})\) . This matches known recent complexity results for reaching a slightly different goal, namely the expected unknown exact gradient 2-norm is below a given threshold \(\varepsilon >0\) . Numerical results show that VRBBO is effective and robust in comparison with the state-of-the-art local and global solvers on the unconstrained CUTEst test problems of Gould et al. (Comput Optim Appl 60:545–557, 2014) for optimization and the test problems of Jamil and Yang (Int J Math Model Numer Optim 4:150, 2013) for global optimization with 2–5000 variables.
      PubDate: 2022-02-03
      DOI: 10.1007/s12532-021-00215-9
       
  • LMBOPT: a limited memory method for bound-constrained optimization

    • Free pre-print version: Loading...

      Abstract: Abstract Recently, Neumaier and Azmi gave a comprehensive convergence theory for a generic algorithm for bound constrained optimization problems with a continuously differentiable objective function. The algorithm combines an active set strategy with a gradient-free line search CLS along a piecewise linear search path defined by directions chosen to reduce zigzagging. This paper describes LMBOPT, an efficient implementation of this scheme. It employs new limited memory techniques for computing the search directions, improves CLS by adding various safeguards relevant when finite precision arithmetic is used, and adds many practical enhancements in other details. The paper compares LMBOPT and several other solvers on the unconstrained and bound constrained problems from the CUTEst collection and makes recommendations on which solver to use and when. Depending on the problem class, the problem dimension, and the precise goal, the best solvers are LMBOPT, ASACG, and LMBFG-EIG-MS.
      PubDate: 2022-01-10
      DOI: 10.1007/s12532-021-00213-x
       
  • Scalable branching on dual decomposition of stochastic mixed-integer
           programming problems

    • Free pre-print version: Loading...

      Abstract: Abstract We present a scalable branching method for the dual decomposition of stochastic mixed-integer programming. Our new branching method is based on the branching method proposed by Carøe and Schultz that creates branching disjunctions on first-stage variables only. We propose improvements to the process for creating branching disjunctions, including (1) branching on the optimal solutions of the Dantzig–Wolfe reformulation of the restricted master problem and (2) using a more comprehensive (yet simple) measure for the dispersions associated with subproblem solution infeasibility. We prove that the proposed branching process leads to an algorithm that terminates finitely, and we provide conditions under which globally optimal solutions can be identified after termination. We have implemented our new branching method, as well as the Carøe–Schultz method and a branch-and-price method, in the open-source software package DSP. Using SIPLIB test instances, we present extensive numerical results to demonstrate that the proposed branching method significantly reduces the number of node subproblems and solution times.
      PubDate: 2022-01-04
      DOI: 10.1007/s12532-021-00212-y
       
  • Dantzig–Wolfe reformulations for binary quadratic problems

    • Free pre-print version: Loading...

      Abstract: Abstract The purpose of this paper is to provide strong reformulations for binary quadratic problems. We propose a first methodological analysis on a family of reformulations combining Dantzig–Wolfe and Quadratic Convex optimization principles. We show that a few reformulations of our family yield continuous relaxations that are strong in terms of dual bounds and computationally efficient to optimize. As a representative case study, we apply them to a cardinality constrained quadratic knapsack problem, providing extensive experimental insights. We report and analyze in depth a particular reformulation providing continuous relaxations whose solutions turn out to be integer optima in all our tests.
      PubDate: 2022-01-03
      DOI: 10.1007/s12532-021-00206-w
       
  • A stochastic approximation method for approximating the efficient frontier
           of chance-constrained nonlinear programs

    • Free pre-print version: Loading...

      Abstract: Abstract We propose a stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs. Our approach is based on a bi-objective viewpoint of chance-constrained programs that seeks solutions on the efficient frontier of optimal objective value versus risk of constraints violation. To this end, we construct a reformulated problem whose objective is to minimize the probability of constraints violation subject to deterministic convex constraints (which includes a bound on the objective function value). We adapt existing smoothing-based approaches for chance-constrained problems to derive a convergent sequence of smooth approximations of our reformulated problem, and apply a projected stochastic subgradient algorithm to solve it. In contrast with exterior sampling-based approaches (such as sample average approximation) that approximate the original chance-constrained program with one having finite support, our proposal converges to stationary solutions of a smooth approximation of the original problem, thereby avoiding poor local solutions that may be an artefact of a fixed sample. Our proposal also includes a tailored implementation of the smoothing-based approach that chooses key algorithmic parameters based on problem data. Computational results on four test problems from the literature indicate that our proposed approach can efficiently determine good approximations of the efficient frontier.
      PubDate: 2021-12-01
      DOI: 10.1007/s12532-020-00199-y
       
  • Benders decomposition with adaptive oracles for large scale optimization

    • Free pre-print version: Loading...

      Abstract: Abstract This paper proposes an algorithm to efficiently solve large optimization problems which exhibit a column bounded block-diagonal structure, where subproblems differ in right-hand side and cost coefficients. Similar problems are often tackled using cutting-plane algorithms, which allow for an iterative and decomposed solution of the problem. When solving subproblems is computationally expensive and the set of subproblems is large, cutting-plane algorithms may slow down severely. In this context we propose two novel adaptive oracles that yield inexact information, potentially much faster than solving the subproblem. The first adaptive oracle is used to generate inexact but valid cutting planes, and the second adaptive oracle gives a valid upper bound of the true optimal objective. These two oracles progressively “adapt” towards the true exact oracle if provided with an increasing number of exact solutions, stored throughout the iterations. These adaptive oracles are embedded within a Benders-type algorithm able to handle inexact information. We compare the Benders with adaptive oracles against a standard Benders algorithm on a stochastic investment planning problem. The proposed algorithm shows the capability to substantially reduce the computational effort to obtain an \(\epsilon \) -optimal solution: an illustrative case is 31.9 times faster for a \(1.00\%\) convergence tolerance and 15.4 times faster for a \(0.01\%\) tolerance.
      PubDate: 2021-12-01
      DOI: 10.1007/s12532-020-00197-0
       
  • Adaptive large neighborhood search for mixed integer programming

    • Free pre-print version: Loading...

      Abstract: Abstract Large Neighborhood Search (LNS) heuristics are among the most powerful but also most expensive heuristics for mixed integer programs (MIP). Ideally, a solver adaptively concentrates its limited computational budget by learning which LNS heuristics work best for the MIP problem at hand. To this end, this work introduces Adaptive Large Neighborhood Search (ALNS) for MIP, a primal heuristic that acts as a framework for eight popular LNS heuristics such as Local Branching and Relaxation Induced Neighborhood Search (RINS). We distinguish the available LNS heuristics by their individual search spaces, which we call auxiliary problems. The decision which auxiliary problem should be executed is guided by selection strategies for the multi armed bandit problem, a related optimization problem during which suitable actions have to be chosen to maximize a reward function. In this paper, we propose an LNS-specific reward function to learn to distinguish between the available auxiliary problems based on successful calls and failures. A second, algorithmic enhancement is a generic variable fixing prioritization, which ALNS employs to adjust the subproblem complexity as needed. This is particularly useful for some LNS problems which do not fix variables by themselves. The proposed primal heuristic has been implemented within the MIP solver SCIP. An extensive computational study is conducted to compare different LNS strategies within our ALNS framework on a large set of publicly available MIP instances from the MIPLIB and Coral benchmark sets. The results of this simulation are used to calibrate the parameters of the bandit selection strategies. A second computational experiment shows the computational benefits of the proposed ALNS framework within the MIP solver SCIP.
      PubDate: 2021-11-08
      DOI: 10.1007/s12532-021-00209-7
       
  • An augmented Lagrangian method with constraint generation for
           shape-constrained convex regression problems

    • Free pre-print version: Loading...

      Abstract: Abstract Shape-constrained convex regression problem deals with fitting a convex function to the observed data, where additional constraints are imposed, such as component-wise monotonicity and uniform Lipschitz continuity. This paper provides a unified framework for computing the least squares estimator of a multivariate shape-constrained convex regression function in \({\mathbb {R}}^d\) . We prove that the least squares estimator is computable via solving an essentially constrained convex quadratic programming (QP) problem with \((d+1)n\) variables, \(n(n-1)\) linear inequality constraints and n possibly non-polyhedral inequality constraints, where n is the number of data points. To efficiently solve the generally very large-scale convex QP, we design a proximal augmented Lagrangian method (proxALM) whose subproblems are solved by the semismooth Newton method. To further accelerate the computation when n is huge, we design a practical implementation of the constraint generation method such that each reduced problem is efficiently solved by our proposed proxALM. Comprehensive numerical experiments, including those in the pricing of basket options and estimation of production functions in economics, demonstrate that our proposed proxALM outperforms the state-of-the-art algorithms, and the proposed acceleration technique further shortens the computation time by a large margin.
      PubDate: 2021-11-08
      DOI: 10.1007/s12532-021-00210-0
       
  • acados—a modular open-source framework for fast embedded optimal
           control

    • Free pre-print version: Loading...

      Abstract: Abstract This paper presents the acados software package, a collection of solvers for fast embedded optimization intended for fast embedded applications. Its interfaces to higher-level languages make it useful for quickly designing an optimization-based control algorithm by putting together different algorithmic components that can be readily connected and interchanged. Since the core of acados is written on top of a high-performance linear algebra library, we do not sacrifice computational performance. Thus, we aim to provide both flexibility and performance through modularity, without the need to rely on automatic code generation, which facilitates maintainability and extensibility. The main features of acados are: efficient optimal control algorithms targeting embedded devices implemented in C, linear algebra based on the high-performance BLASFEO Frison (ACM Transactions on Mathematical Software (TOMS) 44: 1–30, 2018) library, user-friendly interfaces to Matlab and Python, and compatibility with the modeling language of CasADi Andersson (Mathematical Programming Computation 11: 136, 2019). acados is free and open-source software released under the permissive BSD 2-Clause license.
      PubDate: 2021-10-09
      DOI: 10.1007/s12532-021-00208-8
       
  • On scaled stopping criteria for a safeguarded augmented Lagrangian method
           with theoretical guarantees

    • Free pre-print version: Loading...

      Abstract: Abstract This paper discusses the use of a stopping criterion based on the scaling of the Karush–Kuhn–Tucker (KKT) conditions by the norm of the approximate Lagrange multiplier in the ALGENCAN implementation of a safeguarded augmented Lagrangian method. Such stopping criterion is already used in several nonlinear programming solvers, but it has not yet been considered in ALGENCAN due to its firm commitment with finding a true KKT point even when the multiplier set is not bounded. In contrast with this view, we present a strong global convergence theory under the quasi-normality constraint qualification, that allows for unbounded multiplier sets, accompanied by an extensive numerical test which shows that the scaled stopping criterion is more efficient in detecting convergence sooner. In particular, by scaling, ALGENCAN is able to recover a solution in some difficult problems where the original implementation fails, while the behavior of the algorithm in the easier instances is maintained. Furthermore, we show that, in some cases, a considerable computational effort is saved, proving the practical usefulness of the proposed strategy.
      PubDate: 2021-09-18
      DOI: 10.1007/s12532-021-00207-9
       
  • Computational aspects of infeasibility analysis in mixed integer
           programming

    • Free pre-print version: Loading...

      Abstract: Abstract The analysis of infeasible subproblems plays an important role in solving mixed integer programs (MIPs) and is implemented in most major MIP solvers. There are two fundamentally different concepts to generate valid global constraints from infeasible subproblems: conflict graph analysis and dual proof analysis. While conflict graph analysis detects sets of contradicting variable bounds in an implication graph, dual proof analysis derives valid linear constraints from the proof of the dual LP’s unboundedness. The main contribution of this paper is twofold. Firstly, we present three enhancements of dual proof analysis: presolving via variable cancellation, strengthening by applying mixed integer rounding functions, and a filtering mechanism. Further, we provide a comprehensive computational study evaluating the impact of every presented component regarding dual proof analysis. Secondly, this paper presents the first combined approach that uses both conflict graph and dual proof analysis simultaneously within a single MIP solution process. All experiments are carried out on general MIP instances from the standard public test set Miplib  2017; the presented algorithms have been implemented within the non-commercial MIP solver SCIP and the commercial MIP solver FICO Xpress.
      PubDate: 2021-03-06
      DOI: 10.1007/s12532-021-00202-0
       
 
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: 18.232.59.38
 
Home (Search)
API
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-