Newton's method for linear inequality systems
Pınar, M. Ç.
European Journal of Operational Research
710 - 719
Item Usage Stats
MetadataShow full item record
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.
Finite element method
Linear inequality systems
Piecewise quadratic functions
Published Version (Please cite this version)https://doi.org/10.1016/S0377-2217(97)00178-1
Showing items related by title, author, creator and subject.
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 ...
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 ...
Fast acceleration algorithm based on DFT expansion for the iterative MoM analysis of electromagnetic radiation/scattering from two-dimensional large phased arrays Ertürk, Vakur B.; Chou, H. T. (IEEE, 2002)An acceleration algorithm based on Discrete Fourier Transform (DFT) is developed to reduce the computational complexity and memory storages of iterative methods of moment (IMoM) solution to O(Ntot), where Ntot is the total ...