Entropic perturbation method for solving a system of linear inequalities
From MaRDI portal
Publication:1612393
DOI10.1016/S0377-0427(01)00540-4zbMath1006.65064OpenAlexW2018719689MaRDI QIDQ1612393
H.-S. Jacob Tsao, Shu-Cherng Fang, Shyh-Huei Chen
Publication date: 22 August 2002
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(01)00540-4
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- A conjugate gradient algorithm for sparse linear inequalities
- New methods for linear inequalities
- Newton's method for linear inequality systems
- New iterative methods for linear inequalities
- Surrogate methods for linear inequalities
- A global Newton method. II: Analytic centers
- New contraction methods for linear inequalities
- Entropy optimization and mathematical programming
- Determining the interior point of a system of linear inequalities
- Smoothing methods for convex inequalities and linear complementarity problems
- An approach to nonlinear programming
- Fourier-Motzkin elimination and its dual
- On the exact solution of systems of linear inequalities and linear programming problems
- Matrix Analysis
- An unconstrained convex programming view of linear programming
- l1 solution of linear inequalities
- Solving Linear Inequalities in a Least Squares Sense
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Linear programming with entropic perturbation
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
This page was built for publication: Entropic perturbation method for solving a system of linear inequalities
