• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Newton's method for linear inequality systems

      Thumbnail
      View / Download
      916.7 Kb
      Author(s)
      Pınar, M. Ç.
      Date
      1998
      Source Title
      European Journal of Operational Research
      Print ISSN
      0377-2217
      Publisher
      Elsevier
      Volume
      107
      Issue
      3
      Pages
      710 - 719
      Language
      English
      Type
      Article
      Item Usage Stats
      242
      views
      218
      downloads
      Abstract
      We describe a modified Newton type algorithm for the solution of linear inequality systems in the sense of minimizing the ℓ2 norm of infeasibilities. Finite termination is proved, and numerical results are given. © 1998 Elsevier Science B.V.
      Keywords
      Finiteness
      Linear inequalities
      Newton's method
      Piecewise-quadratic functions
      Algorithms
      Finite element method
      Functions
      Numerical methods
      Theorem proving
      Linear inequality systems
      Newton's methods
      Piecewise quadratic functions
      Optimization
      Permalink
      http://hdl.handle.net/11693/25445
      Published Version (Please cite this version)
      https://doi.org/10.1016/S0377-2217(97)00178-1
      Collections
      • Department of Industrial Engineering 758
      Show full item record

      Related items

      Showing items related by title, author, creator and subject.

      • Thumbnail

        Analyzing large sparse Markov chains of Kronecker products 

        Dayar, Tuğrul (IEEE, 2009)
        Kronecker products are used to define the underlying Markov chain (MC) in various modeling formalisms, including compositional Markovian models, hierarchical Markovian models, and stochastic process algebras. The motivation ...
      • Thumbnail

        Algorithms for linear and convex feasibility problems: A brief study of iterative projection, localization and subgradient methods 

        Özaktaş, Hakan (Bilkent University, 1998)
        Several algorithms for the feasibility problem are investigated. For linear systems, a number of different block projections approaches have been implemented and compared. The parallel algorithm of Yang and Murty is ...
      • Thumbnail

        Efficient analysis of large phased arrays using iterative MoM with DFT-based acceleration algorithm 

        Ertürk, V. B.; Chou, H-T. (John Wiley & Sons, Inc., 2003)
        A discrete Fourier transform (DFT)-based iterative method of moments (IMoM) algorithm is developed to provide an O(Ntot) computational complexity and memory storages for the efficient analysis of electromagnetic ...

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the User and Access Services. Phone: (312) 290 1298
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy