for Journals by Title or ISSN
for Articles by Keywords
  Subjects -> ENGINEERING (Total: 2599 journals)
    - CHEMICAL ENGINEERING (221 journals)
    - CIVIL ENGINEERING (231 journals)
    - ELECTRICAL ENGINEERING (132 journals)
    - ENGINEERING (1357 journals)
    - HYDRAULIC ENGINEERING (58 journals)
    - INDUSTRIAL ENGINEERING (87 journals)
    - MECHANICAL ENGINEERING (106 journals)

ENGINEERING (1357 journals)                  1 2 3 4 5 6 7 | Last

Showing 1 - 200 of 1205 Journals sorted alphabetically
3 Biotech     Open Access   (Followers: 8)
3D Research     Hybrid Journal   (Followers: 21)
AAPG Bulletin     Hybrid Journal   (Followers: 9)
Abstract and Applied Analysis     Open Access   (Followers: 3)
Aceh International Journal of Science and Technology     Open Access   (Followers: 8)
ACS Nano     Hybrid Journal   (Followers: 332)
Acta Geotechnica     Hybrid Journal   (Followers: 7)
Acta Metallurgica Sinica (English Letters)     Hybrid Journal   (Followers: 7)
Acta Polytechnica : Journal of Advanced Engineering     Open Access   (Followers: 3)
Acta Scientiarum. Technology     Open Access   (Followers: 3)
Acta Universitatis Cibiniensis. Technical Series     Open Access  
Active and Passive Electronic Components     Open Access   (Followers: 7)
Adaptive Behavior     Hybrid Journal   (Followers: 10)
Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi     Open Access  
Adsorption     Hybrid Journal   (Followers: 5)
Advanced Engineering Forum     Full-text available via subscription   (Followers: 9)
Advanced Journal of Graduate Research     Open Access  
Advanced Nonlinear Studies     Hybrid Journal  
Advanced Science     Open Access   (Followers: 8)
Advanced Science Focus     Free   (Followers: 5)
Advanced Science Letters     Full-text available via subscription   (Followers: 11)
Advanced Science, Engineering and Medicine     Partially Free   (Followers: 8)
Advanced Synthesis & Catalysis     Hybrid Journal   (Followers: 16)
Advances in Calculus of Variations     Hybrid Journal   (Followers: 6)
Advances in Catalysis     Full-text available via subscription   (Followers: 5)
Advances in Complex Systems     Hybrid Journal   (Followers: 9)
Advances in Engineering Software     Hybrid Journal   (Followers: 29)
Advances in Fuel Cells     Full-text available via subscription   (Followers: 17)
Advances in Fuzzy Systems     Open Access   (Followers: 5)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 17)
Advances in Heat Transfer     Full-text available via subscription   (Followers: 24)
Advances in Human Factors/Ergonomics     Full-text available via subscription   (Followers: 23)
Advances in Magnetic and Optical Resonance     Full-text available via subscription   (Followers: 8)
Advances in Natural Sciences: Nanoscience and Nanotechnology     Open Access   (Followers: 29)
Advances in Nonlinear Analysis     Open Access  
Advances in Operations Research     Open Access   (Followers: 12)
Advances in OptoElectronics     Open Access   (Followers: 6)
Advances in Physics Theories and Applications     Open Access   (Followers: 17)
Advances in Polymer Science     Hybrid Journal   (Followers: 45)
Advances in Porous Media     Full-text available via subscription   (Followers: 5)
Advances in Remote Sensing     Open Access   (Followers: 52)
Advances in Science and Research (ASR)     Open Access   (Followers: 6)
Aerobiologia     Hybrid Journal   (Followers: 3)
African Journal of Science, Technology, Innovation and Development     Hybrid Journal   (Followers: 6)
AIChE Journal     Hybrid Journal   (Followers: 36)
Ain Shams Engineering Journal     Open Access   (Followers: 5)
Akademik Platform Mühendislik ve Fen Bilimleri Dergisi     Open Access   (Followers: 2)
Al-Nahrain Journal for Engineering Sciences     Open Access  
Alexandria Engineering Journal     Open Access   (Followers: 2)
AMB Express     Open Access   (Followers: 1)
American Journal of Applied Sciences     Open Access   (Followers: 27)
American Journal of Engineering and Applied Sciences     Open Access   (Followers: 10)
American Journal of Engineering Education     Open Access   (Followers: 12)
American Journal of Environmental Engineering     Open Access   (Followers: 16)
American Journal of Industrial and Business Management     Open Access   (Followers: 25)
Anadolu University Journal of Science and Technology A : Applied Sciences and Engineering     Open Access  
Annals of Civil and Environmental Engineering     Open Access  
Annals of Combinatorics     Hybrid Journal   (Followers: 4)
Annals of Pure and Applied Logic     Open Access   (Followers: 4)
Annals of Regional Science     Hybrid Journal   (Followers: 8)
Annals of Science     Hybrid Journal   (Followers: 8)
Antarctic Science     Hybrid Journal   (Followers: 1)
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 2)
Applicable Analysis: An International Journal     Hybrid Journal   (Followers: 1)
Applied Catalysis A: General     Hybrid Journal   (Followers: 7)
Applied Catalysis B: Environmental     Hybrid Journal   (Followers: 20)
Applied Clay Science     Hybrid Journal   (Followers: 6)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 14)
Applied Magnetic Resonance     Hybrid Journal   (Followers: 4)
Applied Nanoscience     Open Access   (Followers: 9)
Applied Network Science     Open Access   (Followers: 3)
Applied Numerical Mathematics     Hybrid Journal   (Followers: 5)
Applied Physics Research     Open Access   (Followers: 6)
Applied Sciences     Open Access   (Followers: 5)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 7)
Arab Journal of Basic and Applied Sciences     Open Access  
Arabian Journal for Science and Engineering     Hybrid Journal   (Followers: 5)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 6)
Archives of Foundry Engineering     Open Access  
Archives of Thermodynamics     Open Access   (Followers: 9)
Arid Zone Journal of Engineering, Technology and Environment     Open Access   (Followers: 2)
Arkiv för Matematik     Hybrid Journal   (Followers: 2)
ASEE Prism     Full-text available via subscription   (Followers: 3)
Asia-Pacific Journal of Science and Technology     Open Access  
Asian Engineering Review     Open Access  
Asian Journal of Applied Science and Engineering     Open Access   (Followers: 2)
Asian Journal of Applied Sciences     Open Access   (Followers: 2)
Asian Journal of Biotechnology     Open Access   (Followers: 9)
Asian Journal of Control     Hybrid Journal  
Asian Journal of Technology Innovation     Hybrid Journal   (Followers: 8)
Assembly Automation     Hybrid Journal   (Followers: 2)
at - Automatisierungstechnik     Hybrid Journal   (Followers: 1)
ATZagenda     Hybrid Journal  
ATZextra worldwide     Hybrid Journal  
AURUM : Mühendislik Sistemleri ve Mimarlık Dergisi = Aurum Journal of Engineering Systems and Architecture     Open Access  
Australasian Physical & Engineering Sciences in Medicine     Hybrid Journal   (Followers: 1)
Australian Journal of Multi-Disciplinary Engineering     Full-text available via subscription   (Followers: 2)
Autocracy : Jurnal Otomasi, Kendali, dan Aplikasi Industri     Open Access  
Automotive Experiences     Open Access  
Autonomous Mental Development, IEEE Transactions on     Hybrid Journal   (Followers: 8)
Avances en Ciencias e Ingeniería     Open Access  
Avances en Ciencias e Ingenierías     Open Access  
Balkan Region Conference on Engineering and Business Education     Open Access   (Followers: 2)
Bangladesh Journal of Scientific and Industrial Research     Open Access  
Basin Research     Hybrid Journal   (Followers: 5)
Batteries     Open Access   (Followers: 6)
Bautechnik     Hybrid Journal   (Followers: 2)
Bell Labs Technical Journal     Hybrid Journal   (Followers: 28)
Beni-Suef University Journal of Basic and Applied Sciences     Open Access   (Followers: 4)
BER : Manufacturing Survey : Full Survey     Full-text available via subscription   (Followers: 2)
BER : Motor Trade Survey     Full-text available via subscription  
BER : Retail Sector Survey     Full-text available via subscription   (Followers: 1)
BER : Retail Survey : Full Survey     Full-text available via subscription   (Followers: 1)
BER : Survey of Business Conditions in Manufacturing : An Executive Summary     Full-text available via subscription   (Followers: 3)
BER : Survey of Business Conditions in Retail : An Executive Summary     Full-text available via subscription   (Followers: 3)
Beyond : Undergraduate Research Journal     Open Access  
Bhakti Persada : Jurnal Aplikasi IPTEKS     Open Access  
Bharatiya Vaigyanik evam Audyogik Anusandhan Patrika (BVAAP)     Open Access   (Followers: 1)
Bilge International Journal of Science and Technology Research     Open Access  
Biofuels Engineering     Open Access   (Followers: 1)
Biointerphases     Open Access   (Followers: 1)
Biomaterials Science     Full-text available via subscription   (Followers: 13)
Biomedical Engineering     Hybrid Journal   (Followers: 16)
Biomedical Engineering     Hybrid Journal   (Followers: 2)
Biomedical Engineering and Computational Biology     Open Access   (Followers: 13)
Biomedical Engineering Letters     Hybrid Journal   (Followers: 5)
Biomedical Engineering, IEEE Reviews in     Full-text available via subscription   (Followers: 19)
Biomedical Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 36)
Biomedical Engineering: Applications, Basis and Communications     Hybrid Journal   (Followers: 5)
Biomedical Microdevices     Hybrid Journal   (Followers: 8)
Biomedical Science and Engineering     Open Access   (Followers: 4)
Biomicrofluidics     Open Access   (Followers: 5)
BioNanoMaterials     Open Access   (Followers: 2)
Biotechnology Progress     Hybrid Journal   (Followers: 41)
Bitlis Eren University Journal of Science and Technology     Open Access  
Black Sea Journal of Engineering and Science     Open Access  
Boletin Cientifico Tecnico INIMET     Open Access  
Botswana Journal of Technology     Full-text available via subscription   (Followers: 1)
Boundary Value Problems     Open Access   (Followers: 1)
Brazilian Journal of Science and Technology     Open Access   (Followers: 2)
Broadcasting, IEEE Transactions on     Hybrid Journal   (Followers: 12)
Bulletin of Canadian Petroleum Geology     Full-text available via subscription   (Followers: 13)
Bulletin of Engineering Geology and the Environment     Hybrid Journal   (Followers: 15)
Bulletin of the Crimean Astrophysical Observatory     Hybrid Journal  
Cahiers Droit, Sciences & Technologies     Open Access  
Calphad     Hybrid Journal   (Followers: 2)
Canadian Geotechnical Journal     Hybrid Journal   (Followers: 32)
Canadian Journal of Remote Sensing     Full-text available via subscription   (Followers: 47)
Carbon Resources Conversion     Open Access   (Followers: 1)
Carpathian Journal of Electronic and Computer Engineering     Open Access  
Case Studies in Engineering Failure Analysis     Open Access   (Followers: 6)
Case Studies in Thermal Engineering     Open Access   (Followers: 6)
Catalysis Communications     Hybrid Journal   (Followers: 6)
Catalysis Letters     Hybrid Journal   (Followers: 2)
Catalysis Reviews: Science and Engineering     Hybrid Journal   (Followers: 10)
Catalysis Science and Technology     Hybrid Journal   (Followers: 10)
Catalysis Surveys from Asia     Hybrid Journal   (Followers: 3)
Catalysis Today     Hybrid Journal   (Followers: 7)
CEAS Space Journal     Hybrid Journal   (Followers: 2)
Cellular and Molecular Neurobiology     Hybrid Journal   (Followers: 3)
Central European Journal of Engineering     Hybrid Journal  
Chaos : An Interdisciplinary Journal of Nonlinear Science     Hybrid Journal   (Followers: 3)
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 3)
Chaos, Solitons & Fractals : X     Open Access  
Chinese Journal of Catalysis     Full-text available via subscription   (Followers: 2)
Chinese Journal of Engineering     Open Access   (Followers: 2)
Chinese Science Bulletin     Open Access   (Followers: 1)
Ciencia e Ingenieria Neogranadina     Open Access  
Ciencia en su PC     Open Access   (Followers: 1)
Ciencia y Tecnología     Open Access  
Ciencias Holguin     Open Access   (Followers: 3)
CienciaUAT     Open Access   (Followers: 1)
Cientifica     Open Access  
CIRP Annals - Manufacturing Technology     Full-text available via subscription   (Followers: 11)
CIRP Journal of Manufacturing Science and Technology     Full-text available via subscription   (Followers: 13)
City, Culture and Society     Hybrid Journal   (Followers: 23)
Clay Minerals     Hybrid Journal   (Followers: 10)
Clean Air Journal     Full-text available via subscription   (Followers: 1)
Clinical Science     Hybrid Journal   (Followers: 8)
Coal Science and Technology     Full-text available via subscription   (Followers: 3)
Coastal Engineering     Hybrid Journal   (Followers: 11)
Coastal Engineering Journal     Hybrid Journal   (Followers: 6)
Coatings     Open Access   (Followers: 4)
Cogent Engineering     Open Access   (Followers: 3)
Cognitive Computation     Hybrid Journal   (Followers: 3)
Color Research & Application     Hybrid Journal   (Followers: 3)
COMBINATORICA     Hybrid Journal  
Combustion Theory and Modelling     Hybrid Journal   (Followers: 14)
Combustion, Explosion, and Shock Waves     Hybrid Journal   (Followers: 15)
Communications Engineer     Hybrid Journal   (Followers: 1)
Communications Faculty of Sciences University of Ankara Series A2-A3 Physical Sciences and Engineering     Open Access  
Communications in Information Science and Management Engineering     Open Access   (Followers: 4)
Communications in Numerical Methods in Engineering     Hybrid Journal   (Followers: 2)
Components, Packaging and Manufacturing Technology, IEEE Transactions on     Hybrid Journal   (Followers: 29)
Composite Interfaces     Hybrid Journal   (Followers: 8)
Composite Structures     Hybrid Journal   (Followers: 304)
Composites Part A : Applied Science and Manufacturing     Hybrid Journal   (Followers: 243)
Composites Part B : Engineering     Hybrid Journal   (Followers: 277)
Composites Science and Technology     Hybrid Journal   (Followers: 212)
Comptes Rendus Mécanique     Full-text available via subscription   (Followers: 2)

        1 2 3 4 5 6 7 | Last

