Newton's method for linear inequality systems
From MaRDI portal
Publication:1296136
DOI10.1016/S0377-2217(97)00178-1zbMATH Open0927.90099OpenAlexW1983678001MaRDI QIDQ1296136FDOQ1296136
Authors: Mustafa Ç. Pınar 
Publication date: 23 September 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00178-1
Recommendations
Cites Work
- Robust Statistics
- Title not available (Why is that?)
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Title not available (Why is that?)
- Least Squares Computations by Givens Transformations Without Square Roots
- Solving Linear Inequalities in a Least Squares Sense
- On the structure of convex piecewise quadratic functions
- Smoothing methods for convex inequalities and linear complementarity problems
- Linear-Quadratic Programming and Optimal Control
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Iterative Solution of Linear Programs
- Finite algorithms for robust linear regression
- A new algorithm for the Huber estimator in linear models
- Normal solutions of linear programs
- Computational schemes for large-scale problems in extended linear- quadratic programming
- On the Modification of LDL T Factorizations
- Title not available (Why is that?)
- A Newton Method for Convex Regression, Data Smoothing, and Quadratic Programming with Bounded Constraints
- An Algorithm for Solving Nonlinear Resistor Networks
- Finite Algorithms for Huber’sM-Estimator
Cited In (15)
- Entropic perturbation method for solving a system of linear inequalities
- A hybrid algorithm for solving linear inequalities in a least squares sense
- On the solution of nonlinear inequalities in a finite number of iterations
- Solution of systems of equalities and inequalities by the method of interior points
- A new algorithm for solving linear inequalities systems problems
- Finite termination and global monotonicity of Newton-type methods for solving hybrid piecewise linear systems
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- Title not available (Why is that?)
- New contraction methods for linear inequalities
- Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense
- Rate of convergence of a class of numerical methods solving linear inequality systems
- Title not available (Why is that?)
- Partial Newton methods for a system of equations
- The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities
- Fast finite methods for a system of linear inequalities
Uses Software
This page was built for publication: Newton's method for linear inequality systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296136)
