Newton's method for linear inequality systems
Date
1998Source Title
European Journal of Operational Research
Print ISSN
0377-2217
Publisher
Elsevier
Volume
107
Issue
3
Pages
710 - 719
Language
English
Type
ArticleItem Usage Stats
242
views
views
218
downloads
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
FinitenessLinear 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/25445Published Version (Please cite this version)
https://doi.org/10.1016/S0377-2217(97)00178-1Collections
Related items
Showing items related by title, author, creator and subject.
-
Analyzing large sparse Markov chains of Kronecker products
(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 ... -
Algorithms for linear and convex feasibility problems: A brief study of iterative projection, localization and subgradient methods
(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 ... -
Efficient analysis of large phased arrays using iterative MoM with DFT-based acceleration algorithm
(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 ...