Similar Journals
Journal Cover
Computational Optimization and Applications
Journal Prestige (SJR): 1.127
Citation Impact (citeScore): 2
Number of Followers: 8  
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 1573-2894 - ISSN (Online) 0926-6003
Published by Springer-Verlag Homepage  [2351 journals]
  • Correction to: The adjoint Newton algorithm for large-scale unconstrained
           optimization in meteorology applications
    • Abstract: It has come to our attention that the “Adjoint Newton Algorithm” has been published within the following papers.
      PubDate: 2019-07-01
  • A simple convergence analysis of Bregman proximal gradient algorithm
    • Abstract: In this paper, we provide a simple convergence analysis of proximal gradient algorithm with Bregman distance, which provides a tighter bound than existing result. In particular, for the problem of minimizing a class of convex objective functions, we show that proximal gradient algorithm with Bregman distance can be viewed as proximal point algorithm that incorporates another Bregman distance. Consequently, the convergence result of the proximal gradient algorithm with Bregman distance follows directly from that of the proximal point algorithm with Bregman distance, and this leads to a simpler convergence analysis with a tighter convergence bound than existing ones. We further propose and analyze the backtracking line-search variant of the proximal gradient algorithm with Bregman distance.
      PubDate: 2019-07-01
  • Maximum–norm a posteriori error estimates for an optimal control
    • Abstract: We analyze a reliable and efficient max-norm a posteriori error estimator for a control-constrained, linear–quadratic optimal control problem. The estimator yields optimal experimental rates of convergence within an adaptive loop.
      PubDate: 2019-07-01
  • A parameterized Douglas–Rachford algorithm
    • Abstract: Based on a reparametrization of the Douglas–Rachford algorithm, we provide a principle of finding the least norm solution for a sum of two maximally monotone operators. The algorithm allows us to find the least norm solution to a sum of monotone operators, and even generally to find the least norm primal-dual solution to inclusions with mixtures of composite monotone operators. Three numerical results illustrate our results.
      PubDate: 2019-07-01
  • An algorithm for equilibrium selection in generalized Nash equilibrium
    • Abstract: Recently a new solution concept for generalized Nash equilibrium problems was published by the author. This concept selects a reasonable equilibrium out of the typically infinitely many. The idea is to model the process of finding a compromise by solving parametrized generalized Nash equilibrium problems. In this paper we propose an algorithmic realization of the concept. The model produces a solution path, which is under suitable assumptions unique. The algorithm is a homotopy method that tries to follow this path. We use semismooth Newton steps as corrector steps in our algorithm in order to approximately solve the generalized Nash equilibrium problems for each given parameter. If we have a unique solution path, we need three additional theoretical assumptions: a stationarity result for the merit function, a coercivity condition for the constraints, and an extended Mangasarian–Fromowitz constraint qualification. Then we can prove convergence of our semismooth tracing algorithm to the unique equilibrium to be selected. We also present convincing numerical results on a test library of problems from literature. The algorithm also performs well on a number of problems that do not satisfy all the theoretical assumptions.
      PubDate: 2019-07-01
  • Modified extragradient-like algorithms with new stepsizes for variational
    • Abstract: The paper concerns with an algorithm for approximating solutions of a variational inequality problem involving a Lipschitz continuous and monotone operator in a Hilbert space. The algorithm uses a new stepsize rule which does not depend on the Lipschitz constant and without any linesearch procedure. The resulting algorithm only requires to compute a projection on feasible set and a value of operator over each iteration. The convergence and the convergence rate of the algorithm are established. Some experiments are performed to show the numerical behavior of the proposed algorithm and also to compare its performance with those of others.
      PubDate: 2019-07-01
  • A Newton-like method with mixed factorizations and cubic regularization
           for unconstrained minimization
    • Abstract: A Newton-like method for unconstrained minimization is introduced in the present work. While the computer work per iteration of the best-known implementations may need several factorizations or may use rather expensive matrix decompositions, the proposed method uses a single cheap factorization per iteration. Convergence and complexity and results, even in the case in which the subproblems’ Hessians are far from being Hessians of the objective function, are presented. Moreover, when the Hessian is Lipschitz-continuous, the proposed method enjoys \(O(\varepsilon ^{-3/2})\) evaluation complexity for first-order optimality and \(O(\varepsilon ^{-3})\) for second-order optimality as other recently introduced Newton method for unconstrained optimization based on cubic regularization or special trust-region procedures. Fairly successful and fully reproducible numerical experiments are presented and the developed corresponding software is freely available.
      PubDate: 2019-07-01
  • On relaxation of some customized proximal point algorithms for convex
           minimization: from variational inequality perspective
    • Abstract: The proximal point algorithm (PPA) is a fundamental method for convex programming. When applying the PPA to solve linearly constrained convex problems, we may prefer to choose an appropriate metric matrix to define the proximal regularization, so that the computational burden of the resulted PPA can be reduced, and sometimes even admit closed form or efficient solutions. This idea results in the so-called customized PPA (also known as preconditioned PPA), and it covers the linearized ALM, the primal-dual hybrid gradient algorithm, ADMM as special cases. Since each customized PPA owes special structures and has popular applications, it is interesting to ask wether we can design a simple relaxation strategy for these algorithms. In this paper we treat these customized PPA algorithms uniformly by a mixed variational inequality approach, and propose a new relaxation strategy for these customized PPA algorithms. Our idea is based on correcting the dual variables individually and does not rely on relaxing the primal variables. This is very different from previous works. From variational inequality perspective, we prove the global convergence and establish a worst-case convergence rate for these relaxed PPA algorithms. Finally, we demonstrate the performance improvements by some numerical results.
      PubDate: 2019-07-01
  • Convergence of a stabilized SQP method for equality constrained
    • Abstract: We herein present a stabilized sequential programming method for equality constrained programming. The proposed method uses the concepts of proximal point methods and primal-dual regularization. A sequence of regularized problems are approximately solved with the regularization parameter approaching zero. At each iteration, a regularized QP subproblem is solved to obtain a primal-dual search direction. Further, a trust-funnel-like line search scheme is used to globalize the algorithm, and a global convergence under the weak assumption of cone-continuity property is shown. To achieve a fast local convergence, a specially designed second-order correction (SOC) technique is adopted near a solution. Under the second-order sufficient condition and some weak conditions (among which no constraint qualification is involved), the regularized QP subproblem transits to a stabilized QP subproblem in the limit. By possibly combining with the SOC step, the full step will be accepted in the limit and hence the superlinearly local convergence is achieved. Preliminary numerical results are reported, which are encouraging.
      PubDate: 2019-07-01
  • The Uzawa-MBB type algorithm for nonsymmetric saddle point problems
    • Abstract: The Uzawa type algorithms have shown themselves to be competitive for solving large and sparse saddle point problems. They reduce the original problem to a lower-dimensional linear system and solve the derived equation instead. In this paper, we propose new Uzawa-MBB type and preconditioned Uzawa-MBB type algorithms for the nonsymmetric saddle point problems. The main contributions of the paper are that both of the new algorithms are constructed from optimization algorithms, use a special descent direction based on Xu et al. (A new Uzawa-exact type algorithm for nonsymmetric saddle point problems, 2018. arXiv preprint arXiv:1802.04135 ), and combine the modified Barzilai–Borwein method with modified GLL line search strategy to solve the derived least squares problem. In addition, we analyze the convergence of the two new algorithms. Applications to finite element discretization of Navier–Stokes equation with an unstable pair of approximation spaces, i.e. Q1–P0 pair, are discussed and the results of the numerical experiments of applying our new algorithms are reported, which demonstrate the competitive performance of the preconditioned Uzawa-MBB type algorithms with Krylov subspace methods.
      PubDate: 2019-07-01
  • Regularized Jacobi-type ADMM-methods for a class of separable convex
           optimization problems in Hilbert spaces
    • Abstract: We consider a regularized version of a Jacobi-type alternating direction method of multipliers (ADMM) for the solution of a class of separable convex optimization problems in a Hilbert space. The analysis shows that this method is equivalent to the standard proximal-point method applied in a Hilbert space with a transformed scalar product. The method therefore inherits the known convergence results from the proximal-point method and allows suitable modifications to get a strongly convergent variant. Some additional properties are also shown by exploiting the particular structure of the ADMM-type solution method. Applications and numerical results are provided for the domain decomposition method and potential (generalized) Nash equilibrium problems in a Hilbert space setting.
      PubDate: 2019-07-01
  • Robust optimal discrete arc sizing for tree-shaped potential networks
    • Abstract: We consider the problem of discrete arc sizing for tree-shaped potential networks with respect to infinitely many demand scenarios. This means that the arc sizes need to be feasible for an infinite set of scenarios. The problem can be seen as a strictly robust counterpart of a single-scenario network design problem, which is shown to be NP-complete even on trees. In order to obtain a tractable problem, we introduce a method for generating a finite scenario set such that optimality of a sizing for this finite set implies the sizing’s optimality for the originally given infinite set of scenarios. We further prove that the size of the finite scenario set is quadratically bounded above in the number of nodes of the underlying tree and that it can be computed in polynomial time. The resulting problem can then be solved as a standard mixed-integer linear optimization problem. Finally, we show the applicability of our theoretical results by computing globally optimal arc sizes for a realistic hydrogen transport network of Eastern Germany.
      PubDate: 2019-07-01
  • A new infeasible proximal bundle algorithm for nonsmooth nonconvex
           constrained optimization
    • Abstract: Proximal bundle method has usually been presented for unconstrained convex optimization problems. In this paper, we develop an infeasible proximal bundle method for nonsmooth nonconvex constrained optimization problems. Using the improvement function we transform the problem into an unconstrained one and then we build a cutting plane model. The resulting algorithm allows effective control of the size of quadratic programming subproblems via the aggregation techniques. The novelty in our approach is that the objective and constraint functions can be any arbitrary (regular) locally Lipschitz functions. In addition the global convergence, starting from any point, is proved in the sense that every accumulation point of the iterative sequence is stationary for the improvement function. At the end, some encouraging numerical results with a MATLAB implementation are also reported.
      PubDate: 2019-06-15
  • Computing the spark: mixed-integer programming for the (vector) matroid
           girth problem
    • Abstract: We investigate the NP-hard problem of computing the spark of a matrix (i.e., the smallest number of linearly dependent columns), a key parameter in compressed sensing and sparse signal recovery. To that end, we identify polynomially solvable special cases, gather upper and lower bounding procedures, and propose several exact (mixed-)integer programming models and linear programming heuristics. In particular, we develop a branch and cut scheme to determine the girth of a matroid, focussing on the vector matroid case, for which the girth is precisely the spark of the representation matrix. Extensive numerical experiments demonstrate the effectiveness of our specialized algorithms compared to general-purpose black-box solvers applied to several mixed-integer programming models.
      PubDate: 2019-06-13
  • Implementation of interior-point methods for LP based on Krylov subspace
           iterative solvers with inner-iteration preconditioning
    • Abstract: We apply novel inner-iteration preconditioned Krylov subspace methods to the interior-point algorithm for linear programming (LP). Inner-iteration preconditioners recently proposed by Morikuni and Hayami enable us to overcome the severe ill-conditioning of linear equations solved in the final phase of interior-point iterations. The Krylov subspace methods do not suffer from rank-deficiency and therefore no preprocessing is necessary even if rows of the constraint matrix are not linearly independent. By means of these methods, a new interior-point recurrence is proposed in order to omit one matrix-vector product at each step. Extensive numerical experiments are conducted over diverse instances of 140 LP problems including the Netlib, QAPLIB, Mittelmann and Atomizer Basis Pursuit collections. The largest problem has 434,580 unknowns. It turns out that our implementation is more robust than the standard public domain solvers SeDuMi (Self-Dual Minimization), SDPT3 (Semidefinite Programming Toh-Todd-Tütüncü) and the LSMR iterative solver in PDCO (Primal-Dual Barrier Method for Convex Objectives) without increasing CPU time. The proposed interior-point method based on iterative solvers succeeds in solving a fairly large number of LP instances from benchmark libraries under the standard stopping criteria. The work also presents a fairly extensive benchmark test for several renowned solvers including direct and iterative solvers.
      PubDate: 2019-06-06
  • Markov–Dubins interpolating curves
    • Abstract: A realistic generalization of the Markov–Dubins problem, which is concerned with finding the shortest planar curve of constrained curvature joining two points with prescribed tangents, is the requirement that the curve passes through a number of prescribed intermediate points/nodes. We refer to this generalization as the Markov–Dubins interpolation problem. We formulate this interpolation problem as an optimal control problem and obtain results about the structure of its solution using optimal control theory. The Markov–Dubins interpolants consist of a concatenation of circular (C) and straight-line (S) segments. Abnormal interpolating curves are shown to exist and characterized; however, if the interpolating curve contains a straight-line segment then it cannot be abnormal. We derive results about the stationarity, or criticality, of the feasible solutions of certain structure. In particular, any feasible interpolant with arc types of CSC in each stage is proved to be stationary, i.e., critical. We propose a numerical method for computing Markov–Dubins interpolating paths. We illustrate the theory and the numerical approach by four qualitatively different examples.
      PubDate: 2019-06-01
  • Linearization of Euclidean norm dependent inequalities applied to
           multibeam satellites design
    • Abstract: Euclidean norm computations over continuous variables appear naturally in the constraints or in the objective of many problems in the optimization literature, possibly defining non-convex feasible regions or cost functions. When some other variables have discrete domains, it positions the problem in the challenging Mixed Integer Nonlinear Programming (MINLP) class. For any MINLP where the nonlinearity is only present in the form of inequality constraints involving the Euclidean norm, we propose in this article an efficient methodology for linearizing the optimization problem at the cost of entirely controllable approximations even for non convex constraints. They make it possible to rely fully on Mixed Integer Linear Programming and all its strengths. We first empirically compare this linearization approach with a previously proposed linearization approach of the literature on the continuous k-center problem. This methodology is then successfully applied to a critical problem in the telecommunication satellite industry: the optimization of the beam layouts in multibeam satellite systems. We provide a proof of the NP-hardness of this very problem along with experiments on a realistic reference scenario.
      PubDate: 2019-06-01
  • Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer
    • Abstract: PIPS-SBB is a distributed-memory parallel solver with a scalable data distribution paradigm. It is designed to solve mixed integer programs (MIPs) with a dual-block angular structure, which is characteristic of deterministic-equivalent stochastic mixed-integer programs. In this paper, we present two different parallelizations of Branch & Bound (B&B), implementing both as extensions of PIPS-SBB, thus adding an additional layer of parallelism. In the first of the proposed frameworks, PIPS-PSBB, the coordination and load-balancing of the different optimization workers is done in a decentralized fashion. This new framework is designed to ensure all available cores are processing the most promising parts of the B&B tree. The second, ug[PIPS-SBB,MPI], is a parallel implementation using the Ubiquity Generator, a universal framework for parallelizing B&B tree search that has been sucessfully applied to other MIP solvers. We show the effects of leveraging multiple levels of parallelism in potentially improving scaling performance beyond thousands of cores.
      PubDate: 2019-06-01
  • Iteratively reweighted $$\ell _1$$ ℓ 1 algorithms with extrapolation
    • Abstract: Iteratively reweighted \(\ell _1\) algorithm is a popular algorithm for solving a large class of optimization problems whose objective is the sum of a Lipschitz differentiable loss function and a possibly nonconvex sparsity inducing regularizer. In this paper, motivated by the success of extrapolation techniques in accelerating first-order methods, we study how widely used extrapolation techniques such as those in Auslender and Teboulle (SIAM J Optim 16:697–725, 2006), Beck and Teboulle (SIAM J Imaging Sci 2:183–202, 2009), Lan et al. (Math Program 126:1–29, 2011) and Nesterov (Math Program 140:125–161, 2013) can be incorporated to possibly accelerate the iteratively reweighted \(\ell _1\) algorithm. We consider three versions of such algorithms. For each version, we exhibit an explicitly checkable condition on the extrapolation parameters so that the sequence generated provably clusters at a stationary point of the optimization problem. We also investigate global convergence under additional Kurdyka–Łojasiewicz assumptions on certain potential functions. Our numerical experiments show that our algorithms usually outperform the general iterative shrinkage and thresholding algorithm in Gong et al. (Proc Int Conf Mach Learn 28:37–45, 2013) and an adaptation of the iteratively reweighted \(\ell _1\) algorithm in Lu (Math Program 147:277–307, 2014, Algorithm 7) with nonmonotone line-search for solving random instances of log penalty regularized least squares problems in terms of both CPU time and solution quality.
      PubDate: 2019-06-01
  • Optimized choice of parameters in interior-point methods for linear
    • Abstract: In this work, we propose a predictor–corrector interior point method for linear programming in a primal–dual context, where the next iterate is chosen by the minimization of a polynomial merit function of three variables: the first is the steplength, the second defines the central path and the third models the weight of a corrector direction. The merit function minimization is performed by restricting it to constraints defined by a neighborhood of the central path that allows wide steps. In this framework, we combine different directions, such as the predictor, the corrector and the centering directions, with the aim of producing a better one. The proposed method generalizes most of predictor–corrector interior point methods, depending on the choice of the variables described above. Convergence analysis of the method is carried out, considering an initial point that has a good practical performance, which results in Q-linear convergence of the iterates with polynomial complexity. Numerical experiments using the Netlib test set are made, which show that this approach is competitive when compared to well established solvers, such as PCx.
      PubDate: 2019-06-01
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
Home (Search)
Subjects A-Z
Publishers A-Z
Your IP address:
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-