An interior point potential reduction method for constrained equations
- 1 August 1996
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 74 (2), 159-195
- https://doi.org/10.1007/bf02592210
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Commentary—Theory and Practice for Interior-Point MethodsINFORMS Journal on Computing, 1994
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the ArtINFORMS Journal on Computing, 1994
- Interior-Point Polynomial Algorithms in Convex ProgrammingPublished by Society for Industrial & Applied Mathematics (SIAM) ,1994
- A Unified Approach to Interior Point Algorithms for Linear Complementarity ProblemsLecture Notes in Computer Science, 1991
- Sensitivity Analysis of a Nonlinear Water Pollution Control Model Using an Upper Hudson River Data BaseOperations Research, 1982
- Test Examples for Nonlinear Programming CodesPublished by Springer Nature ,1981
- Comparison of Generalized Geometric Programming AlgorithmsPublished by Springer Nature ,1980
- A set of geometric programming test problems and their solutionsMathematical Programming, 1976
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- On approximate solutions of systems of linear inequalitiesJournal of Research of the National Bureau of Standards, 1952