Interior Point Methods for Global Optimization
- 1 January 1996
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- An O(nL) Iteration Algorithm for Computing Bounds in Quadratic Optimization ProblemsPublished by World Scientific Pub Co Pte Ltd ,1993
- A continuous approach to inductive inferenceMathematical Programming, 1992
- A continuous method for computing bounds in integer quadratic optimization problemsJournal of Global Optimization, 1992
- An interior point algorithm to solve computationally difficult set covering problemsMathematical Programming, 1991
- A Unified Approach to Interior Point Algorithms for Linear Complementarity ProblemsPublished by Springer Nature ,1991
- Computational experience with an interior point algorithm on the satisfiability problemAnnals of Operations Research, 1990
- An interior-point approach to NP-complete problems. IContemporary Mathematics, 1990
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- A method for the solution of certain non-linear problems in least squaresQuarterly of Applied Mathematics, 1944